arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.13065cs.RO
收藏

Multi-UAV Coverage Path Planning for the Inspection of Large and Complex Structures

A*STAR Institute of Information Research (IR)(新加坡科技研究局信息研究所);A*STAR Institute of High Performance Computing (IHPC)(新加坡科技研究局高性能计算研究所);A*STAR Initiative for Artificial Intelligence and Analytics (AI)(新加坡科技研究局人工智能与分析计划);Department of Mechanical Engineering, Carnegie Mellon University(卡内基梅隆大学机械工程系)

Wei Jing, Di Deng, Yan Wu, Kenji Shimada

英文摘要:

We present a multi-UAV Coverage Path Planning (CPP) framework for the inspection of large-scale, complex 3D structures. In the proposed sampling-based coverage path planning method, we formulate the multi-UAV inspection applications as a multi-agent coverage path planning problem. By combining two NP-hard problems: Set Covering Problem (SCP) and Vehicle Routing Problem (VRP), a Set-Covering Vehicle Routing Problem (SC-VRP) is formulated and subsequently solved by a modified Biased Random Key Genetic Algorithm (BRKGA) with novel, efficient encoding strategies and local improvement heuristics. We test our proposed method for several complex 3D structures with the 3D model extracted from OpenStreetMap. The proposed method outperforms previous methods, by reducing the length of the planned inspection path by up to 48%

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

↑