A Multi-Robot Coverage Path Planning Method Based On Genetic Algorithm

Author(s):  
Wen-Hao Li ◽  
Tao Zhao ◽  
Song-Yi Dian
2010 ◽  
Vol 23 (4) ◽  
pp. 1035-1045 ◽  
Author(s):  
Muzaffer Kapanoglu ◽  
Mete Alikalfa ◽  
Metin Ozkan ◽  
Ahmet Yazıcı ◽  
Osman Parlaktuna

2021 ◽  
Author(s):  
Mengqing Fan ◽  
Jiawang He ◽  
Susheng Ding ◽  
Yuanhao Ding ◽  
Meng Li ◽  
...  

2011 ◽  
Vol 328-330 ◽  
pp. 1881-1886
Author(s):  
Cen Zeng ◽  
Qiang Zhang ◽  
Xiao Peng Wei

Genetic algorithm (GA), a kind of global and probabilistic optimization algorithms with high performance, have been paid broad attentions by researchers world wide and plentiful achievements have been made.This paper presents a algorithm to develop the path planning into a given search space using GA in the order of full-area coverage and the obstacle avoiding automatically. Specific genetic operators (such as selection, crossover, mutation) are introduced, and especially the handling of exceptional situations is described in detail. After that, an active genetic algorithm is introduced which allows to overcome the drawbacks of the earlier version of Full-area coverage path planning algorithms.The comparison between some of the well-known algorithms and genetic algorithm is demonstrated in this paper. our path-planning genetic algorithm yields the best performance on the flexibility and the coverage. This meets the needs of polygon obstacles. For full-area coverage path-planning, a genotype that is able to address the more complicated search spaces.


Author(s):  
Prithviraj Dasgupta

The multi-robot coverage path-planning problem involves finding collision-free paths for a set of robots so that they can completely cover the surface of an environment. This problem is non-trivial as the geometry and location of obstacles in the environment is usually not known a priori by the robots, and they have to adapt their coverage path as they discover obstacles while moving in the environment. Additionally, the robots have to avoid repeated coverage of the same region by each other to reduce the coverage time and energy expended. This chapter discusses the research results in developing multi-robot coverage path planning techniques using mini-robots that are coordinated to move in formation. The authors present theoretical and experimental results of the proposed approach using e-puck mini-robots. Finally, they discuss some preliminary results to lay the foundation of future research for improved coverage path planning using coalition game-based, structured, robot team reconfiguration techniques.


Robotica ◽  
2018 ◽  
Vol 36 (8) ◽  
pp. 1144-1166 ◽  
Author(s):  
Héctor Azpúrua ◽  
Gustavo M. Freitas ◽  
Douglas G. Macharet ◽  
Mario F. M. Campos

SUMMARYThe 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.


Sign in / Sign up

Export Citation Format

Share Document