Tractable massively multi-agent pathfinding with solution quality and completeness guarantees

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 2860-2861

  Wang, Ko Hsin Cindy ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (9)

1. D. Ratner and M. Warmuth. Finding a shortest solution for the N x N extension of the 15-puzzle is intractable. In AAAI, pages 168-172, 1986.
2. M. R. K. Ryan. Exploiting Subgraph Structure in Multi-Robot Path Planning. JAIR, 31:497-542, 2008.
3. D. Silver. Cooperative Pathfinding. In AIIDE, pages 117-122, 2005.
4. D. Silver. Cooperative pathfinding. AI Programming Wisdom, 3:99-111, 2006.
5. Trevor Standley. Finding Optimal Solutions to Cooperative Pathfinding Problems. In AAAI, pages 173-178, 2010.
6. P. Surynek. A novel approach to path planning for multiple robots in bi-connected graphs. In ICRA, pages 3613-3619, 2009.
7. K.-H. C. Wang and A. Botea. Fast and Memory-Efficient Multi-Agent Pathfinding. In ICAPS, pages 380-387, 2008.
8. K.-H. C. Wang and A. Botea. Tractable Multi-Agent Path Planning on Grid Maps. In IJCAI, pages 1870-1875, 2009.
9. K.-H. C. Wang and A. Botea. Scalable Multi-Agent Pathfinding on Grid Maps with Tractability and Completeness Guarantees. In ECAI, pages 977-978, 2010.