An Optimization Variant of Multi-Robot Path Planning Is Intractable

@inproceedings{Surynek2010AnOV,
  title={An Optimization Variant of Multi-Robot Path Planning Is Intractable},
  author={Pavel Surynek},
  booktitle={AAAI},
  year={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 87 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

87 Citations

01020'11'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 87 citations based on the available data.

See our FAQ for additional information.

References

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

The Complexity of Theorem Proving Procedures

  • S. A. Cook
  • Proceedings of the 3rd Annual ACM Symposium on…
  • 1971
2 Excerpts