1 citations · 1 across the 17 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.AI2023★ 1 cited
No Compromise in Solution Quality: Speeding Up Belief-dependent Continuous POMDPs via Adaptive Multilevel Simplification
Andrey Zhitnikov, Ori Sztyglic, Vadim Indelman
Continuous POMDPs with general belief-dependent rewards are notoriously difficult to solve online. In this paper, we present a complete provable theory of adaptive multilevel simpl…
cs.AI2023
Online POMDP Planning with Anytime Deterministic Optimality Guarantees
Moran Barenboim, Vadim Indelman
Decision-making under uncertainty is a critical aspect of many practical autonomous systems due to incomplete information. Partially Observable Markov Decision Processes (POMDPs) o…