Computing Shortest Safe Path amidst Growing Discs in the Plane

Authors Jur van den Berg, Mark Overmars



PDF
Thumbnail PDF

File

DagSemProc.06421.6.pdf
  • Filesize: 151 kB
  • 4 pages

Document Identifiers

Author Details

Jur van den Berg
Mark Overmars

Cite AsGet BibTex

Jur van den Berg and Mark Overmars. Computing Shortest Safe Path amidst Growing Discs in the Plane. In Robot Navigation. Dagstuhl Seminar Proceedings, Volume 6421, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
https://doi.org/10.4230/DagSemProc.06421.6

Abstract

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 while being executed. We created a fast implementation that is capable of planning paths amidst many growing discs within milliseconds.
Keywords
  • Path planning dynamic environments

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads