论文信息 - Fast, Near-Optimal Computation for Multi-Robot Path Planning on Graphs

Fast, Near-Optimal Computation for Multi-Robot Path Planning on Graphs

We report a new method for computing near optimal makespan solutions to multi-robot path planning problem on graphs. Our focus here is with hard instances - those with up to 85% of all graph nodes occupied by robots. Our method yields 100-1000x speedup compared with existing methods. At the same time, our solutions have much smaller and often optimal makespans.

Steven M. LaValle | Jingjin Yu

[1] Malcolm Ross Kinsella Ryan. Exploiting Subgraph Structure in Multi-Robot Path Planning , 2008, J. Artif. Intell. Res..

[2] Steven M. LaValle,et al. Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs , 2013, AAAI.

[3] Steven M. LaValle,et al. Planning optimal paths for multiple robots on graphs , 2012, 2013 IEEE International Conference on Robotics and Automation.

[4] Richard E. Korf,et al. Complete Algorithms for Cooperative Pathfinding Problems , 2011, IJCAI.

[5] Raffaello D'Andrea,et al. Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses , 2007, AI Mag..

[6] Pavel Surynek,et al. Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving , 2012, PRICAI.

[7] Paul G. Spirakis,et al. Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications , 2015, FOCS.

[8] Pavel Surynek. A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints , 2012, SOCS.

[9] Jie Ding,et al. Scheduling of microfluidic operations for reconfigurabletwo-dimensional electrowetting arrays , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10] David Silver,et al. Cooperative Pathfinding , 2005, AIIDE.