首页> 外文会议>IEEE Vehicular Technology Conference >Decentralized Target Search in Topology Maps Based on Weighted Least Square Method
【24h】

Decentralized Target Search in Topology Maps Based on Weighted Least Square Method

机译:基于加权最小二乘法的拓扑地图分散目标搜索。

获取原文

摘要

A distributed target search and predictive approach that uses wireless sensor network topology map is presented in this paper. The decision-making and information gathering is distributed, and the target prediction is based on the weighted least square method. The knowledge of target location and moving direction is obtained by time sets recorded by each sensor node. Time set is a collection of time values that describes when the target was detected by a particular node. All the locations are calculated in a topology map, which is an economical alternative to physical map. The results show that the proposed method has been able to search the target, even though the target changes the moving pattern from time to time. In addition, the robot avoids the obstacles and searches for the target in an effective way.
机译:本文提出了一种使用无线传感器网络拓扑图的分布式目标搜索和预测方法。决策和信息收集是分布式的,目标预测是基于加权最小二乘法的。目标位置和移动方向的知识是通过每个传感器节点记录的时间集获得的。时间集是描述特定节点何时检测到目标的时间值的集合。所有位置都在拓扑图中进行计算,这是物理图的经济替代方案。结果表明,即使目标不时改变运动模式,该方法也能够搜索目标。此外,机器人可以避开障碍物并有效地搜索目标。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号