Planning in a hierarchy of abstraction spaces
 |
 |
abstract = {A problem domain can be represented as a hierarchy of abstraction spaces in which successively finer levels of detail are introduced. The problem solver ABSTRIPS, a modification of STRIPS, can define an abstraction space hierarchy from the STRIPS representation of a problem domain, and it can utilize the hierarchy in solving problems. Examples of the system's performance are presented that demonstrate the significant increases in problem-solving power that this approach provides. Then some further implications of the hierarchical planning approach are explored.},
apice = {AbstripsAi5},
author = {Earl D. Sacerdoti},
doi = {10.1016/0004-3702(74)90026-5},
issn = {0004-3702},
journal = {Artificial Intelligence},
number = 2,
numpages = 21,
openalex = {W1981627423},
pages = {115--135},
publisher = {Elsevier B.V.},
title = {Planning in a hierarchy of abstraction spaces},
url = {https://www.sciencedirect.com/science/article/pii/0004370274900265},
volume = 5,
year = 1974
}