ArticlePDF Available

Decentralized Collision-Free Control of Multiple Robots in 2D and 3D Spaces


Abstract and Figures

Decentralized control of robots has attracted huge research interests. However, some of the research used unrealistic assumptions without collision avoidance. This report focuses on the collision-free control for multiple robots in both complete coverage and search tasks in 2D and 3D areas which are arbitrary unknown. All algorithms are decentralized as robots have limited abilities and they are mathematically proved. The report starts with the grid selection in the two tasks. Grid patterns simplify the representation of the area and robots only need to move straightly between neighbor vertices. For the 100% complete 2D coverage, the equilateral triangular grid is proposed. For the complete coverage ignoring the boundary effect, the grid with the fewest vertices is calculated in every situation for both 2D and 3D areas. The second part is for the complete coverage in 2D and 3D areas. A decentralized collision-free algorithm with the above selected grid is presented driving robots to sections which are furthest from the reference point. The area can be static or expanding, and the algorithm is simulated in MATLAB. Thirdly, three grid-based decentralized random algorithms with collision avoidance are provided to search targets in 2D or 3D areas. The number of targets can be known or unknown. In the first algorithm, robots choose vacant neighbors randomly with priorities on unvisited ones while the second one adds the repulsive force to disperse robots if they are close. In the third algorithm, if surrounded by visited vertices, the robot will use the breadth-first search algorithm to go to one of the nearest unvisited vertices via the grid. The second search algorithm is verified on Pioneer 3-DX robots. The general way to generate the formula to estimate the search time is demonstrated. Algorithms are compared with five other algorithms in MATLAB to show their effectiveness.
Content may be subject to copyright.
A preview of the PDF is not available
ResearchGate has not been able to resolve any citations for this publication.
Conference Paper
Nowadays there are a lot of kinds of cleaning robots which producted by different manufacturers come into people’s lives. But it is still a problem that how to evaluate each robot’s performance to check whether the quality is acceptable. In this paper, we make the first trial to evaluate the complete coverage path planning algorithm which is the core algorithm of a cleaning robot with Mocap system, and three simple metrics were proposed to evaluate overall performance of the algorithm. Lastly, the comparisons between different kinds of robots are presented.
This paper addresses a problem of complete sensing coverage in 3D environments. We propose a distributed random algorithm to drive mobile robotic sensors on the vertices of a truncated octahedral grid for complete sensing coverage of a bounded 3D area. Furthermore, we develop a distributed algorithm for the self-deployment of mobile sensors to form a desired 3D geometric shape on the vertices of the truncated octahedral grid. These algorithms are developed based on some consensus rules that only rely on local information. The proposed algorithms utilize 3D grids for the coverage task. Several simulations are conducted to illustrate the validity of the proposed distributed sensing coverage and formation building algorithms for a mobile robotic sensor network. Also, we give mathematically rigorous proof of the convergence with probability 1 of our proposed algorithms.
Although robotic coverage and collision avoidance are active areas of robotics research, the avoidance of collision situations between robots has often been neglected in the context of multi-robot coverage tasks. In fact, for robots of physical size, collisions are likely to happen during deployment and coverage in densely packed multi-robot configurations. For this reason, we aim to motivate by this paper the combined use of multi-robot coverage and reciprocal collision avoidance. We present a taxonomy of collision scenarios in multi-robot coverage problems. In particular, coverage tasks with built-in heterogeneity such as multiple antagonistic objectives or robot constraints are shown to benefit from the combination. Based on our taxonomy, we evaluate four representative robotic use cases in simulation by combining the specific methods of Voronoi coverage and reciprocal velocity obstacles.