Clustering Based Approximation Procedure for Semi-Markov Decision Processes with Incomplete State Information
From MaRDI portal
Publication:3155291
DOI10.1081/STA-120028695zbMath1114.90474OpenAlexW2024871055MaRDI QIDQ3155291
Maria Drăguţ, Andreea B. Dragut
Publication date: 14 January 2005
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/sta-120028695
Cites Work
- Unnamed Item
- Adaptive control of a partially observed discrete time Markov process
- Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
- Approximating general Markovian decision-problems by clustering their state- and action-spaces
- Procedures for the Solution of a Finite-Horizon, Partially Observed, Semi-Markov Optimization Problem
- An approximation procedure for stochastic dynamic programming in countable state space
This page was built for publication: Clustering Based Approximation Procedure for Semi-Markov Decision Processes with Incomplete State Information