A novel approach to path planning for multiple robots in bi-connected graphs

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2009, Pages 3613-3619

  Surynek, Pavel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED GRAPH; EXPERIMENTAL EVALUATION; MULTIPLE ROBOT; PATH-PLANNING; POLYNOMIAL-TIME SOLUTION ALGORITHMS; PRACTICAL PROBLEMS; UNDIRECTED GRAPH;

ABSTRACTING; GRAPH THEORY; INDUSTRIAL ROBOTS; ROBOT PROGRAMMING; ROBOTICS;

PROBLEM SOLVING;

EID: 70350371452     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2009.5152326     Document Type: Conference Paper

References (13)

1. Auletta, V., Monti, A., Parente, M., Persiano, P., "A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees", Algorithmica 23(3): pp. 223-245, Springer Verlag, 1999.
2. Gerevini, A., Bonet, B., Givan, B. (editors), "5th International Planning Competition", event in the context of ICAPS 2006 conference, United Kingdom, University of Brescia, Italy, 2006, Available: http://ipc5.ing.unibs.it (January 2008).
3. Gerevini, A., Serina, I., "Homepage of LPG", research web page, University of Brescia, Italy, 2008, Available: http://zeus.ing.unibs.it/lpg/ (January 2008).
4. Hsu, C. W., Wah, B. W., Huang, R., Chen, Y. X., "SGPlan 5: Subgoal Partitioning and Resolution in Planning", research web page, University of Illinois, USA, 2008, Available: http://manip.crhc.uiuc.edu/programs/SGPlan/ index.html (January 2008).
5. Johnson, D. S., "The NP-Completeness Column: An Ongoing Guide", Journal of Algorithms, Volume 4 (4), pp. 397-411, Elsevier, 1983.
6. Kornhauser, D., Miller, G. L., Spirakis, P. G., "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), pp. 241-250, IEEE Press, 1984.
7. Papadimitriou, C. H., Raghavan, P., Sudan, M., Tamaki, H., "Motion Planning on a Graph", in Proceedings of 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), pp. 511-520, IEEE Press, 1994.
8. Ratner, D., Warmuth, M. K., "Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable", in Proceedings of the 5th National Conference on Artificial Intelligence (AAAI 1986), pp. 168-172, Morgan Kaufmann Publishers, 1986.
9. Ryan, M. R. K., "Multi-robot path planning with sub graphs", in Proceedings of the 19th Australasian Conference on Robotics and Automation, Auckland, New Zeland, Australian Robotics & Automation Association, 2006.
10. Ryan, M. R. K., "Graph Decomposition for Efficient Multi-Robot Path Planning", in Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), Hyderabad, India, pp. 2003-2008, IJCAI Conference, 2007. Available: http://www.ijcai.org (February 2008).
11. Tarjan, R., E., "Depth-First Search and Linear Graph Algorithms", SIAM Journal on Computing, Volume 1 (2), pp. 146-160, Society for Industrial and Applied Mathematics, 1972.
12. West, D. B., "Introduction to Graph Theory, second edition", Prentice- Hall, 2000.
13. Wilson, R. M., "Graph Puzzles, Homotopy, and the Alternating Group", Journal of Combinatorial Theory, Ser. B 16, pp. 86-96, Elsevier, 1974.