Push and swap: Fast cooperative path-finding with completeness guarantees

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 294-300

  Luna, Ryan ^a   Bekris, Kostas E ^a  

^a UNIVERSITY OF NEVADA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE METHODS; FAST ALGORITHMS; GENERAL CLASS; HARD INSTANCES; MULTIPLE AGENTS; PATHFINDING; SIMULATED EXPERIMENTS; TWO AGENTS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE;

TOPOLOGY;

EID: 84867673423     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-059     Document Type: Conference Paper

References (11)

1. M. Bennewitz, W. Burgard, and S. Thrun. Finding and optimizing solvable priority schemes for decoupled path planning for mobile robots. Robotics and Autonomous Systems, 41(2):89-99, 2002. (Pubitemid 35282307)
2. M. Erdmann and T. Lozano-Perez. On multiple moving objects. In IEEE Intern. Conference on Robotics and Automation (ICRA), pages 1419-1424, 1986.
3. M. Peasgood, C. Clark, and J. McPhee. A complete and scalable strategy for coordinating multiple robots within roadmaps. IEEE Transactions on Robotics, 24(2):282-292, 2008.
4. S. Qutub, R. Alami, and F. Ingrand. How to solve deadlock situations within the plan-merging paradigm for multi-robot cooperation. In Proc. of the Inter. Conf. on Intelligent Robots and Systems (IROS), volume 3, pages 1610-1615, 1997.
5. M. R. K. Ryan. Graph decomposition for efficient multi-robot path planning. In International Joint Conference on Artificial Intelligence (IJCAI), pages 2003-2008, 2007.
6. David Silver. Cooperative pathfinding. In The 1st Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE'05), pages 23-28, 2005.
7. N. Sturtevant and M. Buro. Improving collaborative pathfinding using map abstraction. In The Second Artificial Intelligence for Interactive Digital Entertainment Conference (AIIDE'06), pages 80-85, 2006.
8. Pavel Surynek. Making solutions of multi-robot path planning problems shorter using weak transpositions and critical path parallelism. In International Symposium on Combinatorial Search, 2009.
9. J. van den Berg, J. Snoeyink, M. Lin, and D. Manocha. Centralized path planning for multiple robots: Optimal decoupling into sequential plans. In Robotics: Science and Systems V, 2009.
10. K.-H. C. Wang and A. Botea. Fast and Memory-Efficient Multi-Agent Pathfinding. In International Conference on Automated Planning and Scheduling (ICAPS), pages 380-387, Sydney, Australia, 2008.
11. K.-H. C. Wang and A. Botea. Tractable Multi-Agent Path Planning on Grid Maps. In Proceedings of the International Joint Conference on Artificial Intelligence IJCAI-09, pages 1870-1875, Pasadena, CA, USA, 2009.