资源论文Plan Quality Optimisation via Block Decomposition Fazlul Hasan Siddiqui and Patrik Haslum

Plan Quality Optimisation via Block Decomposition Fazlul Hasan Siddiqui and Patrik Haslum

2019-11-11 | |  105 |   40 |   0
Abstract AI planners have to compromise between the speed of the planning process and the quality of the generated plan. Anytime planners try to balance these objectives by finding plans of better quality over time, but current anytime planners often do not make effective use of increasing runtime beyond a certain limit. We present a new method of continuing plan improvement, that works by repeatedly decomposing a given plan into subplans and optimising each subplan locally. The decomposition exploits block-structured plan deordering to identify coherent subplans, which make sense to treat as units. This approach extends the “anytime capability” of current planners – to provide continuing plan quality improvement at any time scale.

上一篇:The GoDeL Planning System: A More Perfect Union of Domain-Independent and Hierarchical Planning

下一篇:Symbolic Merge-and-Shrink for Cost-Optimal Planning

用户评价
全部评价

热门资源

  • 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 ...

  • Learning to learn...

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

  • A Mathematical Mo...

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