1. Introduction
Extremum seeking (ES) is a feedback adaptive control strategy which is used to steer a dynamic plant toward the extrema of the unknown maps. The rigorous analytical framework of the ES scheme was achieved in the literature [
1] in 2000. Since then, there have been many advances for the ES algorithm in theory (e.g., non-local ES stability [
2], stochastic ES [
3,
4], sampled-data ES [
5,
6], Lie-bracket-based ES [
7,
8], distributed ES [
9], ES with time delays [
10,
11]) as well as practical applications (e.g., [
12,
13,
14,
15,
16] and references therein).
Most of the above publications are focused on searching for the extrema of an unknown objective function. However, refs. [
17,
18] studied the scheme in which the desired operating point of a refrigeration system is the maximum slope rather than the extremum for the objective function with sigmoid-like properties. Moreover, ref. [
19] were concerned with seeking the slope by introducing a slope reference signal into a perturbation-based ES algorithm. A Newton-like ES system which employs the estimate of the second derivative of the unknown function was conducted by [
20]. In addition, by generalizing the choice of demodulation signals to estimate the map’s
nth derivatives on average, the authors of [
21] proposed a scalar Newton-based ES system which maximizes the higher derivatives of unknown maps. These authors further extended their scheme to the case of stochastic ES in [
22,
23]. The paper [
24] subsequently proposed the Newton-based ES scheme for maximizing the map’s higher derivatives in the presence of time delays by implementing a predictor that compensates the known and constant delay. Subsequent publications [
25,
26] further developed Newton-based ES for higher-derivative maps subject to time-varying and uncertain delays.
On the other hand, inspired by the research of [
27], who introduced a novel time-delay approach to periodic averaging, ref. [
28] developed a constructive time-delay approach for stability analysis of gradient-based ES control system. Recently, ref. [
29] extended the time-delay approach for ES schemes from quadratic maps to general nonlinear maps. It should be noted that in comparison with the classical averaging method (e.g., [
21,
22,
23,
24,
25,
26]), the time-delay approach (refer to, e.g., [
27,
28,
29]) is able to provide quantitative upper bounds on the parameter, that is, the dither period, which provides guidance for ES system design.
As is well known, in most cases the presence of time delays (due to computation, measurement, transmission, etc.) is a source of instability for a control system [
30,
31]. As a kind of real-time optimization control strategy, the impact of time delays on the ES system is particularly serious. Consequently, analyzing time-delay effects on extremum seeking for the nonlinear map’s first derivative is essential. The existing predictor-based methods (see, e.g., [
10,
24,
25,
26]) compensate for delays through various sorts of predictors, thereby accommodating arbitrarily large time delays. However, if the ES system is capable of bearing somewhat large delays, then there is no need to use predictors that introduce more complexity. In addition, predictor-based methods employ the classical averaging theory to prove the stability of ES systems. As a result, these ES systems are practically stable provided that the dither frequency is large enough while the dither magnitude is sufficiently small; in other words, it is a qualitative analysis.
Motivated by the above discussion, we focus on extremum seeking of the first derivative of nonlinear maps with constant time delays, and extend the time-delay approach to the delay-robustness analysis of the proposed ES system. First, the demodulation signal is designed to estimate the gradient of the map’s first derivative in the presence of constant delays. Second, by applying the time-delay approach to averaging, the original ES system is transformed into a neutral-type time-delay system and then further reformulated as a retarded-type model with disturbances. Finally, by employing the proposed Lyapunov functional, stability conditions in the form of linear matrix inequalities (LMIs) are rigorously derived. When the nonlinear map is unknown, we provide a rigorous practical stability analysis. In addition, we suggest a quantitative calculation on the maximum allowable delay and the upper bound of the dither period along with the ultimate seeking error if the related bounds of nonlinear maps are available. A preliminary conference paper version which considers the delay-free case has been presented in [
32].
Notation 1. Let stand for the set of non-negative integers. The set of n-times continuously differentiable functions is denoted by , with . The notation denotes the n-th derivative of the function . For a symmetric matrix X, the notation represents that it is a negative definite matrix.
2. Main Results
We consider the extremum seeking system for maximizing the map’s first derivative as depicted in
Figure 1. The basic principle of the proposed system (
Figure 1) is as follows: the periodic perturbation
is added to the signal
, which is the estimate of
. If
is on either side of
, then the perturbation
will create a periodic response of
y. With consideration of time delays, the designed demodulation signal
estimates the gradient of the map’s first derivative from the output signal
y. The integrator module is approximately the gradient update law, which is used to tune
to
. To simplify analysis, the proposed scheme does not consider the filters. For more details, please refer to [
1]. Note that the ES control scheme is subject to transmission input delay
and output delay
, where
and
are known positive constants (refer to, e.g., [
10,
24]). The whole time delay of the closed-loop system is
. The scalar steady-state map is provided as follows:
where
is the measurable output,
is the scalar input, and
is a nonlinear function. The map (
1) satisfies the following assumptions, which are adapted from [
29].
Assumption 1. There exist and small such that . Without loss of generality, we define to be the collection of maxima where is locally concave. Assuming that and , the following relation holds:where is a known —dependent constant which decreases monotonically with respect to σ. Assumption 2. For any and a defined in Assumption 1, given , we havein which , , and L are available positive constants. Remark 1. Note that in most of the literature based on the classical averaging method, the upper bounds involved in (4) are not necessary, making for a qualitative analysis approach. This paper also suggests a qualitative stability analysis when these upper bounds are unknown. Furthermore, if the corresponding bounds provided in (4) are available (that is, if we are faced with a “grey box” instead of “black box”), then the developed time-delay approach provides a quantitative analysis by which the maximum allowable delay, the upper bound on the dither period, and the ultimate seeking error can all be attained. It is evident that a tradeoff exists between the quantitative calculation using model knowledge and the qualitative analysis without the plant information. Let
be the estimate of
. Then, the estimation error is defined as
The ES regulator is stated as follows:
in which the initial condition
and
for
, i.e., the ES controller starts to work when the measured output signal arrives at the controller side at time
. Moreover,
is the adaptation gain and the excitation signals are provided as follows:
where
a and
are the amplitude and frequency of the dither signal
, respectively. The demodulation signal
provided in (
7) is designed to estimate the gradient of the map’s first derivative in the presence of constant delays, which is adapted from [
23]. It should be noted that the only obtainable measurements are from the map rather than its derivative.
Based on (
5)–(
7), we consider the Taylor expansion of
such that
where
with
. Substituting (
7) and (
8) into (
6) and taking the time derivative of (
5) along with the second formula of (
6), the dynamics of the estimation error are governed by
We re-scale the dither period as
and subsequently rearrange Equation (
9) as follows:
where
The stability analysis for the ES system in (
10) is performed by employing the classical averaging method (refer to [
33]) in the existing literature (see, e.g., [
24]). To be specific, by setting the dither frequency
large enough compared to the regulator gain
k, the state
varies slowly relative to the high-frequency dither signals. Then,
,
, and
are ‘frozen’ and we treat them as constants. In adddition, the last term
on the right-hand side of (
10) is neglected by choosing the parameter
a to be sufficiently small. Therefore, we derive the corresponding averaged system
in which the following trigonometric integrals are utilized:
Considering
in (
12), under (
3) in Assumption 1 and
, if
, then
such that the derivative
, which implies that
will converge to zero and vice versa. As a result, the delay-free averaged system is stable. For the case with
in (
12), we are interested in the robustness against the length of the delay such that the averaged nonlinear system in (
12) is able to maintain stability. It is worth mentioning that for the scenario of quadratic maps involved in a linear time-delay model (see [
34], Corollary 1), the designers can decrease the decay rate
k with the purpose of handling any large delay
D in principle. Here, we are faced with the comparable fact for the nonlinear time-delay system that we are also able to deal with any large delay, but with almost zero decay rate. However, the real-time convergence speed of the ES system should be guaranteed, meaning that the controller gain cannot be arbitrarily small in practice. Therefore, we should keep a balance between the convergence rate and the maximum allowable delay.
In the following, the time-delay approach (see [
27,
28]) is performed to cope with the original ES system in (
10). Specifically, we integrate
over the interval
for
such that
For the first term on the right-hand side of (
13), the following relation is true:
where we use the fact that
. To handle the second term on the right-hand side of (
13), we obtain
in which we have utilized
. Similarly, we manage the third term on the right-hand side of (
13) as follows:
where
is employed. The last term on the right-hand side of (
13) is calculated as
where we use the fact that
.
After that, by substituting (
14)–(
17) into (
13) we obtain the following relation:
where
We introduce the variable as follows:
then the following equation holds:
By substituting (
10) and (
18) into (
21), the closed-loop error system is provided by
with
defined by (
10).
Note that based on Assumption 2, the map
along with its derivatives
,
, and
are of order
, which indicates that
is
. We subsequently obtain the perturbation terms
and
of order
, while the term
is
. All of these disturbance terms involved in (
22) will decay to zero when
is chosen to be sufficiently small and
.
Remark 2. It is worth mentioning that based on the classical averaging theory, the original ES system (10) is approximated to the averaged system (12), in which the terms and provided in (10) are omitted. However, the term is equivalently transformed into the disturbance terms and the term is preserved by applying the proposed time-delay approach. It is apparent that the transformation (10) → (22) does not employ any approximation, i.e., the resulting time-delay plant (22) is an accurate model for the original ES system (10). Consequently, the stability of the system (10) can be deduced from that of the system (22). In order to simplify the stability analysis, we further introduce the following change of variables (refer to [
35]):
then rewrite the neutral-type retarded system (
22) as follows:
where
Let us suppose that the overall bound of the estimation error satisfies the following relation:
According to the definitions provided in (
5)–(
7), we then have
, which is identical to that of Assumption 1. Combining the initial condition underneath (
6) and the LMI conditions (
30) in Theorem 1, the overall bound (
26) will always be guaranteed. Based on the bounds (
4) in Assumption 2 and the overall bound (
26), the upper bounds on
and
are calculated from (
11) and (
10), respectively:
Accordingly, from (
19), (
20), and (
24), the following relations are satisfied:
Additionally, based on the bounds in (
4) and (
28) and using the differential mean value theorem, (
25) yields
where
.
Theorem 1. Consider the closed-loop system consisting of the scalar map (1) and the ES regulator (6) under Assumptions 1 and 2 as well as the initial condition for . Given tuning parameters , where , a, and D are small, let the scalar decision variables , and satisfy the following LMIs:where Ψ is the symmetric matrix composed ofwith the other terms being zero and withThen, for any , the estimation error satisfiesand is exponentially attracted to the setwhich is adjustable through the tuning parameters ε and a. Furthermore, LMIs (30) are always feasible for sufficient small , a, and D. It should be noted that the exponential convergence rate of
in (
33) is
for
, which is controlled by the adaptation gain
k such that
in
of (
31). It is also worth mentioning that the overall bound provided in (
26) indicates that ES can be performed within this domain, whereas the ultimate bound (
34) represents the ultimate seeking error of the ES system as
, which can be adjusted via the parameters
and
a.
Remark 3. Notice that LMIs (30) are always feasible for small enough , a, and D, which means that we provide a rigorously practical stability analysis. In addition, Theorem 1 is able to suggest a quantitative estimation on the upper bound of the dither period and the maximum allowable delay when the bounds for the nonlinear maps in Assumption 2 are available. 3. Numerical Simulations
Consider the following nonlinear scalar map:
This map (
35) and its first derivative are depicted in
Figure 2a. Obviously, it has a maximum at
for the map’s first derivative. We can employ the ES regulator (
6) with
to search for the extrema of the first derivative of the map (
35) with delays. For the map (
35) with a given
, the
Real Bounds are from the exact bounds calculated by (
4), while the
Estimated Bounds are somewhat larger than the
Real Bounds. In the case with
, the corresponding bounds are as follows:
Real Bounds:
,
;
Estimated Bounds:
.
For the two groups of data, the results that attained from Theorem 1 are listed in
Table 1 and
Table 2, respectively, where “UB” denotes the ultimate bound
, that is, the ultimate seeking error provided by (
34). As shown in
Table 1 and
Table 2, a smaller dither period
results in a tighter ultimate bound. It is also observed that more accurate map information results in a smaller ultimate bound. Note that existing predictor-based methods cannot yield quantitative analysis results.
Figure 2 reveals the numerical simulation results, where
. As shown in
Figure 2b, the system output practically converges to the extrema of the mapping function’s first derivative. It is evident from
Figure 2b,c that increasing the time delay will lead to the system tending to be unstable. The results in
Figure 2c,d confirm that we can reduce the controller gain to compensate for the effects of large time delays. Meanwhile, the controller gain cannot be arbitrarily small due to the requirement of guaranteeing the real-time convergence speed of the ES system.