Planning in a Hierarchy of Abstraction Spaces
Proceedings of the Third International Joint Conference on Artificial Intelligence. Robot Problem Solving. Pages 412-421.
Abstract
A problem domain can be represented as a hierarchy of abstraction spaces in which s uccessiv e ly finer levels of detail are introduced. The problem solver ABSTRIPS, a modification of STRIPS, can define an ab~traction space hierarchy from the STRIPS representation of a problem dom ain, and it can utili ze the hierarchy in solving problems. Examples of the system's performance are presented that demonstrate the si g nificant increases in problem-solving power that this approach provides. Then some further implications of the hierarchical planning approach are explored. Key Words; Problem solving, heuristic search, representation, abstraction space, rob ot planning, hierarchic al planning.
@inproceedings{ijcai1973p53,
title = {Planning in a Hierarchy of Abstraction Spaces},
author = {Sacerdoti, Earl D.},
booktitle = {Proceedings of the Third International Joint Conference on
Artificial Intelligence, {IJCAI-73}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Nils J. Nilsson},
pages = {412--421},
year = {1973},
month = {8},
note = {Robot Problem Solving},
url = {https://ijcai.org/proceedings/1973/53},
}
TY - CPAPER TI - Planning in a Hierarchy of Abstraction Spaces AU - Sacerdoti, Earl D. T2 - Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73 PB - International Joint Conferences on Artificial Intelligence PY - 1973 SP - 412 EP - 421 UR - https://ijcai.org/proceedings/1973/53 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
