An algorithm for computing a collision-free motion for a vehicle with limited steering range is presented and its running time is analyzed. When given m `lanes' on which the vehicle is allowed to move in a polygonal environment of complexity n, the algorithm produces a motion with the minimum number of turns between two query placements of the vehicle in time O(m2)after O(m2(n2+log m)) preprocessing. A restricted version of the algorithm has been implemented
Published in:
Robotics and Automation, 1988. Proceedings., 1988 IEEE International Conference on
Date of Conference:
24-29 Apr 1988
- Page(s):
-
529
-
533 vol.1
- Meeting Date :
-
24 Apr 1988-29 Apr 1988
- Print ISBN:
-
0-8186-0852-8
- INSPEC Accession Number:
-
3228011
- Conference Location :
-
Philadelphia, PA
- Digital Object Identifier :
-
10.1109/ROBOT.1988.12106
- Product Type:
-
Conference Publications