By Topic

A path space approach to nonholonomic motion planning in the presence of obstacles

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. W. Divelbiss ; Reveo Corp., Hawthorne, NY, USA ; J. T. Wen

This paper presents an algorithm for finding a kinematically feasible path for a nonholonomic system in the presence of obstacles. We first consider the path planning problem without obstacles by transforming it into a nonlinear least squares problem in an augmented space which is then iteratively solved. Obstacle avoidance is included as inequality constraints. Exterior penalty functions are used to convert the inequality constraints Into equality constraints. Then the same nonlinear least squares approach is applied. We demonstrate the efficacy of the approach by solving some challenging problems, including a tractor-trailer and a tractor with a steerable trailer backing in a loading dock. These examples demonstrate the performance of the algorithm in the presence of obstacles and steering and jackknife angle constraints

Published in:

IEEE Transactions on Robotics and Automation  (Volume:13 ,  Issue: 3 )