Corpus ID: 234470158

Online POMDP Planning via Simplification

@article{Sztyglic2021OnlinePP,
  title={Online POMDP Planning via Simplification},
  author={Ori Sztyglic and V. Indelman},
  journal={ArXiv},
  year={2021},
  volume={abs/2105.05296}
}
In this paper, we consider online planning in partially observable domains. Solving the corresponding POMDP problem is a very challenging task, particularly in an online setting. Our key contribution is a novel algorithmic approach, Simplified Information Theoretic Belief Space Planning (SITHBSP), which aims to speed-up POMDP planning considering belief-dependent rewards, without compromising on the solution’s accuracy. We do so by mathematically relating the simplified elements of the problem… Expand

Figures and Tables from this paper

Simplified Belief-Dependent Reward MCTS Planning with Guaranteed Tree Consistency

References

SHOWING 1-10 OF 13 REFERENCES
Multilevel Monte-Carlo for Solving POMDPs Online
Monte-Carlo Planning in Large POMDPs
Online Algorithms for POMDPs with Continuous State, Action, and Observation Spaces
The Complexity of Markov Decision Processes
Heuristic Search Value Iteration for POMDPs
Point-Based POMDP Algorithms: Improved Analysis and Implementation
...
1
2
...