Hierarchical Planning
 |
 |
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.},
address = {Berlin, Heidelberg},
apice = {HierarchicalplanningPlanningbook1997},
author = {Qiang Yang},
booktitle = {Intelligent Planning: A Decomposition and Abstraction Based Approach},
doi = {10.1007/978-3-642-60618-2_10},
isbn = {978-3-642-60618-2},
issn = {1431-0066},
numpages = 26,
openalex = {W4240562275},
pages = {163--188},
publisher = {Springer},
title = {Hierarchical Planning},
url = {https://link.springer.com/10.1007/978-3-642-60618-2_10},
urlpdf = {https://link.springer.com/content/pdf/10.1007/978-3-642-60618-2_10.pdf},
year = 1997
}