← Search

Moran Barenboim

8 accepted papers

2026

Action-Gradient Monte Carlo Tree Search for Non-Parametric Continuous (PO)MDPs

IJCAI 2026

Online planning in continuous state, action, and observation spaces remains challenging for autonomous systems. While Monte Carlo Tree Search (MCTS) scales effectively via sampling, most continuous (PO)MDP solvers do not exploit gradient-based action optimization. We propose Action-Gradient MCTS (AG

Cited by 0Scholar
2026

Previous Knowledge Utilization in Online Anytime Belief Space Planning

ICRA 2026poster

Online planning under uncertainty remains a critical challenge in robotics and autonomous systems. While tree search techniques are commonly employed to construct partial future trajectories within computational constraints, most existing methods discard information from previous planning sessions c…

2024

Simplifying Complex Observation Models in Continuous POMDP Planning with Probabilistic Guarantees and Practice

AAAI 2024technical

Solving partially observable Markov decision processes (POMDPs) with high dimensional and continuous observations, such as camera images, is required for many real life robotics and planning problems. Recent researches suggested machine learned probabilistic models as observation models, but their u…

2023

Data Association Aware POMDP Planning With Hypothesis Pruning Performance Guarantees

RA-L 2023

Autonomous agents that operate in the real world must often deal with partial observability, which is commonly modeled as partially observable Markov decision processes (POMDPs). However, traditional POMDP models rely on the assumption of complete knowledge of the observation source, known as fully

Cited by 3SourceScholar