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 条
[1]   Morse decompositions for coverage tasks [J].
Acar, EU ;
Choset, H ;
Rizzi, AA ;
Atkar, PN ;
Hull, D .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2002, 21 (04) :331-344
[2]  
Agmon N., P 2006 IEEE INT C RO
[3]  
[Anonymous], 2007, Princeton Series in Applied Mathematics
[4]  
[Anonymous], 2001, TION ENGRG
[5]  
[Anonymous], 1943, Bulletin of the Calcultta Mathematical Society, DOI DOI 10.1038/157869B0
[6]  
[Anonymous], IEEE ASME INT C ADV
[7]  
[Anonymous], DISCRETE GLOBAL GRID
[8]  
[Anonymous], 2012, INT C AUT PLANN SCHE
[9]   APPROXIMATION ALGORITHMS FOR THE GEOMETRIC COVERING SALESMAN PROBLEM [J].
ARKIN, EM ;
HASSIN, R .
DISCRETE APPLIED MATHEMATICS, 1994, 55 (03) :197-218
[10]   Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum Time [J].
Avellar, Gustavo S. C. ;
Pereira, Guilherme A. S. ;
Pimenta, Luciano C. A. ;
Iscold, Paulo .
SENSORS, 2015, 15 (11) :27783-27803