An Algorithm with Improved Complexity for Pebble Motion/Multi-Agent Path Finding on Trees

The pebble motion on trees (PMT) problem consists in finding a feasible sequence of moves that repositions a set of pebbles to assigned target vertices. This problem has been widely studied because, in many cases, the more general Multi-Agent path finding (MAPF) problem on graphs can be reduced to PMT. We propose a simple and easy to implement procedure, which finds solutions of length O(|P|nc + n2), where n is the number of nodes, P is the set of pebbles, and c the maximum length of corridors in the tree. This complexity result is more detailed than the current best known result O(n3), which is equal to our result in the worst case, but does not capture the dependency on c and |P|.

Authors

• Stefano Ardizzoni a:1:{s:5:"en_US";s:20:"Università di Parma";}
• Irene Saccani
• Luca Consolini
• Marco Locatelli
• Bernhard Nebel University of Freiburg

Keywords

• Multiagent Systems
• planning
• robotics