An efficient heuristic for a partially observable Markov decision process of machine replacement
From MaRDI portal
(Redirected from Publication:1373890)
Recommendations
Cites work
- A survey of algorithmic methods for partially observed Markov decision processes
- A survey of solution techniques for the partially observed Markov decision process
- Computation and Structure of Optimal Reset Policies
- Computationally Feasible Bounds for Partially Observed Markov Decision Processes
- Dynamic programming and stochastic control
- Finite state Markovian decision processes
- Optimal control-limit strategies for a partially observed replacement problem†
- State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms
- The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
- The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
Cited in
(4)- A simple suboptimal algorithm for system maintance under partial observability
- A multi-stage two-machines replacement strategy using mixture models, Bayesian inference, and stochastic dynamic programming
- Selecting a quality control attribute sample: An information-economics method
- A heuristically accelerated reinforcement learning method for maintenance policy of an assembly line
This page was built for publication: An efficient heuristic for a partially observable Markov decision process of machine replacement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373890)