Finding Collision-Free Smooth Trajectories for a Non-Holonomic Mobile Robot
Abstract
Most mobile robots are subject to kinematic constraints (non-holonomic Joints), i.e., the number of degrees of freedom is less than the number of configuration parameters. Such navigate in very constrained space, but at the expense of backing up maneuvers [Laumond 86]. In this paper we study the original problem of finding collision-free smooth trajectories, i.e. with never backing up, for a circular mobile robot whose the turning radius is lower bounded.
Cite
Text
Laumond. "Finding Collision-Free Smooth Trajectories for a Non-Holonomic Mobile Robot." International Joint Conference on Artificial Intelligence, 1987.Markdown
[Laumond. "Finding Collision-Free Smooth Trajectories for a Non-Holonomic Mobile Robot." International Joint Conference on Artificial Intelligence, 1987.](https://mlanthology.org/ijcai/1987/laumond1987ijcai-finding/)BibTeX
@inproceedings{laumond1987ijcai-finding,
title = {{Finding Collision-Free Smooth Trajectories for a Non-Holonomic Mobile Robot}},
author = {Laumond, Jean-Paul},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1987},
pages = {1120-1123},
url = {https://mlanthology.org/ijcai/1987/laumond1987ijcai-finding/}
}