Cart (Loading....) | Create Account
Close category search window
 

A hybrid optimal-approximate path planning algorithm

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)
Mould, D. ; Dept. of Comput. Sci., Saskatchewan Univ., Saskatoon, Sask. ; Horsch, M.C.

Path planning is the problem of finding the lowest-cost path between two endpoints in a weighted graph. An optimal algorithm, such as A*, is guaranteed to return the lowest-cost path. However, the computational expense of A* is high on a class of graphs called terrains, motivating the development of approximate algorithms such as HTAP (the hierarchical terrain representation for approximate paths). HTAP has computational cost linear in path length, rather than A*'s quadratic complexity, but does not guarantee the lowest cost path. However, HTAP's overhead means that very short paths are disproportionately costly to find. In this paper, we propose a hybrid algorithm which uses HTAP for long paths and A* for short paths. We empirically compare the hybrid algorithm to the HTAP algorithm on the basis of computational cost. The hybrid algorithm has a significant performance advantage over HTAP in the case of very short paths, and is the same as HTAP for long paths. We report results for a number of terrains, giving performance profiles with respect to path length

Published in:

Electrical and Computer Engineering, 2005. Canadian Conference on

Date of Conference:

1-4 May 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.