By Topic

Path planning: an approach based on connecting all the minimizers and maximizers of a potential function

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)
Shashikala, H. ; Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India ; Sancheti, N.K. ; Keerthi, S.S.

An improved potential-based method for robot path planning is developed by connecting all the local minima and local maxima of the potential function defined in the configuration space of the robot. The authors construct an adjacency graph of the local minima and maxima of the potential function. An edge connecting a local minimum and a local maximum has an associated pair of perturbations which gives a way of moving between them. The method is based on the stability theory of dynamical systems. The usefulness of the method was demonstrated on a two-dimensional piano mover's problem with three degrees of freedom

Published in:

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

Date of Conference:

12-14 May 1992