Coordinated motion planning for multiple car-like robots using probabilistic roadmaps

Presents a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment. The approach is probabilistically complete. That is, any solvable problem is guaranteed to be solved within a finite amount of time. The method, which is an extension of previous work on probabilistic single-robot planners, is very flexible in the sense that it can easily be applied to different robot types. In this paper the authors apply it to non-holonomic car-like robots, and present experimental results which show that the method is powerful and fast.