资源分类
》 资源 》论文》Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects

Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects

2019-11-11 | |  46 |   44 |   0
Abstract Recently, several methods have been proposed for optimal delete-free planning. We present an incremental compilation approach that enables these methods to be applied to problems with conditional effects, which none of them support natively. With an h+ solver for problems with conditional effects in hand, we also consider adapting the h++ anytime lower bound function to use the more spaceC efficient Pce compilation. This avoids the memory limitation of the original h++ caused by its reliance on an exponential-space compilation. It also leads to improvements on some problems where memory is not an issue.

上一篇：Isomorph-Free Branch and Bound Search for Finite State Controllers

下一篇：Interactive POMDP Lite: Towards Practical Planning to Predict and Exploit Intentions for Interacting with Self-Interested Agents

用户评价
全部评价

热门资源

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