Abstract

We present an adaptive control scheme for the control of Markov chains to minimize long-run average cost when the system transition and reward structures are unknown. Q-factors are estimated along a single sample path of the system and control actions are applied based on the latest estimates. We prove that an optimal policy is obtained asymptotically with probability one. More importantly, we prove that optimal system performance is achieved as well, which means that the performance of the system can not be bettered even if the system transition and reward structures are known. An example is given to illustrate our adaptive control scheme.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.