An optimization variant of multi-robot path planning is intractable

  title={An optimization variant of multi-robot path planning is intractable},
  author={Pavel Surynek},
  booktitle={AAAI 2010},
An optimization variant of a problem of path planning for multiple robots is addressed in this work. The task is to find spatial-temporal path for each robot of a group of robots such that each robot can reach its destination by navigating through these paths. In the optimization variant of the problem, there is an additional requirement that the makespan of the solution must be as small as possible. A proof of the claim that optimal path planning for multiple robots is NP-complete is sketched… CONTINUE READING
Highly Cited
This paper has 98 citations. REVIEW CITATIONS


Publications citing this paper.

98 Citations

Citations per Year
Semantic Scholar estimates that this publication has 98 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-5 of 5 references

An Application of Pebble Motion on Graphs to Abstract Multi-robot Path Planning

2009 21st IEEE International Conference on Tools with Artificial Intelligence • 2009
View 1 Excerpt

The Complexity of Theorem Proving Procedures

S. A. Cook
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, • 1971
View 2 Excerpts