6 citations · 11 across the 9 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.AI2021★ 2 cited
Simplified Belief-Dependent Reward MCTS Planning with Guaranteed Tree Consistency
Ori Sztyglic, Andrey Zhitnikov, Vadim Indelman
Partially Observable Markov Decision Processes (POMDPs) are notoriously hard to solve. Most advanced state-of-the-art online solvers leverage ideas of Monte Carlo Tree Search (MCTS…
cs.AI2021★ 1 cited
Probabilistic Loss and its Online Characterization for Simplified Decision Making Under Uncertainty
Andrey Zhitnikov, Vadim Indelman
It is a long-standing objective to ease the computation burden incurred by the decision making process. Identification of this mechanism's sensitivity to simplification has tremend…