By Topic

Path planning using a Jacobian-based freespace generation algorithm

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

3 Author(s)
B. Paden ; Dept. of Mech. Eng., California Univ., Santa Barbara, CA, USA ; A. Mees ; M. Fisher

A simple and efficient algorithm is developed to generate a 2"-tree (generalized quad-tree) representation of the free configuration space for a manipulator moving in a workspace with obstacles. The algorithm is based on the existence of uniform bounds on the Jacobians relating the differential motions of points on the manipulator to differential joint motions. This representation can be searched to generate a collision-free path and optimized with dynamic constraints to produce an executable trajectory.

Published in:

Robotics and Automation, 1989. Proceedings., 1989 IEEE International Conference on

Date of Conference:

14-19 May 1989