ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Knowledge-Based Systems
Volume 15, Issues 1-2, January 2002, Pages 53-66
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (811 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0950-7051(01)00121-6    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2002 Elsevier Science B.V. All rights reserved.

Hierarchical A* based path planning — a case study

Antti AutereE-mail The Corresponding Author

Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 9700, FIN-02015 HUT, Espoo, Finland

Available online 5 January 2002.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Usually it is impossible to know in advance how coarsely robot movements can be discretized in order to find a collision-free path from an initial robot position to a desired goal position in a presence of obstacles. Our solution to the problem is to introduce a new method of constructing hierarchical path planning algorithms. It is based on a novel application of the A* control strategy, called here Meta A*.

We test four hierarchical path planning algorithms, two of which are based on Meta A*, using five simulated robot workcells. The simulations suggest that the Meta A* based planners, on average, find paths faster and consume less memory than the other two algorithms.

Author Keywords: Heuristic search; Robot point-to-point path planning; A*; Resource allocation

Article Outline

1. Introduction
1.1. The path planning problem and solution approaches
1.2. Related work
2. Subdividing a path planning problem
2.1. A hierarchy of search graphs
2.2. Subdividing a path planning problem
3. A novel application of A*
3.1. A* algorithm
3.2. Meta A*
4. Tested algorithms
4.1. Hierarchical A* (HA)
4.2. Hierarchical path planner (HAPP)
4.3. Planners based on Meta A*
5. Experimental results
5.1. Test cases
5.2. Simulations
6. Discussion
7. Conclusions
Acknowledgements
Appendix
References










 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.