SHOP: Simple Hierarchical Ordered Planner
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Planning and Scheduling. Pages 968-974.
Abstract
SHOP (Simple Hierarchical Ordered Planner) is a domain-independent HTN planning system with the following characteristics. • SHOP plans for tasks in the same order that they will later be executed. This avoids some goalinteraction issues that arise in other HTN planners, so that the planning algorithm is relatively simple. • Since SHOP knows the complete world-state at each step of the planning process, it can use highly expressive domain representations. For example, it can do planning problems that require complex numeric computations. • In our tests, SHOP was several orders of magnitude faster than Blackbox and several times faster than TLplan, even though SHOP is coded in Lisp and the other planners are coded in C.
@inproceedings{ijcai1999p138,
title = {SHOP: Simple Hierarchical Ordered Planner},
author = {Nau, Dana S. and Cao, Yue and Lotem, Amnon and Muñoz-Avila, Héctor},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {968--974},
year = {1999},
note = {Planning and Scheduling},
url = {https://ijcai.org/proceedings/1999/138},
}
TY - CPAPER TI - SHOP: Simple Hierarchical Ordered Planner AU - Nau, Dana S. AU - Cao, Yue AU - Lotem, Amnon AU - Muñoz-Avila, Héctor T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 968 EP - 974 UR - https://ijcai.org/proceedings/1999/138 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
