Path-planning for multiple generic-shaped mobile robots with MCA

Abstract

In this paper is described a fast Path-Planner for Multi-robot composed by mobile robots having generic shapes and sizes (user defined) and different kinematics. We have developed an algorithm that computes the shortest collision-free path for each robot, from the starting pose to the goal pose, while considering their real shapes, avoiding the collisions with the static obstacles and the other robots. It is based on a directional (anisotropic) propagation of attracting potential values in a 4D Space-Time, using a Multilayered Cellular Automata (MCA) architecture. This algorithm searches for all the optimal collision-free trajectories following the minimum valley of a potential hypersurface embedded in a 5D Time-Space. © Springer-Verlag Berlin Heidelberg 2006.