Finding graph topologies for feasible multirobot motion planning
Pushkar Kolhe, Henrik I. Christensen · 2012
In this paper we present a design methodology for mapping the configuration space of multirobot systems in a warehouse. The method generates a tree topology with robot and terminal nodes. In the most general case multirobot motion planning problems are NP-complete. But, we show that pebble motion problems in the resultant tree topology are always feasible. Our method uses an integer programming formulation to find such a solution.