资源分类
》 资源 》论文》Handling Non-local Dead-ends in Agent Planning Programs

Handling Non-local Dead-ends in Agent Planning Programs

2019-10-29 | |  45 |   36 |   0
Abstract We propose an approach to reason about agent planning programs with global information. Agent planning programs can be understood as a network of planning problems, accommodating long-term goals, non-terminating behaviors, and interactive execution. We provide a technique that relies on reasoning about “global” dead-ends and that can be incorporated to any planning-based approach to agent planning programs. In doing so, we also introduce the notion of online execution of such planning structures. We provide experimental evidence suggesting the technique yields significant benefits

上一篇：Generating Context-Free Grammars using Classical Planning

下一篇：Hierarchical Task Network Planning with Task Insertion and State Constraints

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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

  • Learning to Predi...

    Much of model-based reinforcement learning invo...