Abstract
Ever since the conception of Artificial Intelligence, hierarchical problem solving has been used as a method to reduce the computational cost of planning. The idea of hierarchical problem-solving, a well-accepted one, is to distinguish between goals and actions of different degrees of importance, and solve the most important problems first. Its main advantage derives from the fact that by emphasizing certain activities while temporarily ignoring others, it is possible to obtain a much smaller search space in which to find a plan.
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
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Yang, Q. (1997). Hierarchical Planning. In: Intelligent Planning. Artificial Intelligence. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60618-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-60618-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64477-1
Online ISBN: 978-3-642-60618-2
eBook Packages: Springer Book Archive