MAPP: A scalable multi-agent path planning algorithm with tractability and completeness guarantees

Journal of Artificial Intelligence Research

Volumn 42, Issue , 2011, Pages 55-90

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

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINED STATE; DECENTRALIZED APPROACH; GRID MAP; MEMORY REQUIREMENTS; MOBILE UNITS; OFFLINE; PATH-PLANNING ALGORITHM; PROBLEM DECOMPOSITION; REAL-LIFE APPLICATIONS; RUNNING TIME; SOLUTION QUALITY; STATE SPACE; TRACTABLE ALGORITHMS; UNDIRECTED GRAPH; UPPER BOUND;

ALGORITHMS; POLYNOMIALS;

PROBLEM SOLVING;

EID: 84863070944     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3370     Document Type: Article

References (33)

1. Barraquand, J., Langlois, B., & Latombe, J.-C. (1991). Numerical potential field techniques for robot path planning. In International Conference on Advanced Robotics (ICAR), Vol. 2, pp. 1012-1017.
2. Bulitko, V., Sturtevant, N., Lu, J., & Yau, T. (2007). Graph Abstraction in Real-time Heuristic Search. Journal of Artificial Intelligence Research (JAIR), 30, 51-100. (Pubitemid 351147763)
3. Choset, H., Lynch, K., Hutchinson, S., Kantor, G., Burgard, W., Kavaraki, L., & Thrun, S. (2005). Principles of Robot Motion: Theory, Algorithms, and Implementation. The MIT Press.
4. Erdmann, M., & Lozano-Perez, T. (1986). On Multiple Moving Objects. In IEEE International Conference on Robotics and Automation (ICRA), pp. 1419-1424.
5. Geramifard, A., Chubak, P., & Bulitko, V. (2006). Biased Cost Pathfinding. In Artificial Intelligence and Interactive Digital Entertainment conference (AIIDE), pp. 112-114.
6. Hart, P., Nilsson, N., & Raphael, B. (1968). A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100-107.
7. Hopcroft, J. E., Schwartz, J. T., & Sharir, M. (1984). On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the "warehouseman's problem". Interna-tional Journal of Robotics Research (IJRR), 3(4), 76-88. (Pubitemid 15512057)
8. Jansen, R., & Sturtevant, N. (2008). A New Approach to Cooperative Pathfinding. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 1401-1404.
9. Kant, K., & Zucker, S. W. (1986). Toward Efficient Trajectory Planning: The Path-Velocity Decom-position. International Journal of Robotics Research (IJRR), 5(3), 72-89. (Pubitemid 17476814)
10. Kornhauser, D., Miller, G., & Spirakis, P. (1984). Coordinating pebble motion on graphs, the diam-eter of permutation groups, and applications. In Proceedings of the 25th Annual Symposium on Foundations of Computer Science (FOCS), pp. 241-250. (Pubitemid 16526253)
11. Latombe,J.-C. (1991). Robot Motion Planning. Kluwer Academic Publishers.
12. Papadimitriou, C., Raghavan, P., Sudan, M., & Tamaki, H. (1994). Motion planning on a graph. In 35th Annual Symposium on Foundations of Computer Science, pp. 511-520.
13. Pottinger, D. (1999). Coordinated Unit Movement. http://www.gamasutra. com/view/feature/3313/coordinated-unit-movement.php.
14. Rabin, S. (2000). A* Speed Optimizations. In Deloura, M. (Ed.), Game Programming Gems, pp. 272-287. Charles River Media.
15. Ratner, D., & Warmuth, M. (1986). Finding a shortest solution for the N × N extension of the 15-puzzle is intractable. In Proceedings of AAAI National Conference on Artificial Intelligence (AAAI-86), pp. 168-172.
16. Ryan, M. R. K. (2008). Exploiting Subgraph Structure in Multi-Robot Path Planning. Journal of Artificial Intelligence Research (JAIR), 31,497-542. (Pubitemid 351761995)
17. Samet, H. (1988). An Overview of Quadtrees, Octrees, and Related Hierarchical Data Structures. NATO ASI Series, Vol. F40.
18. Silver, D. (2005). Cooperative Pathfinding. In Artificial Intelligence and Interactive Digital Enter-tainment conference (AIIDE), pp. 117-122.
19. Silver, D. (2006). Cooperative pathfinding. AIProgramming Wisdom, 3, 99-111.
20. Standley, T. (2010). Finding Optimal Solutions to Cooperative Pathfinding Problems. In Proceed-ings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI-10), pp. 173-178.
21. Stout, B. (1996). Smart Moves: Intelligent Pathfinding. Game Developer Magazine.
22. Sturtevant, N. R., & Buro, M. (2006). Improving collaborative pathfinding using map abstraction.. In Artificial Intelligence and Interactive Digital Entertainment (AIIDE), pp. 80-85.
23. Surynek, P. (2009a). An Application of Pebble Motion on Graphs to Abstract Multi-robot Path Plan-ning. In Proceedings of the 21st International Conference on Tools with Artificial Intelligence (ICTAI),pp. 151-158.
24. Surynek, P. (2009b). A novel approach to path planning for multiple robots in bi-connected graphs. In IEEEInternational Conference on Robotics and Automation (ICRA), pp. 3613-3619.
25. Surynek, P. (2010a) personal communication.
26. Surynek, P. (2010b). An Optimization Variant of Multi-Robot Path Planning is Intractable. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI-10), pp. 1261-1263.
27. Surynek, P. (2010c). Multi-robot Path Planning, pp. 267-290. In Tech - Open Access Publisher.
28. Tarjan, R. E. (1976). Edge-disjoint spanning trees and depth-first search. Acta Informatica, 6(2), 171-185.
29. Tozour, P. (2002). Building a Near-Optimal Navigation Mesh. In Rabin, S. (Ed.), AI Game Pro-gramming Wisdom, pp. 171-185. Charles River Media.
30. Wang, K.-H. C., & Botea, A. (2008). Fast and Memory-Efficient Multi-Agent Pathfinding. In Pro-ceedings of the International Conference on Automated Planning and Scheduling (ICAPS), pp. 380-387.
31. Wang, K.-H. C., & Botea, A. (2009). Tractable Multi-Agent Path Planning on Grid Maps. In Pro-ceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 1870-1875.
32. Wang, K.-H. C., & Botea, A. (2010). Scalable Multi-Agent Pathfinding on Grid Maps with Tractability and Completeness Guarantees. In Proceedings of the European Conference on Artificial Intelligence (ECAI), pp. 977-978.
33. Zelinsky, A. (1992). A mobile robot navigation exploration algorithm. IEEE Transactions of Robotics and Automation, 8(6), 707-717.