Online POMDP planning with anytime deterministic optimality guarantees

DOI10.1016/J.ARTINT.2025.104442MaRDI QIDQ6869567zbMATH OpenFDO

Authors Moran Barenboim, Vadim Indelman

Publication date 22 January 2026

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2025.104442

zbMATH Keywords

decision-making under uncertaintyplanning under uncertaintyPOMDP

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• DESPOT: online POMDP planning with regularization
• Finite-time analysis of the multiarmed bandit problem
• Optimality guarantees for particle belief approximation of POMDPs
• Planning and acting in partially observable stochastic domains

This page was built for publication: Online POMDP planning with anytime deterministic optimality guarantees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869567)