Multi-robot coverage path planning using hexagonal segmentation for geophysical surveys

被引:48
作者
Azpurua, Hector [1 ,2 ]
Freitas, Gustavo M. [2 ]
Macharet, Douglas G. [1 ]
Campos, Mario F. M. [1 ]
机构
[1] Univ Fed Minas Gerais, Dept Comp Sci, BR-31270901 Belo Horizonte, MG, Brazil
[2] Inst Tecnol Vale, BR-35400000 Ouro Preto, MG, Brazil
关键词
Multi-robot systems; Area coverage; Path planning; Geophysical surveys; AREA COVERAGE; DECOMPOSITIONS; ALGORITHMS;
D O I
10.1017/S0263574718000292
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
The field of robotics has received significant attention in our society due to the extensive use of robotic manipulators; however, recent advances in the research on autonomous vehicles have demonstrated a broader range of applications, such as exploration, surveillance, and environmental monitoring. In this sense, the problem of efficiently building a model of the environment using cooperative mobile robots is critical. Finding routes that are either length or time-optimized is essential for real-world applications of small autonomous robots. This paper addresses the problem of multi-robot area coverage path planning for geophysical surveys. Such surveys have many applications in mineral exploration, geology, archeology, and oceanography, among other fields. We propose a methodology that segments the environment into hexagonal cells and allocates groups of robots to different clusters of non-obstructed cells to acquire data. Cells can be covered by lawnmower, square or centroid patterns with specific configurations to address the constraints of magneto-metric surveys. Several trials were executed in a simulated environment, and a statistical investigation of the results is provided. We also report the results of experiments that were performed with real Unmanned Aerial Vehicles in an outdoor setting.
引用
收藏
页码:1144 / 1166
页数:23
相关论文
共 51 条
[21]  
Guo Y., P 2006 IEEE INT C RO
[22]  
Haung WH, 2001, IEEE INT CONF ROBOT, P27, DOI 10.1109/ROBOT.2001.932525
[23]   Towards robust on-line multi-robot coverage [J].
Hazon, Noam ;
Mieli, Fabrizio ;
Kaminka, Gal A. .
2006 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), VOLS 1-10, 2006, :1710-+
[24]   Polygon area decomposition for multiple-robot workspace division [J].
Hert, S ;
Lumelsky, V .
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1998, 8 (04) :437-466
[25]  
Jan GE, 2014, IEEE IJCNN, P961, DOI 10.1109/IJCNN.2014.6889862
[26]   DIVERGENCE AND BHATTACHARYYA DISTANCE MEASURES IN SIGNAL SELECTION [J].
KAILATH, T .
IEEE TRANSACTIONS ON COMMUNICATION TECHNOLOGY, 1967, CO15 (01) :52-&
[27]   The number of circles covering a set [J].
Kershner, R .
AMERICAN JOURNAL OF MATHEMATICS, 1939, 61 :665-671
[28]   Hierarchical Heuristic Search Using a Gaussian Mixture Model for UAV Coverage Planning [J].
Lin, Lanny ;
Goodrich, Michael A. .
IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (12) :2532-2544
[29]  
LLOYD SP, 1982, IEEE T INFORM THEORY, V28, P129, DOI 10.1109/TIT.1982.1056489
[30]   DYNAMIC PATH PLANNING IN SENSOR-BASED TERRAIN ACQUISITION [J].
LUMELSKY, VJ ;
MUKHOPADHYAY, S ;
SUN, K .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1990, 6 (04) :462-472