ML Anthology

Planning in a Hierarchy of Abstraction Spaces

Earl D. Sacerdoti
IJCAI 1973 pp. 412-422
doi:10.1016/0004-3702(74)90026-5 /ijcai/1973/sacerdoti1973ijcai-planning/

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.

PDF Semantic Scholar

Cite

Text

Sacerdoti. "Planning in a Hierarchy of Abstraction Spaces." International Joint Conference on Artificial Intelligence, 1973. doi:10.1016/0004-3702(74)90026-5

Markdown

[Sacerdoti. "Planning in a Hierarchy of Abstraction Spaces." International Joint Conference on Artificial Intelligence, 1973.](https://mlanthology.org/ijcai/1973/sacerdoti1973ijcai-planning/) doi:10.1016/0004-3702(74)90026-5

BibTeX

@inproceedings{sacerdoti1973ijcai-planning,
  title     = {{Planning in a Hierarchy of Abstraction Spaces}},
  author    = {Sacerdoti, Earl D.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1973},
  pages     = {412-422},
  doi       = {10.1016/0004-3702(74)90026-5},
  url       = {https://mlanthology.org/ijcai/1973/sacerdoti1973ijcai-planning/}
}