Computing infinite plans for LTL goals using a classical planner

Authors:
Fabio Patrizi;Nir Lipoveztky;Giuseppe De Giacomo;Hector Geffner
Affiliations:
Imperial College London, London, UK;Univ. Pompeu Fabra, Barcelona, Spain;Sapienza Univ. di Roma, Rome, Italy;ICREA & UPF, Barcelona, Spain
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Year:
2011

Citing 15
Cited 2

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Reasoning about infinite computations

Information and Computation
An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Planning for temporally extended goals

Annals of Mathematics and Artificial Intelligence
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Combining the Expressivity of UCPOP with the Efficiency of Graphplan

ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Automata-Theoretic Approach to Planning for Temporally Extended Goals

ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Efficient reduction of finite state model checking to reachability analysis

International Journal on Software Tools for Technology Transfer (STTT)
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A heuristic search approach to planning with temporally extended preferences

Artificial Intelligence
Planning with first-order temporally extended goals using heuristic search

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
The FF planning system: fast plan generation through heuristic search

Journal of Artificial Intelligence Research
Promela planning

SPIN'03 Proceedings of the 10th international conference on Model checking software
LTL satisfiability checking

International Journal on Software Tools for Technology Transfer (STTT) - Special Section on SPIN 07
LTL Goal Specifications Revisited

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence

Linear temporal logic and linear dynamic logic on finite traces

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Fair LTL synthesis for non-deterministic systems using strong cyclic planners

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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 Büchi automaton representing the goal. This compilation scheme has been implemented and a number of experiments are reported.