Path Relaxation: Path Planning for a Mobile Robot
Abstract
Path Relaxation is a method of planning safe paths around obstacles for mobile robots. It works in two steps: a global grid search that finds a rough path, followed by a local relaxation step that adjusts each node on the path to lower the overall path cost. The representation used by Path Relaxation allows an explicit tradeoff among length of path, clearance away from obstacles, and distance traveled through unmapped areas.
Cite
Text
Thorpe. "Path Relaxation: Path Planning for a Mobile Robot." AAAI Conference on Artificial Intelligence, 1984. doi:10.1109/oceans.1984.1152243Markdown
[Thorpe. "Path Relaxation: Path Planning for a Mobile Robot." AAAI Conference on Artificial Intelligence, 1984.](https://mlanthology.org/aaai/1984/thorpe1984aaai-path/) doi:10.1109/oceans.1984.1152243BibTeX
@inproceedings{thorpe1984aaai-path,
title = {{Path Relaxation: Path Planning for a Mobile Robot}},
author = {Thorpe, Charles E.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1984},
pages = {318-321},
doi = {10.1109/oceans.1984.1152243},
url = {https://mlanthology.org/aaai/1984/thorpe1984aaai-path/}
}