By Topic

Online motion planning using critical point graphs in two-dimensional configuration space

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)
V. Krishnaswamy ; Case Western Reserve Univ., Cleveland, OH, USA ; W. S. Newman

An online motion planning algorithm in 2D configuration space is presented for right-handed manipulators. Critical points on the boundaries of obstacles in configuration space are identified. A graph is constructed using simple wall-following to determine connections between the critical points. Motion between connected critical points may be executed through the definition of potential functions and critical point subgoals without encountering local minima. The planning problem was solved by modifying line-of-sight and wall-following algorithms to resort to the critical point graph in finding exit points to goal locations. The results was extremely fast plan generation, which has been crucial in achieving online 3D planning

Published in:

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

Date of Conference:

12-14 May 1992