By Topic

A new algorithm for robot curve-following amidst unknown obstacles, and a generalization of maze-searching

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)
Sankaranarayanan, A. ; Secom Intelligent Syst. Lab., Tokyo, Japan ; Masuda, I.

A non-metric path planning algorithm, Curv1, is developed for moving a point automaton between two given points along a guide-track, amidst unknown obstacles. No physical mark is made on the guide-track and no position on distance information is used. The nonheuristic algorithm is shown to converge and an upper bound on the path length is derived. This nonmetric formulation is shown to be related to, and in some sense, a generalization of the maze-searching problem. For the curve-following task, the Curv1 algorithm is shown to be a generalization of the maze-searching Pledge algorithm (H. Abelson and E. DiSessa, 1980). The robustness of the algorithm makes it suitable for an industrial application of autonomous robot guide-track following

Published in:

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

Date of Conference:

12-14 May 1992