This paper presents a novel algorithm to solve the robot formation path planning problem working under uncertainty conditions such as errors the in robot's positions, errors when sensing obstacles or walls, etc. The proposed approach provides a solution based on a leader-followers architecture (real or virtual leaders) with a prescribed formation geometry that adapts dynamically to the environment. The algorithm described herein is able to provide safe, collision-free paths, avoiding obstacles and deforming the geometry of the formation when required by environmental conditions (e.g. narrow passages). To obtain a better approach to the problem of robot formation path planning the algorithm proposed includes uncertainties in obstacles' and robots' positions. The algorithm applies the Fast Marching Square (FM2) method to the path planning of mobile robot formations, which has been proved to work quickly and efficiently. The FM2 method is a path planning method with no local minima that provides smooth and safe trajectories to the robots creating a time function based on the properties of the propagation of the electromagnetic waves and depending on the environment conditions. This method allows to easily include the uncertainty reducing the computational cost significantly. The results presented here show that the proposed algorithm allows the formation to react to both static and dynamic obstacles with an easily changeable behavior. ; This work is included in the project number DPI2010-17772 funded by the Spanish Ministry of Science and Innovation and has been supported by the CAM Project S2009/DPI-1559/ROBOCITY2030 II, developed by the research team RoboticsLab at the University Carlos III of Madrid. ; Publicado
Planning robot formations with fast marching square including uncertainty conditions
2013-02-01
AR/0000012955
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
DDC: | 629 |
Gaussian processes and Fast Marching Square based informative path planning
BASE | 2023
|UAVs mission planning with flight level constraint using Fast Marching Square Method
BASE | 2017
|