Scalable multi-agent pathfinding on grid maps with tractability and completeness guarantees

Frontiers in Artificial Intelligence and Applications

Volumn 215, Issue , 2010, Pages 977-978

  Wang, Ko Hsin Cindy ^a   Botea, Adi ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

GRID MAP; MULTI AGENT; PATH FINDING;

MULTI AGENT SYSTEMS;

EID: 77956025855     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-60750-606-5-977     Document Type: Conference Paper

References (6)

1. D. Ratner and M. Warmuth, 'Finding a shortest solution for the N × N extension of the 15-puzzle is intractable', in AAAI, pp. 168-172, (1986).
2. D. Silver, 'Cooperative pathfinding', AI Programming Wisdom, 3, 99-111, (2006).
3. P. Surynek, 'An Application of Pebble Motion on Graphs to Abstract Multi-robot Path Planning', in ICTAI, pp. 151-158, (2009).
4. Pavel Surynek, 'An Optimization Variant of Multi-Robot Path Planning is Intractable', in AAAI, (2010).
5. K.-H. C. Wang and A. Botea, 'Fast and Memory-Efficient Multi-Agent Pathfinding', in ICAPS, pp. 380-387, (2008).
6. K.-H. C. Wang and A. Botea, 'Tractable Multi-Agent Path Planning on Grid Maps', in IJCAI, (2009).