By Topic

When is an obstacle a perfect obstacle?

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)
A. Mukerjee ; Dept. of Mech. Eng., Indian Inst. of Technol., Kanpur, India ; S. Sharma ; R. B. Agrawal

Traditional robot motion planning makes the “perfect obstacle assumption” and divides workspace into perfect obstacles and perfect freespace. A region of the workspace is a perfect obstacle if the cost of traversing it is such that there always exists a more efficient path external to the region. Identifying perfect obstacles helps avoid situations where it may be possible to push aside an obstacle, or climb a hillock, for example. We present a linear-time algorithm for determining perfect obstacles in the convex case, and a genetic algorithms approach in the nonconvex case. When the obstacle is not perfect, we identify a measure of the degree to which it approximates a perfect obstacle. This can be a pre-condition to applying standard motion planning techniques

Published in:

Robotics and Automation, 1995. Proceedings., 1995 IEEE International Conference on  (Volume:3 )

Date of Conference:

21-27 May 1995