scientific article

zbMath0633.90091MaRDI QIDQ3772003

Onésimo Hernández-Lerma

Publication date: 1987

Full work available at URL: https://eudml.org/doc/28802

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

unknown parametersapproximation proceduresvalue-iterationaverage-reward controlled Markov processesBorel state and control spacesoptimal adaptive policies

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Related Items

Density estimation and adaptive control of Markov processes: Average and discounted criteria ⋮ A forecast horizon and a stopping rule for general Markov decision processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal adaptive control of priority assignment in queueing systems
• Adaptive control of service in queueing systems
• Nonstationary value-iteration and adaptive control of discounted semi- Markov processes
• Adaptive policies for discrete-time stochastic control systems with unknown disturbance distribution
• Nonparametric adaptive control of discrete-time partially observable stochastic systems
• Nonstationary Markov decision problems with converging parameters
• Stochastic optimal control. The discrete time case
• A modified form of the iterative method of dynamic programming
• Dynamic programming, Markov chains, and the method of successive approximations
• A recursive algorithm in Markovian decision processes
• A Survey of Some Results in Stochastic Adaptive Control
• Adaptive Strategies for Certain Classes of Controlled Markov Processes
• AVERAGE-OPTIMAL ADAPTIVE POLICIES IN SEMI-MARKOV DECISION PROCESSES INCLUDING AN UNKNOWN PARAMETER
• The asymptotic behaviour of the minimal total expected cost for the denumerable state Markov decision model
• Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
• Optimal Plans for Dynamic Programming Problems
• The optimality equation in average cost denumerable state semi-Markov decision problems, recurrency conditions and algorithms
• Estimation and control in Markov chains