| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 712637 | IFAC Proceedings Volumes | 2006 | 6 Pages |
Abstract
In this paper an algorithm of computing a locally optimal nonholonomic path is presented. The algorithm exploits local dynamic programming method applied iteratively. Tests of the algorithm were carried out on the model of the unicycle robot.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Ignacy Duleba, Pawel Ludwików,