期刊
JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS
卷 106, 期 2, 页码 -出版社
SPRINGER
DOI: 10.1007/s10846-022-01723-z
关键词
Micro aerial vehicles; Full coverage; Cooperative search; Task allocation; Connected vehicles
资金
- National Natural Science Foundation of China [61803105, 62121004, U1911401]
- Guangdong Introducing Innovative and Entrepreneurial Teams [2019ZT08X340]
- Guangdong Province Local Innovative and Research Teams Project of Guangdong Special Support Program [2019BT02X353]
- Key Area Research and Development Program of Guangdong Province [2021B0101410005]
This paper focuses on autonomous forest full coverage search using multiple micro aerial vehicles (MAVs). The authors propose a two-stage multi-MAV forest search strategy and solve the difficulties in autonomous task allocation and path planning. Simulation results show that this method improves the efficiency of cooperative search and guarantees full area coverage.
This paper is concerned with autonomous forest full coverage search using multiple micro aerial vehicles (MAVs). Due to the complex and cluttered environment, i.e., many obstacles under the forest canopy, it is quite challenging to achieve full coverage search using fully autonomous MAVs, e.g., quadrotors. In this work, we propose a two-stage multi-MAV forest search strategy. The first batch of MAVs provides a coarse search and mapping result using pre-defined or auto-generated paths. Based on that, the second batch of MAVs continues to search the multiple isolated regions missed by the first batch. The main difficulties fall in the autonomous task allocation and optimal cooperative coverage path planning for the second batch of MAVs, to achieve the full coverage goal. To address this problem, a task allocation algorithm based on the branch and bound principle is introduced to find the optimal search order of the missed regions. Furthermore, an optimal coverage path planning algorithm considering obstacle avoidance is proposed to cover each region. Simulation results show that our proposed method improves the efficiency of coverage path planning for cooperative search and guarantees full area coverage.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据