Sign inGet started
Paper · arXiv

Scalable Rao-Blackwellized Online Planning for High-Dimensional POMDPs

Online planning under uncertainty remains a fundamental challenge for robotic systems operating in partially observable environments with high-dimensional state spaces. While sampling-based POMDP solvers enable approximate decision-making in large or continuous domains, their performance degrades as belief dimensionality increases due to the high variance inherent in Monte Carlo-based estimation. In this work, we extend the Rao-Blackwellized online POMDP (RB-POMDP) framework to improve its generalizability in high-dimensional settings through hybrid continuous-discrete belief representations. By analytically propagating uncertainty associated with marginalized state components during tree...

AuthorsJiho Lee, Nisar Ahmed, Kyle Hollins Wray et al.
Primary categorycs.RO
Published1 September 2026
Last updated at source1 September 2026
cs.ROcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/943c11f2-ac6e-4981-b497-768527c75497" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.