By Topic

Set of reachable positions for a car

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Soueres, P. ; Lab. d''Autom. et d''Anal. des Syst., CNRS, Toulouse, France ; Fourquet, J. ; Laumond, J.-P.

This paper shows how to compute the reachable positions for a model of a car with a lower bounded turning radius that moves forward and backward with a constant velocity. First, the authors compute the shortest paths when the starting configuration (i.e., position and direction) is completely specified and the goal is only defined by the position with the direction being arbitrary. Then the authors compute the boundary of the region reachable by such paths. Such results are useful in motion planning for nonholonomic mobile robots

Published in:

Automatic Control, IEEE Transactions on  (Volume:39 ,  Issue: 8 )