Computationally Feasible Bounds for Partially Observed Markov Decision Processes
From MaRDI portal
Publication:3981515
DOI10.1287/opre.39.1.162zbMath0743.90110DBLPjournals/ior/Lovejoy91OpenAlexW2149476049WikidataQ60164370 ScholiaQ60164370MaRDI QIDQ3981515
Publication date: 26 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.39.1.162
Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (16)
Probabilistic planning with clear preferences on missing information ⋮ A survey of algorithmic methods for partially observed Markov decision processes ⋮ Gradient-descent for randomized controllers under partial observability ⋮ An efficient heuristic for a partially observable Markov decision process of machine replacement ⋮ Verification and Control of Partially Observable Probabilistic Real-Time Systems ⋮ BOUNDED-PARAMETER PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES: FRAMEWORK AND ALGORITHM ⋮ INDEXABILITY AND OPTIMAL INDEX POLICIES FOR A CLASS OF REINITIALISING RESTLESS BANDITS ⋮ POMDP controllers with optimal budget ⋮ Verification and control of partially observable probabilistic systems ⋮ An Approximation Approach for Response-Adaptive Clinical Trial Design ⋮ Managing mobile production-inventory systems influenced by a modulation process ⋮ Partially observable Markov decision process approximations for adaptive sensing ⋮ Partially-observable stochastic hybrid systems (poshss) state estimation and optimal control ⋮ A simple suboptimal algorithm for system maintance under partial observability ⋮ Bounded-parameter Markov decision processes ⋮ A survey of solution techniques for the partially observed Markov decision process
This page was built for publication: Computationally Feasible Bounds for Partially Observed Markov Decision Processes
