Graph decomposition for efficient multi-robot path planning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2003-2008

  Ryan, Malcolm ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONTAINER YARD; FORMAL PROPERTIES; GRAPH DECOMPOSITIONS; LEVEL OF ABSTRACTION; MULTI-ROBOT PATH PLANNING; PLANNING PROBLEM; PLANNING TASKS; SEARCH SPACES;

ARTIFICIAL INTELLIGENCE;

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

References (13)

1. Barbehenn, M., &Hutchinson, S. (1995). Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees. IEEE transactions on robotics and automation, 11(2), 198-214.
2. Barraquand, J., & Latombe, J.-C. (1991). Robot motion planning: A distributed representation approach. Int. Journal of Robotics Research, 10 (6), 628-649.
3. Berg, J. van den, & Overmars,M. (2005). Prioritized Motion Planning for Multiple Robots. In Proc. Int. Conf. on Intelligent Robots and Systems (p. 430-435).
4. Choset, H., & Burdick, J. (1995). Sensor based planning. I. The generalized Voronoi graph. Robotics and Automation, 1995. Proceedings., 1995 IEEE International Conference on, 2.
5. Conte, G., & Zulli, R. (1995, April). Hierarchical path planning in a multi-robot environment with asimple navigation function. IEEE Transactions on Systems, Man and Cybernetics, 25(4), 651-654.
6. Erdmann, M., & Lozano-Pérez, T. (1986). On Multiple Moving Objects (Tech. Rep. No. 883). M.I.T. AI Lab.
7. LaValle, S. M. (2006). Planning Algorithms. Cambridge University Press.
8. LaValle, S. M., & Hutchinson, S. A. (1998). Optimal Motion Planning for Multiple Robots Having Independent Goals. In IEEE Trans. on Robotics and Automation (Vol. 14).
9. Long, D., & Fox, M. (2002). Planning with generic types. In G. Lakemeyer & B. Nebel (Eds.), Exploring Artificial Intelligence in the New Millenium (p. 103-138). Morgan Kaufmann.
10. McCluskey, T. L., & Simpson, R. (2004). Knowledge Formulation for AI Planning. In A. E.Motta N.Shadbolt & N.Gibbins (Eds.), Engineering knowledge in the age of the semantic web (p. 449-465). Springer.
11. Porteous, J., Long, D., & Fox, M. (2004). The Identification and Exploitation of Almost Symmetry in Planning Problems. In K. Brown (Ed.), Proc. of the 23rd UK Planning and Scheduling SIG.
12. Ryan, M. R. K. (2006). Multi-robot path planning with subgraphs. In Proc. of the 19th Australasian Conference Robotics and Automation.
13. Zivkovic, Z., Bakker, B., & Kröse, B. (2006). Hierarchical Map Building and Planning based on Graph Partitioning. IEEE International Conference on Robotics and Automation, 1.