By Topic

Path planning for moving a point object amidst unknown obstacles in a plane: the universal lower bound on the worst path lengths and a classification of algorithms

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

2 Author(s)
Sankaranarayanan, A. ; Secom IS Lab., Tokyo, Japan ; Vidyasagar, M.

The problem of generating a path between any two points for a point object in a 2D plane filled with unknown obstacles of arbitrary shapes is discussed. This problem is termed P1. The issue of worst-case path lengths is analysed in a general setting, independent of any particular algorithm. It is shown that there are two distinct approaches available to solve P1, dividing the set of all possible algorithms that solve P1 into two disjoint classes. The minimum worst-case path length possible in each class is determined and the universal lower bound on the worst case path length of any algorithm is found. The results are shown to be useful in developing algorithms and more general problem models

Published in:

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

Date of Conference:

9-11 Apr 1991