1. Introduction
The control of nonlinear plants has been a challenging problem to the control community for many years. A plethora of methods and approaches have been developed over the years, and here we cite just a few. An approach that generalizes linear systems is presented in [
1], where a nonlinear plant is considered, but within the class of Lipschitz nonlinear systems. The method utilizes the Lipschitz bounds to derive LMIs that guarantee stability and
performance. Another approach that is confined to another specific class relates to Lur’e [
2]-type sector-bounded [
3] nonlinear systems, whereas [
4] deals with stochastic, in probability, stabilization of the SAR (Stochastic Anti Resonance, see also [
5,
6]), whereas [
7] deals with the deterministic case. It should be noted that sector-bounded systems strongly relate to Hopfield networks [
8]. The present paper focuses on the deterministic continuous-time problem and is aimed at bounded-real-lemma-like characterization of the
-induced norm (actually
-norm in linear systems) and its application for control synthesis. A related discrete-time problem has been considered in [
9].
We note that the scope of applications of Lur’e-type systems control is much wider than what may seem to be at first sight. This wider scope is enabled by the universal approximation theorem [
10] for systems that are not a priori modeled with sector-bounded uncertainties. More precisely, when the model is not a priori sector-bounded, one may invoke the universal approximation theorem to fit a neural network with a single hidden layer, with, e.g., a tanh activation function and a linear output layer. Such networks provide an approximation with arbitrarily small error for a wide enough hidden layer. Consequently, the model of the system is readily and closely approximated as a sector-bounded Lur’e system. In the present paper it is shown that using the state feedback optimal control approach developed for the sector-type nonlinearities in combination with Cybenko’s universal approximation theorem, one can derive
-induced norm boundedness conditions for dynamic systems with wider classes of nonlinearities. This procedure is illustrated in
Section 6 for the optimal
-induced norm control of a van der Pol oscillator whose nonlinear term is not of bounded-sector type. The model of this system has been intensively studied in the context of the control of nonlinear oscillators. For instance, in [
11], global stabilization of the van der Pol system is analyzed. Different approaches to control such systems have been proposed, including PID (Proportional-Integral-Derivative) controllers (see e.g., [
12]), optimal controllers (e.g., [
13,
14]), nonlinear adaptive ([
15] and predictive controllers [
16]), neural network-based control [
17], to mention just a few references from the vast literature devoted to this topic.
The main contributions of this paper are the following:
Characterization of the -induced norm boundedness conditions for a class of systems with multiple sector-type nonlinearities;
Sufficient conditions for the existence of a state feedback controller providing an imposed level of the induced norm for systems with sector-bounded nonlinearities;
A loop transformation procedure to reduce the conservatism of the boundedness conditions;
Use of the universal approximation theorem to approximate general nonlinearities with sums of sector-bounded nonlinearities;
Illustration of the derived theoretical results for the optimal induced norm control of the van der Pol oscillator.
The remainder of this paper is organized as follows:
Section 2 presents the control problem formulation, whereas in
Section 3 an
-induced norm characterization for systems with multiple sector-bounded nonlinearities is provided. In
Section 4, the state feedback optimal
-induced control problem is solved. In order to reduce the conservatism of the boundedness conditions, a loop transformation procedure is proposed in
Section 5. Further, using the universal approximation theorem, an
-induced norm control problem is considered for the forced van der Pol oscillator. The paper ends with some final conclusions.
Notation. Throughout the paper, the superscript ‘⊤’ stands for matrix transposition, denotes the set of scalar real numbers whereas stands for the non-negative integers. Moreover, denotes the n dimensional Euclidean space, is the set of all real matrices, and the notation (), for means that P is symmetric and positive definite (positive semi-definite). By I one denotes the identity matrix of appropriate dimensions. The trace of a matrix Z is denoted by , and represents the Euclidian norm of an n-dimensional vector v. By one denoted the Lebesgue space of all valued functions , , with the property that . Finally, note that the terms Lyapunov and Riccati equations in this paper refer to generalized versions of the standard equations appearing in the the and control literature. Further, we denote by the operation that stacks all columns of a matrix into and by the operator that stacks the lower triangular part of a symmetric matrix into . We denote the inverse operation by . Also denotes the diagonal matrix with the scalars on its main diagonal.
2. Optimal Control Problem Formulation
Consider the following deterministic time-invariant nonlinear system:
in which
denotes the time variable and where the vector-valued functions
and
are defined as follows:
represents the state variable of the system (
1),
is an exogenous input,
denotes the control input,
is the system quality output, and
stands for the input to the activation function
. It is assumed that the nonlinear term
has the following form:
in which
are sector-type nonlinearities satisfying the conditions
and where
with
,
. The slope bounds
of the nonlinearities are assumed given and the matrix coefficients
and
are given and time-invariant. Throughout the paper it is assumed that
.
The problem consists of determining a state feedback control law such that for a given , the resulting system is stable and for all . To this end, we first characterize the -induced norm.
5. Loop Transformation and Reduced Conservatism
One can apply the result above for the synthesis of controllers for general nonlinear plants that can be represented by the system (
1). We note that far more general models of plants can be represented in this manner, also in cases where system nonlinearities are not a priori sector-bounded. In such cases, one may invoke the universal approximation theorem [
10] to systems where a single hidden layer, with, e.g., a
tanh activation function and a linear output layer, provides an approximation with arbitrarily small error for an arbitrarily wide hidden layer. In such cases, the model of system (
1) readily becomes relevant, as the approximate function is now sector-bounded. However, the formulation of (
1) embeds possible conservatism, as one can express
. In such a case,
are replaced by
provided
.
We now aim at conservatism reduction. To this end, we first consider a non-symmetric sector bound. Recall that
and note that
has shifted sector bounds. Since
, the bounds
are replaced by
and get the following non-symmetric bounds as expected:
Defining
and
, we finally obtain
Multiplying by
the inequalities (
10), it results that
and
have the same sign, from which it follows that
Conversely, if the above inequality holds, it follows that
, namely
and
have the same sign, and therefore
and
have the same sign, too. If they are greater or equal than 0, the inequalities (
10) directly follow. The case where both
and
are negative is easily shown to contradict the facts that
and
,
. Therefore, one concludes that (
10) is equivalent to the condition
for all
. Based on the definitions of
and
,
, one can define the matrices
and
Taking into account that
where
are the rows of
C, direct algebraic computations show that the sum
required when applying the
-procedure is used can be expressed as
, where
and where
We aim now at obtaining a version of Theorem 1 with the shifted sector bounds. To this end, we consider
of (
6) and rewrite it as
where
and where
is obtained from (
9) written for the system (
1) with the control
, namely by replacing the matrices
A,
L, and
D by
,
, and
, respectively. Using again the
procedure to impose the shifted sector bound constraints associated with
, we readily obtain the loop-transformed version of condition (
9) of Theorem 1,
where
The latter inequality can be readily expressed using YALMIP [
18], and we intentionally avoid writing the explicit formula for its blocks to avoid burdening the reader with unnecessary details. Note that similarly to the Lemma of
Section 1, the search variables are
,
and
, where
is found using line search within the interval
.
Based on Theorem 1, one obtains the following result.
Theorem 2. If there exist matrices , diagonal matrices , a matrix K and a scalar such thatin whichthen K stabilizes the system (1) satisfying the γ-attenuation condition for all . The inequality (
15) above is nonlinear. Further representation of (
15) for numerical implementation now follows. Fixing
and
T and multiplying the inequality (
15) to the left and to the right by
, and denoting
and
, based on Schur complement arguments and using the inequality
, it results that the condition (
15) is accomplished if the following linear matrix inequality (LMI) is feasible with respect to
and
Y:
where
and where the matrices
V and
W satisfy the following conditions:
Remark 1. Note that Theorem 2 involves terms that are bilinear in Λ
and T that were assumed to be fixed, or, in other words, remained for manual choice. One can, however, embed (16) in an optimization scheme, where the diagonal terms in Λ
and T are vectorized. One can then minimize a smooth approximation of max(0, ). While such an approach is free from manual tuning of Λ
and T, one should keep in mind that global convergence of such a heuristic approach does not guarantee global feasibility. Nevertheless, the results of Section 6 below employ such an approach. 6. State Feedback Control with L2-Induced Norm Attenuation for Van Der Pol Oscillator
The theoretical results derived in the previous sections are illustrated for a van der Pol oscillator described by the differential equation:
where
is a fixed parameter indicating the strength of the nonlinear damping. As it is well-known, this (unforced) equation was introduced a century ago in the context of oscillations modeling in a vacuum tube electrical circuit. Since then, it has been shown that such an equation is useful not only in electronics but also in other diverse domains as physics, biology, neurology and more recently in machine learning and evolutionary algorithms used to represent the real electrocardiographic signals ([
19]). The differential Equation (
19) may be represented in the state space by letting
and
for which one gets
Since the aim of this application is to stabilize (
20), ensuring a certain prescribed level of attenuation of the
-induced norm, one considered the following modified (forced) form of (
20):
where
is a disturbance input and
denotes the control input.
As can be seen, the nonlinearity in (
20) is not a sector-type one; it, therefore, was approximated using the universal approximation theorem proved by Cybenko [
10], stating that any continuous function can be approximated arbitrarily well by a neural network with at least one hidden layer with a finite number of weights. In the present application, the nonlinear term
was approximated as
with
N denoting the number of neurons and where the weights and the bias terms were determined by back propagation training (see e.g., [
8]). The network architecture is depicted in
Figure 1.
For
and for
, the time responses obtained with the approximation (
22) of
are presented in
Figure 2 (states as a function of time) and
Figure 3 (phase–plane), comparatively with the time responses of the original van der Pol oscillator (
20).
Using the approximation above of the nonlinearity
and defining
it follows that the van der Pol oscillator (
21) may be approximated as the first Equation (
1), where
and therefore,
,
. Following the notations of (
2) it results that
.
As far as the quality output is concerned, one considers
, obtaining thus the matrices
M and
N from the second Equation (
1) as
Note that (
16) is convex only for fixed
and
T for a given
. Therefore, we resorted to using unconstrained minimization of a scalar objective using the derivative-free Nelder–Mead simplex method (i.e., fminsearch from
) starting from an initial guess provided by solving the LMI of (
16) for a guess of
,
T and
and for
for which the LMI was solved. The search variables in this optimization scheme are the vectorized versions
and
, respectively, of
X and
Y. Then,
it results that
. The closed-loop simulation results with this gain are plotted in
Figure 4.