Abstract
Search is an important problem-solving paradigm. Many real world problems can be modeled and transformed to searching problems. Searching for chains of elements that connect places, concepts, reasonings, etc., appears in different areas of research: in AI, finding sequences of simple actions enable to solve complex tasks; in robotics, geometric paths are calculated to move mechanical elements in space under kinematic and dynamic constraints (manipulators, mobile platforms, cooperating robots,...); one of the main issues in networks is to find optimal routes to guide information packages efficiently; etc. These and many other examples highlight the importance of path search in any computational representation of knowledge.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Fernández, J.A., González, J. (2001). Hierarchical Path Search. In: Multi-Hierarchical Representation of Large-Scale Space. International Series on Microprocessor-Based and Intelligent Systems Engineering, vol 24. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9666-4_4
Download citation
DOI: https://doi.org/10.1007/978-94-015-9666-4_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5861-4
Online ISBN: 978-94-015-9666-4
eBook Packages: Springer Book Archive