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.
Active Informative Planning for UAV-based Weed Mapping using Discrete Gaussian Process Representations
Lincoln Centre for Autonomous Systems (L-CAS)(林肯自主系统中心);Faculty of Aerospace Engineering, MAVLab(航空航天工程学院);Delft University of Technology (TU Delft)(代尔夫特理工大学)
Balanced Collaborative Exploration via Distributed Topological Graph Voronoi Partition
College of Electrical Engineering, Zhejiang University(浙江大学电气工程学院);Jinhua Institute of Zhejiang University(浙江大学金华研究院);National Key Laboratory of Human-Machine Hybrid Augmented Intelligence, Xi’an Jiaotong University(西安交通大学人机混合增强智能国家级重点实验室);National Key Laboratory of Industrial Control Technology, Zhejiang University(浙江大学工业控制技术国家级重点实验室)
A Generalized Voronoi Graph based Coverage Control Approach for Non-Convex Environment
Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente(代尔夫特理工大学电子工程、数学和计算机科学学院);Department of Electrical Engineering, Wright State University(怀特州立大学电子工程系);College of Electrical Engineering, Zhejiang University(浙江大学电气工程学院);State Key Laboratory of Industrial Control Technology, Zhejiang University(浙江大学工业控制技术国家重点实验室);National Key Laboratory of Human-Machine Hybrid Augmented Intelligence, Xi’an Jiaotong University(西安交通大学人机混合增强智能国家级重点实验室)