By Topic

Distance functions and their application to robot path 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)
E. Gilbert ; University of Michigan, Ann Arbor, MI, USA ; D. Johnson

An approach to robotic path planning, which allows optimization of useful performance indices in the presence of obstacles, is given. The main idea is to express obstacle avoidance in terms of the distances between potentially colliding parts. Mathematical properties of the distance functions are studied and it is seen that various types of derivatives of the distance functions are easily characterized. The results lead to the formulation of path planning problems as problems in optimal control and suggest numerical procedures for their solution. A simple numerical example involving a three-degree-of-freedom Cartesian manipulator is described.

Published in:

IEEE Journal on Robotics and Automation  (Volume:1 ,  Issue: 1 )