By Topic

Solving global two-dimensional routing problems using snell's law and a search

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

4 Author(s)
Richbourg, R. ; Naval Postgraduate School, Monterey, California ; Rowe, N.C. ; Zyda, M.J. ; McGhee, R.B.

Long-range route planning is an important component in the intelligent control system of an autonomous agent. Most attempts to solve it with map data rely on applying simple search strategies to high-resolution, node-and-link representations of the map. These techniques have several disadvantages including large time and space requirements. We present an alternative which utilizes a more intelligent representation of the problem environment. Topographical features are represented as homogeneous-cost regions, greatly reducing storage requirements. Then, the A* search strategy is applied to a dynamically created graph, constructed according to Snell's law. Testing has shown significant speed improvements over competing techniques.

Published in:

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

Date of Conference:

Mar 1987