作者: Giuseppe De Giacomo , Moshe Y. Vardi
DOI: 10.1007/10720246_18
关键词: Büchi automaton 、 Worst-case complexity 、 Computer science 、 Observable 、 Dynamical system 、 Complete information 、 Transition system 、 Automaton 、 Theoretical computer science 、 Algorithm
摘要: We study an automata-theoretic approach to planning for temporally extended goals. Specifically, we devise techniques based on nonemptiness of Buchi automata infinite words, synthesize sequential and conditional plans in a generalized setting which have that: goals are general temporal properties desired execution; dynamic systems represented by finite transition systems; incomplete information the initial situation is allowed; states only partially observable. prove that proposed optimal wrt worst case complexity problem. Thanks scalability algorithms, presented here promise be applicable fairly large systems, notwithstanding intrinsic