Computationally Feasible Bounds for Partially Observed Markov Decision Processes
From MaRDI portal
Recommendations
- A survey of solution techniques for the partially observed Markov decision process
- Finite-Memory Suboptimal Design for Partially Observed Markov Decision Processes
- Piecewise Linear Approximations for Partially Observable Markov Decision Processes with Finite Horizons
- Solution Procedures for Partially Observed Markov Decision Processes
- scientific article; zbMATH DE number 1509479
Cited in
(31)- An efficient heuristic for a partially observable Markov decision process of machine replacement
- A nonlinear programming model for partially observable Markov decision processes: Finite horizon case
- Bounded-parameter Markov decision processes
- Verification and control of partially observable probabilistic systems
- A simple suboptimal algorithm for system maintance under partial observability
- Gradient-descent for randomized controllers under partial observability
- Managing mobile production-inventory systems influenced by a modulation process
- Cross-entropic learning of a machine for the decision in a partially observable universe
- A survey of algorithmic methods for partially observed Markov decision processes
- Nonapproximability results for partially observable Markov decision processes
- Partially-observable stochastic hybrid systems (poshss) state estimation and optimal control
- A hybrid genetic/optimization algorithm for finite-horizon, partially observed Markov decision processes
- Verification and control of partially observable probabilistic real-time systems
- Bounded-parameter partially observable Markov decision processes: framework and algorithm
- A Corrected And Improved Computational Scheme For Finite Horizon Partially Observable Markov Decision Processes
- Experimental design for partially observed Markov decision processes
- Myopic bounds for optimal policy of POMDPs: an extension of lovejoy's structural results
- Piecewise Linear Approximations for Partially Observable Markov Decision Processes with Finite Horizons
- Finite-Memory Suboptimal Design for Partially Observed Markov Decision Processes
- An Approximation Approach for Response-Adaptive Clinical Trial Design
- Indexability and optimal index policies for a class of reinitialising restless bandits
- Algebraic optimization of sequential decision problems
- POMDP controllers with optimal budget
- Optimality guarantees for particle belief approximation of POMDPs
- Under-approximating expected total rewards in POMDPs
- Mertens conjectures in absorbing games with incomplete information
- Path integral control of partially observed systems via fully observable control approximations
- Inventory model with incomplete information: sales and zero-balance signals
- A survey of solution techniques for the partially observed Markov decision process
- Probabilistic planning with clear preferences on missing information
- Partially observable Markov decision process approximations for adaptive sensing
This page was built for publication: Computationally Feasible Bounds for Partially Observed Markov Decision Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3981515)
