By Topic

Navigation algorithm for a nested hierarchical system of robot path planning among polyhedral obstacles

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)
M. Montgomery ; Drexel University, Philadelphia, PA ; D. Gaw ; A. Meystel

An algorithm NAVIGATOR for robot path planning in a 2D world with polygonal obstacles is presented. The method employs A* search in a subset of the visibility graph of obstacle vertices. A procedure is given for finding this subset of the visibility graph without computing line intersections. The NAVIGATOR module is part of a complete hierarchical system for control and world representation for a robot which operates in an unkown and unstructured environment.

Published in:

Robotics and Automation. Proceedings. 1987 IEEE International Conference on  (Volume:4 )

Date of Conference:

Mar 1987