首页> 美国卫生研究院文献>Sensors (Basel Switzerland) >A Cooperative Search and Coverage Algorithm with Controllable Revisit and Connectivity Maintenance for Multiple Unmanned Aerial Vehicles
【2h】

A Cooperative Search and Coverage Algorithm with Controllable Revisit and Connectivity Maintenance for Multiple Unmanned Aerial Vehicles

机译:具有可访问性和可维护性的多人无人机复式协作搜索和覆盖算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this paper, we mainly study a cooperative search and coverage algorithm for a given bounded rectangle region, which contains several unknown stationary targets, by a team of unmanned aerial vehicles (UAVs) with non-ideal sensors and limited communication ranges. Our goal is to minimize the search time, while gathering more information about the environment and finding more targets. For this purpose, a novel cooperative search and coverage algorithm with controllable revisit mechanism is presented. Firstly, as the representation of the environment, the cognitive maps that included the target probability map (TPM), the uncertain map (UM), and the digital pheromone map (DPM) are constituted. We also design a distributed update and fusion scheme for the cognitive map. This update and fusion scheme can guarantee that each one of the cognitive maps converges to the same one, which reflects the targets’ true existence or absence in each cell of the search region. Secondly, we develop a controllable revisit mechanism based on the DPM. This mechanism can concentrate the UAVs to revisit sub-areas that have a large target probability or high uncertainty. Thirdly, in the frame of distributed receding horizon optimizing, a path planning algorithm for the multi-UAVs cooperative search and coverage is designed. In the path planning algorithm, the movement of the UAVs is restricted by the potential fields to meet the requirements of avoiding collision and maintaining connectivity constraints. Moreover, using the minimum spanning tree (MST) topology optimization strategy, we can obtain a tradeoff between the search coverage enhancement and the connectivity maintenance. The feasibility of the proposed algorithm is demonstrated by comparison simulations by way of analyzing the effects of the controllable revisit mechanism and the connectivity maintenance scheme. The Monte Carlo method is employed to validate the influence of the number of UAVs, the sensing radius, the detection and false alarm probabilities, and the communication range on the proposed algorithm.
机译:在本文中,我们主要研究由具有非理想传感器和有限通信距离的无人飞行器(UAV)团队针对给定的边界矩形区域(包含多个未知静止目标)的协作搜索和覆盖算法。我们的目标是减少搜索时间,同时收集有关环境的更多信息并找到更多目标。为此,提出了一种具有可控重访机制的新型协作搜索和覆盖算法。首先,作为环境的表示,构成包括目标概率图(TPM),不确定图(UM)和数字信息素图(DPM)的认知图。我们还为认知图设计了分布式更新和融合方案。这种更新和融合方案可以确保每个认知图都收敛到同一图,从而反映出目标在搜索区域的每个单元格中的真实存在或不存在。其次,我们开发了基于DPM的可控重访机制。这种机制可以使无人机集中精力重新访问具有较大目标概率或较高不确定性的子区域。第三,在分布式后向视野优化框架下,设计了多无人机协同搜索和覆盖的路径规划算法。在路径规划算法中,无人机的运动受到潜在场的限制,以满足避免碰撞和保持连接性约束的要求。此外,使用最小生成树(MST)拓扑优化策略,我们可以在搜索范围增强和连接性维护之间进行权衡。通过分析可控重访机制和连通性维护方案的效果,通过比较仿真证明了该算法的可行性。采用蒙特卡罗方法验证了无人机数量,感应半径,检测和虚警概率以及通信范围对算法的影响。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号