资源论文Solving Continuous POMDPs: Value Iteration with Incremental Learning of an Efficient Space Representation

Solving Continuous POMDPs: Value Iteration with Incremental Learning of an Efficient Space Representation

2020-03-02 | |  58 |   38 |   0

Abstract

Discrete POMDPs of medium complexity can be approximately solved in reasonable time. However, most applications have a continuous and thus uncountably infinite state space. We propose the novel concept of learning a discrete representation of the continuous state space to solve the integrals in continuous POMDPs efficiently and generalize sparse calculations over the continuous space. The representation is iteratively refined as part of a novel Value Iteration step and does not depend on prior knowledge. Consistency for the learned generalization is asserted by a self-correction algorithm. The presented concept is implemented for continuous state and observation spaces based on Monte Carlo approximation to allow for arbitrary POMDP models. In an experimental comparison it yields higher values in significantly shorter time than state of the art algorithms and solves higher-dimensional problems.

上一篇:Nested Chinese Restaurant Franchise Processes: Applications to User Tracking and Document Modeling

下一篇:A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems

用户评价
全部评价

热门资源

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