We study an automata-theoretic approach to planning for temporally extended goals. Specifically, we devise techniques based on nonemptiness of Buchi automata on infinite words, to synthesize sequential and conditional plans in a generalized setting in which we have that: goals are general temporal properties of desired execution; dynamic systems are represented by finite transition systems; incomplete information on the initial situation is allowed; and states are only partially observable....
%0 Conference Paper
%1 Giacomo99
%A Giacomo, Giuseppe De
%A Vardi, Moshe Y.
%B ECP
%D 1999
%K automata-theory, extended-goal, planning, temporally-extended-goal
%P 226--238
%T Automata-Theoretic Approach to Planning for Temporally Extended Goals
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.3063
%X We study an automata-theoretic approach to planning for temporally extended goals. Specifically, we devise techniques based on nonemptiness of Buchi automata on infinite words, to synthesize sequential and conditional plans in a generalized setting in which we have that: goals are general temporal properties of desired execution; dynamic systems are represented by finite transition systems; incomplete information on the initial situation is allowed; and states are only partially observable....
@inproceedings{Giacomo99,
abstract = {{We study an automata-theoretic approach to planning for temporally extended goals. Specifically, we devise techniques based on nonemptiness of Buchi automata on infinite words, to synthesize sequential and conditional plans in a generalized setting in which we have that: goals are general temporal properties of desired execution; dynamic systems are represented by finite transition systems; incomplete information on the initial situation is allowed; and states are only partially observable....}},
added-at = {2011-05-04T16:04:17.000+0200},
author = {Giacomo, Giuseppe De and Vardi, Moshe Y.},
biburl = {https://www.bibsonomy.org/bibtex/2e8f16a6988171e2361e554fd07d7e264/baisemain},
booktitle = {ECP},
citeulike-article-id = {1297537},
citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.3063},
interhash = {fe7cb992bd1d0cfa97f7ef2c1de5a1d3},
intrahash = {e8f16a6988171e2361e554fd07d7e264},
keywords = {automata-theory, extended-goal, planning, temporally-extended-goal},
pages = {226--238},
posted-at = {2007-05-15 18:13:42},
priority = {2},
timestamp = {2011-05-04T16:04:38.000+0200},
title = {{Automata-Theoretic Approach to Planning for Temporally Extended Goals}},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.3063},
year = 1999
}