Abstract
In this paper we consider the quadratic optimal control problem of a discrete-time Markovian jump linear system, subject to constraints on the state and control variables. It is desired to find a state feedback controller, which may also depend on the jump variable, that minimizes a quadratic cost and satisfies some upper bounds on the norms of some random variables, related to the state and control variables of the system. The transition probability of the Markov chain and initial condition of the system may belong to appropriate convex sets. We obtain an approximation for the optimal solution of this problem in terms of linear matrices inequalities, so that convex programming can be used for numerical calculations. Examples are presented to illustrate the usefulness of the developed results.
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.
