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.
BibTeX - Entry
@InProceedings{vandenberg_et_al:DagSemProc.06421.6,
author = {van den Berg, Jur and Overmars, Mark},
title = {{Computing Shortest Safe Path amidst Growing Discs in the Plane}},
booktitle = {Robot Navigation},
pages = {1--4},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2007},
volume = {6421},
editor = {S\'{a}ndor Fekete and Rudolf Fleischer and Rolf Klein and Alejandro Lopez-Ortiz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2007/873},
URN = {urn:nbn:de:0030-drops-8733},
doi = {10.4230/DagSemProc.06421.6},
annote = {Keywords: Path planning dynamic environments}
}
|
Keywords: |
|
Path planning dynamic environments |
|
Collection: |
|
06421 - Robot Navigation |
|
Issue Date: |
|
2007 |
|
Date of publication: |
|
07.02.2007 |
Creative Commons Attribution 4.0 International license (CC BY 4.0)