By Topic

On calculation of optimal paths with constrained curvature: the case of long paths

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
$33 $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

2 Author(s)
A. M. Shkel ; Wisconsin Univ., Madison, WI, USA ; V. J. Lumelsky

Given two points in the plane, each with the prescribed direction of motion, the question being asked is to find the shortest smooth path of bounded curvature that joins them. The classical result by Dubins (1957) that is commonly used gives a sufficient set of paths which is guaranteed to contain the shortest path; the latter is then found by explicitly calculating every path in the set. In this paper we show that in the case when the distance between the two points is above some minimum, the solution sought can be found via a simple classification scheme. Besides computational savings (essential, for example, in real-time motion planning), this result sheds light on the nature of factors affecting the length of paths in the Dubins's problem

Published in:

Robotics and Automation, 1996. Proceedings., 1996 IEEE International Conference on  (Volume:4 )

Date of Conference:

22-28 Apr 1996