arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.05808cs.ROcs.MA
收藏

基于动态拓扑图的快速多无人机探索方法:通过Voronoi划分提高通信效率

Fast and Communication-Efficient Multi-UAV Exploration Via Voronoi Partition on Dynamic Topological Graph

College of Artificial Intelligence, Nankai University(人工智能学院,南开大学)

Qianli Dong, Haobo Xi, Shiyong Zhang, Qingchen Bi, Tianyi Li, Ziyu Wang, Xuebo Zhang

AI总结:

本文提出基于动态拓扑图和图Voronoi划分的多无人机探索方法,通过高效通信和合理任务分配提升探索效率。

摘要:

高效的数据传输和合理的任务分配对于提高多机器人探索效率至关重要。然而,大多数通信数据类型通常包含冗余信息,因此需要大量的通信量。此外,以探索为导向的任务分配远非简单,对于资源有限的无人机(UAV)来说变得更加具有挑战性。在本文中,我们提出了一种快速且通信高效的多无人机探索方法,用于探索大型环境。我们首先设计了一个由节点表示已探索和探索区域、边连接节点组成的多机器人动态拓扑图(MR-DTG)。借助MR-DTG,我们的方法通过仅传输探索规划所需的必要信息实现了高效的通信。为了进一步提高探索效率,我们利用MR-DTG设计了一种分层多无人机探索方法。具体来说,使用图Voronoi划分将MR-DTG的节点分配给最近的无人机,考虑实际的运动成本,从而实现合理任务分配。到目前为止,这是首次利用图Voronoi划分解决多无人机探索问题的工作。所提出的方法在模拟中与最先进的方法进行比较。结果表明,所提出的方法能够将探索时间和通信量分别减少高达38.3%和95.5%。最后,我们的方法在现实世界实验中使用6架无人机进行了验证。我们还将发布源代码以造福社区。

英文摘要:

Efficient data transmission and reasonable task allocation are important to improve multi-robot exploration efficiency. However, most communication data types typically contain redundant information and thus require massive communication volume. Moreover, exploration-oriented task allocation is far from trivial and becomes even more challenging for resource-limited unmanned aerial vehicles (UAVs). In this paper, we propose a fast and communication-efficient multi-UAV exploration method for exploring large environments. We first design a multi-robot dynamic topological graph (MR-DTG) consisting of nodes representing the explored and exploring regions and edges connecting nodes. Supported by MR-DTG, our method achieves efficient communication by only transferring the necessary information required by exploration planning. To further improve the exploration efficiency, a hierarchical multi-UAV exploration method is devised using MR-DTG. Specifically, the \emph{graph Voronoi partition} is used to allocate MR-DTG's nodes to the closest UAVs, considering the actual motion cost, thus achieving reasonable task allocation. To our knowledge, this is the first work to address multi-UAV exploration using \emph{graph Voronoi partition}. The proposed method is compared with a state-of-the-art method in simulations. The results show that the proposed method is able to reduce the exploration time and communication volume by up to 38.3\% and 95.5\%, respectively. Finally, the effectiveness of our method is validated in the real-world experiment with 6 UAVs. We will release the source code to benefit the community.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑