2,660 research outputs found
An Overview of Integral Quadratic Constraints for Delayed Nonlinear and Parameter-Varying Systems
A general framework is presented for analyzing the stability and performance
of nonlinear and linear parameter varying (LPV) time delayed systems. First,
the input/output behavior of the time delay operator is bounded in the
frequency domain by integral quadratic constraints (IQCs). A constant delay is
a linear, time-invariant system and this leads to a simple, intuitive
interpretation for these frequency domain constraints. This simple
interpretation is used to derive new IQCs for both constant and varying delays.
Second, the performance of nonlinear and LPV delayed systems is bounded using
dissipation inequalities that incorporate IQCs. This step makes use of recent
results that show, under mild technical conditions, that an IQC has an
equivalent representation as a finite-horizon time-domain constraint. Numerical
examples are provided to demonstrate the effectiveness of the method for both
class of systems
Dissipative Stabilization of Linear Systems with Time-Varying General Distributed Delays (Complete Version)
New methods are developed for the stabilization of a linear system with
general time-varying distributed delays existing at the system's states, inputs
and outputs. In contrast to most existing literature where the function of
time-varying delay is continuous and bounded, we assume it to be bounded and
measurable. Furthermore, the distributed delay kernels can be any
square-integrable function over a bounded interval, where the kernels are
handled directly by using a decomposition scenario without using
approximations. By constructing a Krasovski\u{i} functional via the application
of a novel integral inequality, sufficient conditions for the existence of a
dissipative state feedback controller are derived in terms of matrix
inequalities without utilizing the existing reciprocally convex combination
lemmas. The proposed synthesis (stability) conditions, which take dissipativity
into account, can be either solved directly by a standard numerical solver of
semidefinite programming if they are convex, or reshaped into linear matrix
inequalities, or solved via a proposed iterative algorithm. To the best of our
knowledge, no existing methods can handle the synthesis problem investigated in
this paper. Finally, numerical examples are presented to demonstrate the
effectiveness of the proposed methodologies.Comment: Accepted by Automatic
- …