Extending Classical Planning to Real-World Execution with Machine Learning
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Learning. Pages 1153-1160.
Abstract
In previous work (Bennett 1993; DeJong and Bennett 1993) we proposed a machine learning approach called permissive planning to extend classical planning into the realm of real-world plan execution. Our prior results have been favorable but empirical (Bennett and DeJong 1991). Here we examine the analytic foundations of our empirical success. We advance a formal account of realworld planning adequacy. We prove that permissive planning does what it claims to do: it probabilistically achieves adequate real-world performance or guarantees that no adequate real-world planning behavior is possible within the flexibility allowed. We prove that the approach scales tractably. We prove that restrictions are necessary; without them permissive planning is impossible. We also show how these restrictions can be quite naturally met through schema-based planning and explanation-based learning.
@inproceedings{ijcai1995p149,
title = {Extending Classical Planning to Real-World Execution with Machine Learning},
author = {DeJong, Gerald and Bennett, Scott},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {1153--1160},
year = {1995},
note = {Learning},
url = {https://ijcai.org/proceedings/1995/149},
}
TY - CPAPER TI - Extending Classical Planning to Real-World Execution with Machine Learning AU - DeJong, Gerald AU - Bennett, Scott T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 1153 EP - 1160 UR - https://ijcai.org/proceedings/1995/149 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: