Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles

@inproceedings{Berg2006PlanningTS,
  title={Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles},
  author={Jur P. van den Berg and Mark H. Overmars},
  booktitle={WAFR},
  year={2006}
}
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximal velocities of the moving obstacles, the regions that are possibly not collision-free are modeled by discs that grow over time. We present an approach to compute the shortest path between two points in the plane that avoids these growing discs. The generated paths are thus guaranteed to be collision-free with respect to the moving obstacles… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 25 extracted citations

References

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

Numerical analysis, 7th edition, chapter 2. Brooks/Cole, Pacific

  • R. L. Burden, J. D. Faires
  • 2001
1 Excerpt

Computational Geometry, Algorithms and Applications, chapters 6 and 8

  • M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf
  • 1997
2 Excerpts

Similar Papers

Loading similar papers…