Multirobot motion coordination using a deliberative approach

The paper investigates the practical use of the motion plan quality and of the motion plan robustness measures coupled with a deliberative scheduling approach, for computing safe motions for multiple mobile robots. The use of any-time algorithms allows one to evaluate the opportunity of looking for alternative solution paths by generating small variations of robot motions in space and in time. By using the concept of plan robustness, we generate several alternative paths that are evaluated through various performance indices and impact factors, by some heuristic rules. These indices allow one to know how much a variation affects a given plan. Finally, we outline some recent experiments