Non-optimal multi-agent pathfinding is solved (since 1984)

Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012

Volumn , Issue , 2012, Pages 173-174

  Röger, Gabriele ^a   Helmert, Malte ^a  

^a UNIVERSITY OF BASEL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTIVE PROOF; OPTIMAL SOLUTIONS; PATHFINDING; POLYNOMIAL ALGORITHM; RELATED WORKS; RESEARCH COMMUNITIES; SUB-OPTIMAL ALGORITHMS;

ALGORITHMS; ROBOTICS;

OPTIMIZATION;

EID: 84893391659     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Khorshid, M.; Holte, R. C.; and Sturtevant, N. 2011. A polynomial-time algorithm for non-optimal multi-agent pathfinding. In Borrajo, D.; Likhachev, M.; and Linares Ĺopez, C., eds., Proceedings of the Fourth Annual Symposium on Combinatorial Search (SOCS 2011), 76-83. AAAI Press.
2. Kornhauser, D.; Miller, G. L.; and Spirakis, P. 1984. Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. In Proceedings of the 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 241-250.
3. Kornhauser, D. M. 1984. Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. Technical Report MIT/LCS/TR-320, Massachusetts Institute of Technology.
4. Luna, R., and Bekris, K. E. 2011a. Efficient and complete centralized multi-robot path planning. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2011), 3268-3275.
5. Luna, R., and Bekris, K. E. 2011b. Push and swap: Fast cooperative path-finding with completeness guarantees. In Walsh, T., ed., Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), 294-300.
6. Peasgood, M.; Clark, C. M.; and McPhee, J. 2008. Complete and scalable multi-robot roadmap coordination planning. IEEE Transactions on Robotics 24(2):283-292.
7. Surynek, P. 2009a. An application of pebble motion on graphs to abstract multi-robot path planning. In Proceedings of the 21st International Conference on Tools with Artificial Intelligence (ICTAI 2009), 151-158.
8. Surynek, P. 2009b. A novel approach to path planning for multiple robots in bi-connected graphs. In Proceedings of the 2009 IEEE International Conference on Robotics and Automation (ICRA 2009), 3613-3619.
9. Wang, K.-H. C., and Botea, A. 2011. MAPP: a scalable multi-agent path planning algorithm with tractability and completeness guarantees. Journal of Artificial Intelligence Research 42:55-90.
10. Wilson, R. M. 1974. Graph puzzles, homotopy, and the alternating group. Journal of Combinatorial Theory (Series B) 16(1):86-96.