Complexity bounds for deterministic partially observed Markov decision processes

DOI10.1007/S10479-024-06282-0MaRDI QIDQ7028085zbMATH OpenFDO

Authors Cyrille Vessaire, Pierre Carpentier, Jean-Philippe Chancelier, Michel De Lara, Alejandro Rodríguez-Martínez

Publication date 12 February 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-024-06282-0

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Cites work

• A Survey of Applications of Markov Decision Processes
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• Optimal Adaptive Policies for Markov Decision Processes
• Optimal control of Markov processes with incomplete state information
• Reinforcement learning. An introduction
• Reinforcement learning: a comparison of UCB versus alternative adaptive policies
• Robotic manipulation of multiple objects as a POMDP
• Stochastic optimal control. The discrete time case
• The Optimal Control of Partially Observable Markov Processes over a Finite Horizon

This page was built for publication: Complexity bounds for deterministic partially observed Markov decision processes

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