资源分类
》 资源 》论文》Automata-Theoretic Foundations of FOND Planning for LTLf and LDLf Goals Giuseppe De Giacomo Sasha Rubin

Automata-Theoretic Foundations of FOND Planning for LTLf and LDLf Goals Giuseppe De Giacomo Sasha Rubin

2019-11-05 | |  78 |   42 |   0
Abstract We study planning for LTLf and LDLf temporally extended goals in nondeterministic fully observable domains (FOND). We consider both strong and strong cyclic plans, and develop foundational automata-based techniques to deal with both cases. Using these techniques we provide the computational characterization of both problems, separating the complexity in the size of the domain specification from that in the size of the formula. Specifically we establish them to be EXPTIME-complete and 2EXPTIME-complete, respectively, for both problems. In doing so, we also show 2EXPTIMEhardness for strong cyclic plans, which was open.

上一篇：Emergency Response Optimization using Online Hybrid Planning

下一篇：Complexity of Scheduling Charging in the Smart Grid

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...