首页> 外文期刊>Robotics >A Sensor-Network-Supported Mobile-Agent-Search Strategy for Wilderness Rescue
【24h】

A Sensor-Network-Supported Mobile-Agent-Search Strategy for Wilderness Rescue

机译:支持荒野救援的传感器网络支持的移动代理搜索策略

获取原文
           

摘要

Mobile target search is a problem pertinent to a variety of applications, including wilderness search and rescue. This paper proposes a hybrid approach for target search utilizing a team of mobile agents supported by a network of static sensors. The approach is novel in that the mobile agents deploy the sensors at optimized times and locations while they themselves travel along their respective optimized search trajectories. In the proposed approach, mobile-agent trajectories are first planned to maximize the likelihood of target detection. The deployment of the static-sensor network is subsequently planned. Namely, deployment locations and times are optimized while being constrained by the already planned mobile-agent trajectories. The latter optimization problem, as formulated and solved herein, aims to minimize an overall network-deployment error. This overall error comprises three main components, each quantifying a deviation from one of three main objectives the network aims to achieve: (i) maintaining directional unbiasedness in target-motion consideration, (ii) maintaining unbiasedness in temporal search-effort distribution, and, (iii) maximizing the likelihood of target detection. We solve this unique optimization problem using an iterative heuristic-based algorithm with random starts. The proposed hybrid search strategy was validated through the extensive simulations presented in this paper. Furthermore, its performance was evaluated with respect to an alternative hybrid search strategy, where it either outperformed or performed comparably depending on the search resources available.
机译:移动目标搜索是与各种应用有关的问题,包括荒野搜索和救援。本文提出了利用静态传感器网络支持的移动代理团队的目标搜索混合方法。该方法是新颖的,因为移动代理在优化的时间和位置部署了传感器,而它们本身沿着各自的优化搜索轨迹行驶。在提出的方法中,首先计划移动代理轨迹以最大化目标检测的可能性。随后计划静态传感器网络的部署。即,部署位置和时间是优化的,同时由已计划的移动代理轨迹约束。如本文所制定和解决的后一种优化问题旨在最小化整体网络部署错误。这一整体错误包括三个主要组件,每个主要组成部分都量化网络旨在实现:(i)在目标运动考虑中保持方向无偏见,(ii)维持在时间搜查努力分布中的无偏见,, (iii)最大化目标检测的可能性。我们使用基于迭代启发式的算法来解决这种独特的优化问题,随机开始。通过本文提出的广泛模拟验证了所提出的混合搜索策略。此外,它的性能是关于替代混合搜索策略评估的,其中它根据可用的搜索资源而表现出较差或执行。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号