Abstract

Consider an uncertain system (Σ) described by the equationx(t)=A(r(t))x(t)+B(s(t))u(t), wherex(t) ∈R n is the state,u(t) ∈R m is the control,r(t) ∈ ℛ ⊂R p represents the model parameter uncertainty, ands(t) ∈L ⊂R l represents the input connection parameter uncertainty. The matrix functionsA(·),B(·) are assumed to be continuous and the restraint sets ℛ,L are assumed to be compact. Within this framework, a notion of quadratic stabilizability is defined. It is important to note that this type of stabilization is robust in the following sense: The Lyapunov function and the control are constructed using only the bounds ℛ,L. Much of the previous literature has concentrated on a fundamental question: Under what conditions onA(·),B(·), ℛ,L can quadratic stabilizability be assured? In dealing with this question, previous authors have shown that, if (Σ) satisfies certain matching conditions, then quadratic stabilizability is indeed assured (e.g., Refs. 1–2). Given the fact that matching is only a sufficient condition for quadratic stabilizability, the objective here is to characterize the class of systems for which quadratic stabilizability can be guaranteed.

Full Text
Published version (Free)

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