Computing Infinite Plans for LTL Goals Using a Classical Planner
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 2003-2007.
Abstract
Classical planning has been notably successful in synthesizing finite plans to achieve states where propositional goals hold. In the last few years, classical planning has also been extended to incorporate temporally extended goals, expressed in temporal logics such as LTL, to impose restrictions on the state sequences generated by finite plans. In this work, we take the next step and consider the computation of infinite plans for achieving arbitrary LTL goals. We show that infinite plans can also be obtained efficiently by calling a classical planner once over a classical planning encoding that represents and extends the composition of the planning domain and the Buchi automaton representing the goal. This compilation scheme has been implemented and a number of experiments are reported.
@inproceedings{ijcai2011p334,
title = {Computing Infinite Plans for LTL Goals Using a Classical Planner},
author = {Patrizi, Fabio and Lipovetzky, Nir and De Giacomo, Giuseppe and Geffner, Hector},
booktitle = {Proceedings of the Twenty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-11}},
publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
editor = {Toby Walsh},
pages = {2003--2007},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-334},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-334},
}
TY - CPAPER TI - Computing Infinite Plans for LTL Goals Using a Classical Planner AU - Patrizi, Fabio AU - Lipovetzky, Nir AU - De Giacomo, Giuseppe AU - Geffner, Hector T2 - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11 PB - AAAI Press/International Joint Conferences on Artificial Intelligence PY - 2011 SP - 2003 EP - 2007 DO - 10.5591/978-1-57735-516-8/IJCAI11-334 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-334 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: