Ergodic and adaptive control of nearest-neighbor motions
From MaRDI portal
Publication:1176541
DOI10.1007/BF02551382zbMath0736.93078OpenAlexW4234502221MaRDI QIDQ1176541
Vivek S. Borkar, Mrinal K. Ghosh
Publication date: 25 June 1992
Published in: MCSS. Mathematics of Control, Signals, and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02551382
Markov chaincontrol strategyalmost- sure optimalityergodic cost criterionstationary randomized strategy
Related Items (6)
Controlled Markov processes on the infinite planning horizon: Weighted and overtaking cost criteria ⋮ On strong average optimality of Markov decision processes with unbounded costs ⋮ Correction to: Ergodic and adaptive control of nearest-neighbor motions ⋮ The Kumar-Becker-Lin scheme revisited ⋮ Denumerable state stochastic games with limiting average payoff ⋮ On the Milito-Cruz adaptive control scheme for Markov chains
Cites Work
- Optimal adaptive control of priority assignment in queueing systems
- Adaptive control of service in queueing systems
- A convex analytic approach to Markov decision processes
- The Kumar-Becker-Lin scheme revisited
- Adaptive control of Markov chains, I: Finite parameter set
- On Minimum Cost Per Unit Time Control of Markov Chains
- A Survey of Some Results in Stochastic Adaptive Control
- Control of Markov Chains with Long-Run Average Cost Criterion: The Dynamic Programming Equations
- Adaptive control and parameter estimation in Markov chains: A linear case
- Optimal adaptive controllers for unknown Markov chains
- Identification and Adaptive Control of Markov Chains
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- Estimation and control in Markov chains
- Existence of Optimal Strategies Based on Specified Information, for a Class of Stochastic Decision Problems
This page was built for publication: Ergodic and adaptive control of nearest-neighbor motions
