资源论文Structural Symmetries for Fully Observable Nondeterministic Planning

Structural Symmetries for Fully Observable Nondeterministic Planning

2019-11-25 | |  63 |   44 |   0
Abstract Symmetry reduction has significantly contributed to the success of classical planning as heuristic search. However, it is an open question if symmetry reduction techniques can be lifted to fully observable nondeterministic (FOND) planning. We generalize the concepts of structural symmetries and symmetry reduction to FOND planning and specifically to the LAO? algorithm. Our base implementation of LAO? in the Fast Downward planner is competitive with the LAO? -based FOND planner myND. Our experiments further show that symmetry reduction can yield strong performance gains compared to our base implementation of LAO? .

上一篇:Graph-Based Factorization of Classical Planning Problems

下一篇:Co-Optimizating Multi-Agent Placement with Task Assignment and Scheduling

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...