Abstract
The optimal control of a system whose transitions through time are described by a finite state stationary Markov chain is studied. It is assumed that there are two boundary states which are to be avoided and a single calibration state to which the system is contolled by resetting. The determination of an optimal reset policy is formulated as an ordinary linear programming problem. It is shown that under certain symmetry and regularity conditions the optimal control rule has a simple and intuitive structure, while examples are given to show that relaxation of these conditions leads to the need for more complex control.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
