Commitment Strategies in Planning: A Comparative Analysis
Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 259-266.
Abstract
In this paper we compare the utility of different commitment strategies in planning. Under a "least commitment strategy", plans are represented as partial orders and operators are ordered only when interactions are detected. We investigate claims of the inherent advantages of planning with partial orders, as compared to planning with total orders. By focusing our analysis on the issue of operator ordering commitment, we are able to carry out a rigorous comparative analysis of two planners. We show that partial-order planning can be more efficient than total-order planning, but we also show that this is not necessarily so.
@inproceedings{ijcai1991p39,
title = {Commitment Strategies in Planning: A Comparative Analysis},
author = {Minton, Steven and Bresina, John L. and Drummond, Mark},
booktitle = {Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, {IJCAI-91}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John Mylopoulos and Ray Reiter},
pages = {259--266},
year = {1991},
month = {8},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1991/39},
}
TY - CPAPER TI - Commitment Strategies in Planning: A Comparative Analysis AU - Minton, Steven AU - Bresina, John L. AU - Drummond, Mark T2 - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91 PB - International Joint Conferences on Artificial Intelligence PY - 1991 SP - 259 EP - 266 UR - https://ijcai.org/proceedings/1991/39 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
