An application of pebble motion on graphs to abstract multi-robot path planning

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2009, Pages 151-158

  Surynek, Pavel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH MODELING; MULTI-ROBOT PATH PLANNING; NP-HARD; OPTIMAL PLAN; ORIGINAL ALGORITHMS; QUALITY OF SOLUTION; SOLVING ALGORITHM; SOLVING PROCEDURE; SUB-PROBLEMS; SUBOPTIMAL SOLUTION; THEORETICAL RESULT; UNDIRECTED GRAPH;

ABSTRACTING; ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; INDUSTRIAL ROBOTS; MULTIPURPOSE ROBOTS; OPTIMIZATION;

ROBOT PROGRAMMING;

EID: 77949528505     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2009.62     Document Type: Conference Paper

References (11)

1. Felner, R. E. Korf, R. Meshulam, and R.C. Holte, "Compressed Pattern Databases", Journal of Artificial Intelligence Research (JAIR), Volume 30, AAAI Press, 2007, pp. 213-247.
2. D. Kornhauser, G. L. Miller, and P. G. Spirakis, "Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications", Proceedings of the 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), IEEE Press, 1984, pp. 241-250.
3. D. Ratner and M. K. Warmuth, "Finding a Shortest Solution for the NxN Extension of the 15-PUZZLE Is Intractable", Proceedings of the 5th National Conference on Artificial Intelligence (AAAI 1986), Morgan Kaufmann Publishers, 1986, pp. 168-172.
4. S. Russell and P. Norvig, "Artificial Intelligence: A Modern Approach (second edition)", Prentice Hall, 2003.
5. M. R. K. Ryan, "Graph Decomposition for Efficient Multi-Robot Path Planning", Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), IJCAI Conference, 2007, pp. 2003-2008.
6. P. Surynek, "A Novel Approach to Path Planning for Multiple Robots in Bi-connected Graphs", Proceedings of the 2009 IEEE International Conference on Robotics and Automation (ICRA 2009), IEEE Press, 2009, pp. 3613-3619.
7. P. Surynek, "Towards Shorter Solutions for Problems of Path Planning for Multiple Robots in θ-like Environments", Proceedings of the 22nd International FLAIRS Conference (FLAIRS 2009), AAAI Press, 2009.
8. P. Surynek, "Making Solutions of Multi-robot Path Planning Problems Shorter Using Weak Transpositions and Critical Path Parallelism", Proceedings of the 2009 International Symposium on Combinatorial Search (SoCS 2009), CA, USA, USC, http://www.searchconference.org/index.php/Main/ SOCS09, July 2009.
9. R. E. Tarjan, "Depth-First Search and Linear Graph Algorithms", SIAM Journal on Computing, Volume 1 (2), Society for Industrial and Applied Mathematics, 1972, pp. 146-160.
10. D. B. West, "Introduction to Graph Theory, second edition", Prentice-Hall, 2000.
11. R. M. Wilson, "Graph Puzzles, Homotopy, and the Alternating Group", Journal of Combinatorial Theory, Ser. B 16, Elsevier, 1974, pp. 86-96.