6 citations · 11 across the 9 of their papers we have counts for
Showing 2023 · cs.AIShow all
2 papers · 2 filters
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
Simplified Continuous High Dimensional Belief Space Planning with Adaptive Probabilistic Belief-dependent Constraints
Andrey Zhitnikov, Vadim Indelman
Online decision making under uncertainty in partially observable domains, also known as Belief Space Planning, is a fundamental problem in robotics and Artificial Intelligence. Due…