Planning as Model Checking for Extended Goals in Non-deterministic Domains
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 479-485.
Abstract
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal properties. However, the combination of these two aspects is not trivial. In non-deterministic domains, goals should take into account the fact that a plan may result in many possible different executions and that some requirements can be enforced on all the possible executions, while others may be enforced only on some executions. In this paper we address this problem. We define a planning algorithm that generates automatically plans for extended goals in nondeterministic domains. We also provide preliminary experimental results based on an implementation of the planning algorithm that uses symbolic model checking techniques.
@inproceedings{ijcai2001p67,
title = {Planning as Model Checking for Extended Goals in Non-deterministic Domains},
author = {Pistore, Marco and Traverso, Paolo},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {479--485},
year = {2001},
url = {https://ijcai.org/proceedings/2001/67},
}
TY - CPAPER TI - Planning as Model Checking for Extended Goals in Non-deterministic Domains AU - Pistore, Marco AU - Traverso, Paolo T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 479 EP - 485 UR - https://ijcai.org/proceedings/2001/67 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
