Next Article in Journal
State of Charge Prediction for Electric Vehicles Based on Integrated Model Architecture
Previous Article in Journal
A Bayesian Additive Regression Trees Framework for Individualized Causal Effect Estimation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Extremum Seeking for the First Derivative of Nonlinear Maps with Constant Delays via a Time-Delay Approach

by
Jianzhong Li
1,2,*,
Hongye Su
2 and
Yang Zhu
2
1
School of Information and Control Engineering, Southwest University of Science and Technology, Mianyang 621010, China
2
College of Control Science and Engineering, Zhejiang University, Hangzhou 310027, China
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(13), 2196; https://doi.org/10.3390/math13132196
Submission received: 19 May 2025 / Revised: 21 June 2025 / Accepted: 3 July 2025 / Published: 4 July 2025
(This article belongs to the Section E2: Control Theory and Mechanics)

Abstract

This paper introduces an extremum seeking (ES) scheme for the unknown map’s first derivative by tailoring a demodulation signal in which the closed-loop system is subject to constant transmission delays. Unlike most publications that manage delays using predictor-based methods, we are concerned with the delay-robustness of the introduced ES system via the newly developed time-delay approach. The original ES system is transformed to a nonlinear retarded-type plant with disturbances and the stability condition in the form of linear matrix inequalities is achieved. When the related bounds of the nonlinear map are not known, a rigorous practical stability proof is provided. Second, and more importantly, under the availability of prior knowledge about the nonlinear map, we are able to provide a quantitative calculation on the maximum allowable delay, the upper bound of the dither period, and the ultimate seeking error. Numerical examples are offered to exemplify the effectiveness of the proposed method.

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 N stand for the set of non-negative integers. The set of n-times continuously differentiable functions is denoted by C n , with n N . The notation f ( n ) ( · ) denotes the n-th derivative of the function f ( · ) . For a symmetric matrix X, the notation X < 0 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 S ( t ) is added to the signal θ ^ , which is the estimate of θ . If θ ^ is on either side of θ , then the perturbation S ( t ) will create a periodic response of y. With consideration of time delays, the designed demodulation signal Υ ( t ) 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 D in and output delay D out , where D in and D out are known positive constants (refer to, e.g., [10,24]). The whole time delay of the closed-loop system is D = D in + D out . The scalar steady-state map is provided as follows:
y ( t ) = f θ ( · )
where y ( t ) R is the measurable output, θ R is the scalar input, and f ( θ ) is a nonlinear function. The map (1) satisfies the following assumptions, which are adapted from [29].
Assumption 1.
There exist θ R ,   σ > 0 and small a > 0 such that f ( θ ) C 3 ( θ σ a , θ + σ + a ) . Without loss of generality, we define
θ max = θ f ( 2 ) ( θ ) = 0 , f ( 3 ) ( θ ) < 0
θ max to be the collection of maxima where f ( 1 ) ( θ ) is locally concave. Assuming that θ θ max and θ max , the following relation holds:
f ( 2 ) ( θ + Δ ) · Δ μ ( σ ) · Δ 2 < 0 , 0 < | Δ | < σ
where μ ( σ ) > 0 is a known σ —dependent constant which decreases monotonically with respect to σ.
Assumption 2.
For any | Δ | < σ and a defined in Assumption 1, given ξ [ 1 ,   1 ] , we have
f ( θ + Δ ) < f 0 ( σ ) , f ( 1 ) ( θ + Δ ) < f 1 ( σ ) , f ( 2 ) ( θ + Δ ) < f 2 ( σ ) , f ( 3 ) ( θ + Δ ) < f 3 ( σ ) , f ( 3 ) ( θ + Δ + a ξ ) < f 3 ( σ , a ) , f ( 2 ) ( θ + Δ ) f ( 2 ) ( θ ) < L | Δ | ,
in which f 0 ( σ ) , f 1 ( σ ) , f 2 ( σ ) , f 3 ( σ ) , f 3 ( σ , a ) , 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 θ ^ ( t ) be the estimate of θ . Then, the estimation error is defined as
θ ˜ ( t ) = θ ^ ( t ) θ .
The ES regulator is stated as follows:
θ ( t ) = θ ^ ( t ) + S t , θ ^ ˙ ( t ) = k · Υ ( t ) · y ( t D out ) , t D
in which the initial condition θ ^ ( t ) θ σ 0 , θ + σ 0 and θ ^ ˙ ( t ) 0 for t 0 , D , i.e., the ES controller starts to work when the measured output signal arrives at the controller side at time t = D . Moreover, k > 0 is the adaptation gain and the excitation signals are provided as follows:
S ( t ) = a · sin ω t , Υ ( t ) = 8 a 2 · cos 2 ω ( t D )
where a and ω are the amplitude and frequency of the dither signal S ( t ) , respectively. The demodulation signal Υ ( t ) 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 y ( t D out ) such that
y ( t D out ) = f θ ( t D in D out ) = f θ ( t D ) = f θ + θ ˜ ( t D ) + a sin ( ω ( t D ) ) = f θ + θ ˜ ( t D ) + f ( 1 ) θ + θ ˜ ( t D ) · a sin ( ω ( t D ) ) + 1 2 ! f ( 2 ) θ + θ ˜ ( t D ) · a 2 sin 2 ( ω ( t D ) ) + 1 3 ! B ( t ) · a 3 sin 3 ( ω ( t D ) ) ,
where B ( t ) = f ( 3 ) θ + θ ˜ ( t D ) + ζ a sin ( ω ( t D ) ) with ζ ( 0 , 1 ) . 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
θ ˜ ˙ ( t ) = 8 k a 2 · cos 2 ω ( t D ) · y ( t D out ) = 8 k a 2 cos 2 ω ( t D ) [ f θ + θ ˜ ( t D ) + f ( 1 ) θ + θ ˜ ( t D ) · a sin ( ω ( t D ) ) + a 2 2 f ( 2 ) θ + θ ˜ ( t D ) · 1 cos ( 2 ω ( t D ) ) 2 + a 3 6 B ( t ) · sin 3 ( ω ( t D ) ) ] = 8 k a 2 f θ + θ ˜ ( t D ) cos 2 ω ( t D ) + 8 k a f ( 1 ) θ + θ ˜ ( t D ) cos 2 ω ( t D ) sin ( ω ( t D ) ) 2 k f ( 2 ) θ + θ ˜ ( t D ) cos 2 ω ( t D ) + k f ( 2 ) θ + θ ˜ ( t D ) + k f ( 2 ) θ + θ ˜ ( t D ) cos 4 ω ( t D ) 4 k a 3 B ( t ) cos 2 ω ( t D ) sin 3 ( ω ( t D ) ) .
We re-scale the dither period as ε = 2 π ω and subsequently rearrange Equation (9) as follows:
θ ˜ ˙ ( t ) = k f ( 2 ) θ + θ ˜ ( t D ) + k F ( t ) 4 3 k a R ( t )
where
F ( t ) 8 a 2 f θ + θ ˜ ( t D ) cos 4 π ε ( t D ) 8 a f ( 1 ) θ + θ ˜ ( t D ) cos 4 π ε ( t D ) sin 2 π ε ( t D ) 2 f ( 2 ) θ + θ ˜ ( t D ) cos 4 π ε ( t D ) + f ( 2 ) θ + θ ˜ ( t D ) cos 8 π ε ( t D ) , R ( t ) B ( t ) cos 4 π ε ( t D ) sin 3 2 π ε ( t D ) .
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 1 ε large enough compared to the regulator gain k, the state θ ˜ ( · ) varies slowly relative to the high-frequency dither signals. Then, f θ + θ ˜ ( t D ) , f ( 1 ) θ + θ ˜ ( t D ) , and f ( 2 ) θ + θ ˜ ( t D ) are ‘frozen’ and we treat them as constants. In adddition, the last term 4 3 k a R ( t ) 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
θ ˜ ˙ a v ( t ) = k f ( 2 ) θ + θ ˜ a v ( t D ) ,
in which the following trigonometric integrals are utilized:
1 ε t ε t cos 4 π ε ( τ D ) d τ = 0 , 1 ε t ε t cos 8 π ε ( τ D ) d τ = 0 , 1 ε t ε t cos 4 π ε ( τ D ) sin 2 π ε ( τ D ) d τ = 0 .
Considering D 0 in (12), under (3) in Assumption 1 and k > 0 , if θ ˜ a v ( · ) > 0 , then f ( 2 ) θ + θ ˜ a v ( · ) < 0 such that the derivative θ ˜ ˙ a v ( t ) < 0 , which implies that θ ˜ a v ( · ) will converge to zero and vice versa. As a result, the delay-free averaged system is stable. For the case with D > 0 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 F ( t ) over the interval [ t ε , t ] for t ε + D such that
1 ε t ε t F ( τ ) d τ = 8 a 2 · 1 ε t ε t f θ + θ ˜ ( τ D ) cos 4 π ε ( τ D ) d τ 8 a · 1 ε t ε t f ( 1 ) θ + θ ˜ ( τ D ) cos 4 π ε ( τ D ) sin 2 π ε ( τ D ) d τ 2 · 1 ε t ε t f ( 2 ) θ + θ ˜ ( τ D ) cos 4 π ε ( τ D ) d τ + 1 ε t ε t f ( 2 ) θ + θ ˜ ( τ D ) cos 8 π ε ( τ D ) d τ .
For the first term on the right-hand side of (13), the following relation is true:
8 a 2 · 1 ε t ε t f θ + θ ˜ ( τ D ) cos 4 π ε ( τ D ) d τ = 8 a 2 · 1 ε t ε t cos 4 π ε ( τ D ) f θ + θ ˜ ( t D ) f θ + θ ˜ ( τ D ) d τ = 8 a 2 · 1 ε t ε t cos 4 π ε ( τ D ) τ D t D f ( 1 ) θ + θ ˜ ( s ) θ ˜ ˙ ( s ) d s d τ
where we use the fact that t ε t cos 4 π ε ( τ D ) d τ · f θ + θ ˜ ( t D ) = 0 . To handle the second term on the right-hand side of (13), we obtain
8 a · 1 ε t ε t f ( 1 ) θ + θ ˜ ( τ D ) cos 4 π ε ( τ D ) sin 2 π ε ( τ D ) d τ = 8 a ε t ε t cos 4 π ε ( τ D ) sin 2 π ε ( τ D ) f ( 1 ) θ + θ ˜ ( t D ) f ( 1 ) θ + θ ˜ ( τ D ) d τ = 8 a ε t ε t cos 4 π ε ( τ D ) sin 2 π ε ( τ D ) τ D t D f ( 2 ) θ + θ ˜ ( s ) θ ˜ ˙ ( s ) d s d τ ,
in which we have utilized t ε t cos 4 π ε ( τ D ) sin 2 π ε ( τ D ) d τ · f ( 1 ) θ + θ ˜ ( t D ) = 0 . Similarly, we manage the third term on the right-hand side of (13) as follows:
2 · 1 ε t ε t f ( 2 ) θ + θ ˜ ( τ D ) cos 4 π ε ( τ D ) d τ = 2 ε t ε t cos 4 π ε ( τ D ) f ( 2 ) θ + θ ˜ ( t D ) f ( 2 ) θ + θ ˜ ( τ D ) d τ = 2 ε t ε t cos 4 π ε ( τ D ) τ D t D f ( 3 ) θ + θ ˜ ( s ) θ ˜ ˙ ( s ) d s d τ
where t ε t cos 4 π ε ( τ D ) d τ · f ( 2 ) θ + θ ˜ ( t D ) = 0 is employed. The last term on the right-hand side of (13) is calculated as
1 ε t ε t f ( 2 ) θ + θ ˜ ( τ D ) cos 8 π ε ( τ D ) d τ = 1 ε t ε t cos 8 π ε ( τ D ) f ( 2 ) θ + θ ˜ ( t D ) f ( 2 ) θ + θ ˜ ( τ D ) d τ = 1 ε t ε t cos 8 π ε ( τ D ) τ D t D f ( 3 ) θ + θ ˜ ( s ) θ ˜ ˙ ( s ) d s d τ ,
where we use the fact that t ε t cos 8 π ε ( τ D ) d τ · f ( 2 ) θ + θ ˜ ( t D ) = 0 .
After that, by substituting (14)–(17) into (13) we obtain the following relation:
1 ε t ε t F ( τ ) d τ = 8 a 2 Y 1 ( t ) + 8 a Y 2 ( t ) + 2 Y 3 ( t ) + Y 4 ( t )
where
Y 1 ( t ) 1 ε t ε t τ D t D cos 4 π ε ( τ D ) f ( 1 ) θ + θ ˜ ( s ) θ ˜ ˙ ( s ) d s d τ , Y 2 ( t ) 1 ε t ε t τ D t D cos 4 π ε ( τ D ) sin 2 π ε ( τ D ) f ( 2 ) θ + θ ˜ ( s ) θ ˜ ˙ ( s ) d s d τ , Y 3 ( t ) 1 ε t ε t τ D t D cos 4 π ε ( τ D ) f ( 3 ) θ + θ ˜ ( s ) θ ˜ ˙ ( s ) d s d τ , Y 4 ( t ) 1 ε t ε t τ D t D cos 8 π ε ( τ D ) f ( 3 ) θ + θ ˜ ( s ) θ ˜ ˙ ( s ) d s d τ .
We introduce the variable as follows:
G ( t ) = 1 ε t ε t ( τ t + ε ) F ( τ ) d τ ,
then the following equation holds:
d d t θ ˜ ( t ) k G ( t ) = θ ˜ ˙ ( t ) k F ( t ) + k ε t ε t F ( τ ) d τ .
By substituting (10) and (18) into (21), the closed-loop error system is provided by
d d t θ ˜ ( t ) k G ( t ) = k f ( 2 ) θ + θ ˜ ( t D ) + 8 k a 2 Y 1 ( t ) + 8 k a Y 2 ( t ) + 2 k Y 3 ( t ) + k Y 4 ( t ) 4 3 k a R ( t ) , t ε + D ,
with θ ˜ ˙ ( t ) defined by (10).
Note that based on Assumption 2, the map f ( · ) along with its derivatives f ( 1 ) ( · ) , f ( 2 ) ( · ) , and f ( 3 ) ( · ) are of order O ( 1 ) , which indicates that θ ˜ ˙ ( t ) is O 1 a 2 . We subsequently obtain the perturbation terms G ( t ) and Y i ( t ) , i = 1 , 2 , 3 , 4 of order O ε a 2 , while the term 4 3 k a R ( t ) is O ( a ) . All of these disturbance terms involved in (22) will decay to zero when ε is chosen to be sufficiently small and a = ε 1 5 .
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 k F ( t ) and 4 3 k a R ( t ) provided in (10) are omitted. However, the term F ( t ) is equivalently transformed into the disturbance terms Y i ( t ) , i = 1 , 2 , 3 , 4 and the term 4 3 k a R ( t ) 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]):
z ( t ) = θ ˜ ( t ) k G ( t )
then rewrite the neutral-type retarded system (22) as follows:
z ˙ ( t ) = k f ( 2 ) θ + z ( t D ) + k G ( t D ) + 8 k a 2 Y 1 ( t ) + 8 k a Y 2 ( t ) + 2 k Y 3 ( t ) + k Y 4 ( t ) 4 3 k a R ( t ) = k f ( 2 ) θ + z ( t D ) + k Φ ( t ) + 8 k a 2 Y 1 ( t ) + 8 k a Y 2 ( t ) + 2 k Y 3 ( t ) + k Y 4 ( t ) 4 3 k a R ( t ) , t ε + D
where
Φ ( t ) f ( 2 ) θ + z ( t D ) + k G ( t D ) f ( 2 ) θ + z ( t D ) .
Let us suppose that the overall bound of the estimation error satisfies the following relation:
| θ ˜ ( t ) | < σ , t 0 .
According to the definitions provided in (5)–(7), we then have θ σ a < θ ( t ) = θ + θ ˜ ( t ) + a sin ω t < θ + σ + a , 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 F ( t ) , R ( t ) and θ ˜ ˙ ( t ) are calculated from (11) and (10), respectively:
F ( t ) 8 a 2 f θ + θ ˜ ( t D ) cos 4 π ε ( t D ) + 8 a f ( 1 ) θ + θ ˜ ( t D ) cos 4 π ε ( t D ) sin 2 π ε ( t D ) + 2 f ( 2 ) θ + θ ˜ ( t D ) cos 4 π ε ( t D ) + f ( 2 ) θ + θ ˜ ( t D ) cos 8 π ε ( t D ) < 8 a 2 f 0 ( σ ) + 8 a f 1 ( σ ) + 3 f 2 ( σ ) Δ F , R ( t ) = B ( t ) cos 4 π ε ( t D ) sin 3 2 π ε ( t D ) B ( t ) < f 3 ( σ , a ) Δ R , θ ˜ ˙ ( t ) k f ( 2 ) θ + θ ˜ ( t D ) + k F ( t ) + 4 3 k a R ( t ) < k f 2 ( σ ) + Δ F + 4 3 a Δ R Δ θ .
Accordingly, from (19), (20), and (24), the following relations are satisfied:
| G ( t ) | = 1 ε t ε t ( τ t + ε ) F ( τ ) d τ 1 ε t ε t ( τ t + ε ) d τ · | F ( τ ) | < Δ F 2 ε , | Y 1 ( t ) | = 1 ε t ε t τ D t D cos 4 π ε ( τ D ) f ( 1 ) θ + θ ˜ ( s ) θ ˜ ˙ ( s ) d s d τ < 1 ε t ε t τ D t D d s d τ · f 1 ( σ ) Δ θ = f 1 ( σ ) Δ θ 2 ε , | Y 2 ( t ) | = 1 ε t ε t τ D t D cos 4 π ε ( τ D ) sin 2 π ε ( τ D ) f ( 2 ) θ + θ ˜ ( s ) θ ˜ ˙ ( s ) d s d τ < 1 ε t ε t τ D t D d s d τ · f 2 ( σ ) Δ θ = f 2 ( σ ) Δ θ 2 ε , | Y 3 ( t ) | = 1 ε t ε t τ D t D cos 4 π ε ( τ D ) f ( 3 ) θ + θ ˜ ( s ) θ ˜ ˙ ( s ) d s d τ < 1 ε t ε t τ D t D d s d τ · f 3 ( σ ) Δ θ = f 3 ( σ ) Δ θ 2 ε , | Y 4 ( t ) | = 1 ε t ε t τ D t D cos 8 π ε ( τ D ) f ( 3 ) θ + θ ˜ ( s ) θ ˜ ˙ ( s ) d s d τ < 1 ε t ε t τ D t D d s d τ · f 3 ( σ ) Δ θ = f 3 ( σ ) Δ θ 2 ε , | z ˙ ( t ) | | k f ( 2 ) θ + z ( t D ) + k G ( t D ) | + 8 k a 2 Y 1 ( t ) + 8 k a Y 2 ( t ) + | 2 k Y 3 ( t ) | + | k Y 4 ( t ) | + 4 3 k a R ( t ) < k f 2 ( σ ) + 4 f 1 ( σ ) Δ θ a 2 ε + 4 f 2 ( σ ) Δ θ a ε + 3 f 3 ( σ ) Δ θ 2 ε + 4 3 a Δ R Δ z .
Additionally, based on the bounds in (4) and (28) and using the differential mean value theorem, (25) yields
Φ ( t ) f ( 3 ) θ + z ( t D ) + ζ k G ( t D ) · k G ( t D ) < f 3 ( σ ) k Δ F 2 ε ,
where ζ ( 0 , 1 ) .
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 | θ ˜ ( 0 ) | σ 0 < σ for t 0 , D . Given tuning parameters σ 0 , D , k , a , δ , ε > 0 , where ε , a, and D are small, let the scalar decision variables λ 1 , λ 2 , λ 3 , λ 4 , λ 5 , λ 6 , λ 7 > 0 , and P 1 , Q > 0 , R > 0 satisfy the following LMIs:
Ω 0 = Ψ Ξ Ξ T R < 0 , Ω 1 = ϖ 2 δ < σ k Δ F 2 ε 2 Ω 2 = ( P + Q D ) ν 2 + R D 3 Δ z 2 < σ k Δ F 2 ε 2
where Ψ is the symmetric matrix composed of
Ψ 11 = 2 k μ ( σ ) 2 δ P + Q , Ψ 13 = k L P , Ψ 15 = k P , Ψ 16 = 8 k a 2 P , Ψ 17 = 8 k a P , Ψ 18 = 2 k P , Ψ 19 = k P , Ψ 1 , 10 = 4 3 k a P , Ψ 22 = Q e 2 δ D + λ 1 L 2 , Ψ 33 = R e 2 δ D , Ψ 44 = λ 1 , Ψ 55 = λ 2 ε , Ψ 66 = λ 3 ε , Ψ 77 = λ 4 ε , Ψ 88 = λ 5 ε , Ψ 99 = λ 6 ε , Ψ 10 , 10 = λ 7 a ,
with the other terms being zero and with
Ξ = 0 , 0 , 0 , k , k , 8 k a 2 , 8 k a , 2 k , k , 4 3 k a T D R , ν = σ 0 + Δ θ ε + k Δ F 2 ε , ϖ = λ 2 k 2 f 3 2 ( σ ) Δ F 2 4 ε + λ 3 f 1 2 ( σ ) Δ θ 2 4 ε + λ 4 f 2 2 ( σ ) Δ θ 2 4 ε + λ 5 f 3 2 ( σ ) Δ θ 2 4 ε + λ 6 f 3 2 ( σ ) Δ θ 2 4 ε + λ 7 a Δ R 2 .
Then, for any ε ( 0 , ε ] , the estimation error satisfies
| θ ˜ ( t ) | < | θ ˜ ( D ) | + Δ θ ( t D ) < σ , t [ D , ε + D ] , | θ ˜ ( t ) | < ( P + Q D ) ν 2 + R D 3 Δ z 2 e 2 δ ( t ε D ) + 1 e 2 δ ( t ε D ) ϖ 2 δ 1 2 + k Δ F 2 ε < σ , t [ ε + D , ) ,
and is exponentially attracted to the set
Θ = θ ˜ R : | θ ˜ | < ϖ 2 δ + k Δ F 2 ε ,
which is adjustable through the tuning parameters ε and a. Furthermore, LMIs (30) are always feasible for sufficient small ε , a, and D.
Proof of Theorem 1.
Please refer to Appendix A. □
It should be noted that the exponential convergence rate of | θ ˜ ( t ) | in (33) is δ for t ε + D , which is controlled by the adaptation gain k such that 0 < δ < k μ ( σ ) in Ψ 11 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 t , 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:
f ( θ ) = ( θ 0.5 ) 3 + θ .
This map (35) and its first derivative are depicted in Figure 2a. Obviously, it has a maximum at θ = 0.5 for the map’s first derivative. We can employ the ES regulator (6) with k = 0.01 , a = 0.1 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 σ = 1 , the corresponding bounds are as follows: Real Bounds: f 0 ( σ ) = 0.5 f 1 ( σ ) = 2.0 f 2 ( σ ) = 6.0 f 3 ( σ ) = 6.0 f 3 ( σ , a ) = 6.0 L = 6.0 μ ( σ ) = 6.0 ; Estimated Bounds: f 0 ( σ ) = 1.0 , f 1 ( σ ) = 2.2 , f 2 ( σ ) = 6.3 , f 3 ( σ ) = 6.2 , f 3 ( σ , a ) = 6.2 , L = 6.4 , μ ( σ ) = 6.0 .
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 lim t | θ ˜ ( t ) | , 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 ε = 0.002 ,   a = 0.05 . 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.

4. Conclusions

In this article, an extremum seeking scheme which maximizes the first derivative of an unknown scalar map with constant delays is carried out in which the only available measurements are from the unknown map itself. The gradient of the mapping function’s first derivative is exactly extracted via the proposed demodulation signal. Subsequently, by applying the time-delay approach to averaging, the original ES system is reformulated as a retarded-type model with disturbances. Finally, the stability conditions are rigorously derived using the proposed Lyapunov functional. It is worth mentioning that under the assumption of some known bounds about the nonlinear map, we have obtained a quantitative analysis which is capable of calculating the ultimate seeking error, the upper bounds on the dither period, and the transmission delay that the original system is able to tolerate. Simulation results validate the conclusion from theoretical analysis that the time delay degrades the stability of the proposed system. Moreover, detrimental effects can be effectively mitigated through proper controller gain reduction. Extensions to time-varying delay cases will be explored in future studies.

Author Contributions

Conceptualization, J.L., H.S., and Y.Z.; methodology, J.L., H.S., and Y.Z.; software, J.L.; investigation, J.L.; writing—original draft preparation, J.L.; writing—review and editing, J.L. and Y.Z.; supervision, H.S. and Y.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work was partially supported by Zhejiang R&D Program (Grant No. 2025C01022), National Natural Science Foundation of China (Grant No. 62303410), Zhejiang Provincial Natural Science Foundation of China (Grant No. LQ23F030014), and Open Research Project of State Key Laboratory of Industrial Control Technology, China (Grant No. ICT2025B78, ICT2025B09).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

To begin with, we show the practical stability of the system in (24). By employing
V P ( t ) = P z 2 ( t )
and taking the time derivative of V P ( t ) along the trajectory of system (24), we have
V ˙ P ( t ) + 2 δ V P ( t ) = 2 P z ( t ) z ˙ ( t ) + 2 δ P z 2 ( t ) = 2 P z ( t ) k Φ ( t ) + 8 k a 2 Y 1 ( t ) + 8 k a Y 2 ( t ) + 2 k Y 3 ( t ) + k Y 4 ( t ) 4 3 k a R ( t ) + 2 δ P z 2 ( t ) + 2 k P z ( t ) f ( 2 ) ( θ + z ( t ) ) + f ( 2 ) ( θ + z ( t D ) ) f ( 2 ) ( θ + z ( t ) ) 2 P z ( t ) k Φ ( t ) + 8 k a 2 Y 1 ( t ) + 8 k a Y 2 ( t ) + 2 k Y 3 ( t ) + k Y 4 ( t ) 4 3 k a R ( t ) + 2 δ P z 2 ( t ) 2 k P μ ( σ ) z 2 ( t ) + 2 k P | z ( t ) | · L | z ( t D ) z ( t ) | 2 P | z ( t ) | k | Φ ( t ) | + 8 k a 2 | Y 1 ( t ) | + 8 k a | Y 2 ( t ) | + 2 k | Y 3 ( t ) | + k | Y 4 ( t ) | + 4 3 k a | R ( t ) | + 2 δ P z 2 ( t ) 2 k P μ ( σ ) z 2 ( t ) + 2 k L P | z ( t ) | · t D t z ˙ ( s ) d s ,
in which we utilize the fact that 2 k P z ( t ) f ( 2 ) ( θ + z ( t ) ) 2 k P μ ( σ ) z 2 ( t ) from (3) in Assumption 1.
Moreover, by introducing
V Q ( t ) = Q t D t e 2 δ ( s t ) z 2 ( s ) d s
and taking the derivative of (A3) with respect to t, we can attain
V ˙ Q ( t ) + 2 δ V Q ( t ) = Q z 2 ( t ) Q e 2 δ D z 2 ( t D ) .
Additionally, using
V R ( t ) = R D t D t e 2 δ ( s t ) ( s t + D ) z ˙ 2 ( s ) d s
and taking the time derivative of V R ( t ) , we arrive at
V ˙ R ( t ) + 2 δ V R ( t ) = R D 2 z ˙ 2 ( t ) R D t D t e 2 δ ( s t ) z ˙ 2 ( s ) d s R D 2 z ˙ 2 ( t ) R D e 2 δ D t D t z ˙ 2 ( s ) d s R D 2 z ˙ 2 ( t ) R e 2 δ D t D t z ˙ ( s ) d s 2 ,
where Jensen’s inequality is utilized. On the other hand, under Assumptions 1 and 2, according to f ( 2 ) ( θ ) = 0 and f ( 2 ) ( θ + z ( t D ) ) f ( 2 ) ( θ ) < L | z ( t D ) | we have
0 < λ 1 L 2 z 2 ( t D ) f ( 2 ) 2 ( θ + z ( t D ) ) .
Based on (A1), (A3) and (A5), the Lyapunov functional candidate is selected as below
V ( t ) = V P ( t ) + V Q ( t ) + V R ( t ) .
Combining (A2), (A4), (A6), and (A7), for any t ε + D we arrive at
V ˙ ( t ) + 2 δ V ( t ) + λ 1 L 2 z 2 ( t D ) f ( 2 ) 2 ( θ + z ( t D ) ) λ 2 ε Φ 2 ( t ) λ 3 ε Y 1 2 ( t ) λ 4 ε Y 2 2 ( t ) λ 5 ε Y 3 2 ( t ) λ 6 ε Y 4 2 ( t ) λ 7 a R 2 ( t ) η T ( t ) Ψ η ( t ) + R D 2 z ˙ 2 ( t ) η T ( t ) Ψ η ( t ) + η T ( t ) Ξ R 1 Ξ T η ( t ) < 0 ,
where η ( t ) = c o l z ( t ) , z ( t D ) , t D t z ˙ ( s ) d s , f ( 2 ) ( θ + z ( t D ) ) , Φ ( t ) , Y 1 ( t ) , Y 2 ( t ) , Y 3 ( t ) , Y 4 ( t ) , R ( t ) } , with Ψ and Ξ provided in (31) and (32), respectively. The last inequality of (A9) follows from Ω 0 < 0 , provided in (30) in the sense of the Schur complement.
Based on (27)–(29), the inequality (A9) suggests
V ˙ ( t ) + 2 δ V ( t ) < λ 2 ε Φ 2 ( t ) + λ 3 ε Y 1 2 ( t ) + λ 4 ε Y 2 2 ( t ) + λ 5 ε Y 3 2 ( t ) + λ 6 ε Y 4 2 ( t ) + λ 7 a R 2 ( t ) < λ 2 k 2 f 3 2 ( σ ) Δ F 2 4 ε + λ 3 f 1 2 ( σ ) Δ θ 2 4 ε + λ 4 f 2 2 ( σ ) Δ θ 2 4 ε + λ 5 f 3 2 ( σ ) Δ θ 2 4 ε + λ 6 f 3 2 ( σ ) Δ θ 2 4 ε + λ 7 a Δ R 2 ϖ .
By applying the comparison principle to (A10), the following relation is satisfied for t ε + D :
V ( t ) V ( ε + D ) e 2 δ ( t ε D ) + 1 e 2 δ ( t ε D ) ϖ 2 δ N ( t ) .
Considering (A1), (A8), and the condition P 1 , we have
V ( t ) P z 2 ( t ) z ( t ) 2 .
We subsequently prove the practical stability of (10) and that the assumed overall bound (26) is not violated. Notice that according to the initial condition underneath (6), | θ ˜ ( t ) | σ 0 < σ for all t [ 0 , D ] is satisfied. Based on (27), we obtain
| θ ˜ ( t ) | = θ ˜ ( D ) + D t θ ˜ ˙ ( τ ) d τ < | θ ˜ ( D ) | + Δ θ ( t D ) σ 0 + Δ θ ε , t [ D , ε + D ] .
Equation (A13) corresponds to the first formula in (33), and is ensured by Ω 2 < σ k Δ F 2 ε 2 in (30).
Furthermore, considering (23) and (A12), the following relation is true:
| θ ˜ ( t ) | z ( t ) + k G ( t ) V ( t ) + k G ( t ) < N ( t ) + k Δ F 2 ε , t ε + D ,
which corresponds to the second formula in (33).
It is observed that N ( t ) in (A11) is monotone. From (A14), in order to guarantee that | θ ˜ ( t ) | < N ( t ) + k Δ F 2 ε < σ for all t [ ε + D , ) we need to guarantee the condition at the two boundaries such that
| θ ˜ ( ε + D ) | < V ( ε + D ) + k Δ F 2 ε < σ , lim t | θ ˜ ( t ) | < lim t N ( t ) + k Δ F 2 ε < σ .
According to (23), (28) and (A13), we have
z ( ε + D ) < | θ ˜ ( ε + D ) | + k G ( ε + D ) < σ 0 + Δ θ ε + k Δ F 2 ε ν .
Considering (A1) and (A16), the following relation is satisfied:
V P ( ε + D ) = P z 2 ( ε + D ) = P z ( ε + D ) 2 < P ν 2 .
Similarly, based on (A3) and (A16), we obtain
V Q ( ε + D ) = Q ε ε + D e 2 δ ( s ε D ) z 2 ( s ) d s Q ε ε + D z ( s ) 2 d s < Q D ν 2 .
Combining (A5) with (28), we get
V R ( ε + D ) = R D ε ε + D e 2 δ ( s ε D ) ( s ε ) z ˙ 2 ( s ) d s < R D 2 ε ε + D z ˙ ( s ) 2 d s < R D 3 Δ z 2 .
To ensure that z ( t ) in (A18) and z ˙ ( t ) in (A19) are well-defined at t [ ε , ε + D ] , we supplement the initial condition such that θ ^ ( t ) θ σ 0 , θ + σ 0 for t D , 0 such that | θ ˜ ( t ) | σ 0 < σ for all t [ D , 0 ] . This refers to the fact that the ES controller is turned off and the initial estimate is fixed at some constant for t [ D , 0 ] .
Consequently, by combining (A8) with (A17)–(A19) we obtain the following inequality:
V ( ε + D ) < ( P + Q D ) ν 2 + R D 3 Δ z 2 .
Substituting (A20) into the first row in (A15), the first formula of (A15) is ensured by Ω 2 < σ k Δ F 2 ε 2 in (30). Additionally, the second formula of (A15) is guaranteed by Ω 1 < σ k Δ F 2 ε 2 in (30). Finally, by performing a contradiction argument similar to ([28], Appendix A), it is shown that (30) implies (26). This completes the proof of Theorem 1.

References

  1. Krstić, M.; Wang, H.H. Stability of extremum seeking feedback for general nonlinear dynamic systems. Automatica 2000, 36, 595–601. [Google Scholar] [CrossRef]
  2. Tan, Y.; Nešić, D.; Mareels, I. On non-local stability properties of extremum seeking control. Automatica 2006, 42, 889–903. [Google Scholar] [CrossRef]
  3. Liu, S.J.; Krstić, M. Stochastic Averaging in Continuous Time and Its Applications to Extremum Seeking. IEEE Trans. Autom. Control 2010, 55, 2235–2250. [Google Scholar] [CrossRef]
  4. Yang, L.Y.; Liu, S.J.; Zhang, P.P. Stochastic time-varying extremum seeking and its applications. Automatica 2023, 151, 110923. [Google Scholar] [CrossRef]
  5. Khong, S.Z.; Nešić, D.; Tan, Y.; Manzie, C. Unified frameworks for sampled-data extremum seeking control: Global optimisation and multi-unit systems. Automatica 2013, 49, 2720–2733. [Google Scholar] [CrossRef]
  6. Hazeleger, L.; Nešić, D.; van de Wouw, N. Sampled-data extremum-seeking framework for constrained optimization of nonlinear dynamical systems. Automatica 2022, 142, 110415. [Google Scholar] [CrossRef]
  7. Dürr, H.B.; Stanković, M.S.; Ebenbauer, C.; Johansson, K.H. Lie bracket approximation of extremum seeking systems. Automatica 2013, 49, 1538–1552. [Google Scholar] [CrossRef]
  8. Labar, C.; Ebenbauer, C.; Marconi, L. ISS-like properties in Lie-bracket approximations and application to extremum seeking. Automatica 2022, 136, 110041. [Google Scholar] [CrossRef]
  9. Guay, M.; Vandermeulen, I.; Dougherty, S.; McLellan, P.J. Distributed extremum-seeking control over networks of dynamically coupled unstable dynamic agents. Automatica 2018, 93, 498–509. [Google Scholar] [CrossRef]
  10. Oliveira, T.R.; Krstić, M.; Tsubakino, D. Extremum Seeking for Static Maps with Delays. IEEE Trans. Autom. Control 2017, 62, 1911–1926. [Google Scholar] [CrossRef]
  11. Tsubakino, D.; Oliveira, T.R.; Krstić, M. Extremum seeking for distributed delays. Automatica 2023, 153, 111044. [Google Scholar] [CrossRef]
  12. Tian, Y.; Pan, N.; Hu, M.; Wang, H.; Simeonov, I.; Kabaivanova, L.; Christov, N. Newton-Based Extremum Seeking for Dynamic Systems Using Kalman Filtering: Application to Anaerobic Digestion Process Control. Mathematics 2023, 11, 251. [Google Scholar] [CrossRef]
  13. Truong, H.V.A.; Trinh, H.A.; Do, T.C.; Nguyen, M.H.; Phan, V.D.; Ahn, K.K. An Enhanced Extremum Seeking-Based Energy Management Strategy with Equivalent State for Hybridized-Electric Tramway-Powered by Fuel Cell–Battery–Supercapacitors. Mathematics 2024, 12, 1849. [Google Scholar] [CrossRef]
  14. Solís-Cervantes, C.U.; Palomino-Resendiz, S.I.; Flores-Hernández, D.A.; Peñaloza-López, M.A.; Montelongo-Vazquez, C.M. Design and Implementation of Extremum-Seeking Control Based on MPPT for Dual-Axis Solar Tracker. Mathematics 2024, 12, 1913. [Google Scholar] [CrossRef]
  15. Haring, M.; Skjong, E.; Johansen, T.A.; Molinas, M. Extremum-Seeking Control for Harmonic Mitigation in Electrical Grids of Marine Vessels. IEEE Trans. Ind. Electron. 2019, 66, 500–508. [Google Scholar] [CrossRef]
  16. Scheinker, A. 100 years of extremum seeking: A survey. Automatica 2024, 161, 111481. [Google Scholar] [CrossRef]
  17. Vinther, K.; Lyhne, C.H.; Sørensen, E.B.; Rasmussen, H. Evaporator superheat control with one temperature sensor using qualitative system knowledge. In Proceedings of the 2012 American Control Conference (ACC), Montreal, QC, Canada, 27–29 June 2012; pp. 374–379. [Google Scholar]
  18. Vinther, K.; Rasmussen, H.; Izadi-Zamanabadi, R.; Stoustrup, J. Single temperature sensor superheat control using a novel maximum slope-seeking method. Int. J. Refrig. 2013, 36, 1118–1129. [Google Scholar] [CrossRef]
  19. Ariyur, K.B.; Krstić, M. Slope seeking: A generalization of extremum seeking. Int. J. Adapt. Control Signal Process. 2004, 18, 1–22. [Google Scholar] [CrossRef]
  20. Moase, W.H.; Manzie, C.; Brear, M.J. Newton-Like Extremum-Seeking for the Control of Thermoacoustic Instability. IEEE Trans. Autom. Control 2010, 55, 2094–2105. [Google Scholar] [CrossRef]
  21. Mills, G.; Krstić, M. Maximizing higher derivatives of unknown maps with extremum seeking. In Proceedings of the 2015 54th IEEE Conference on Decision and Control (CDC), Osaka, Japan, 15–18 December 2015; pp. 5648–5653. [Google Scholar]
  22. Mills, G.; Krstić, M. Maximizing higher derivatives of unknown maps with stochastic extremum seeking. In Proceedings of the 2016 American Control Conference (ACC), Boston, MA, USA, 6–8 July 2016; pp. 6097–6102. [Google Scholar]
  23. Mills, G.; Krstić, M. Maximizing Map Sensitivity and Higher Derivatives Via Extremum Seeking. IEEE Trans. Autom. Control 2018, 63, 3232–3247. [Google Scholar] [CrossRef]
  24. Rušiti, D.; Oliveira, T.R.; Mills, G.; Krstić, M. Deterministic and Stochastic Newton-based extremum seeking for higher derivatives of unknown maps with delays. Eur. J. Control 2018, 41, 72–83. [Google Scholar] [CrossRef]
  25. Rušiti, D.; Oliveira, T.R.; Krstić, M.; Gerdts, M. Newton-based extremum seeking of higher-derivative maps with time-varying delays. Int. J. Adapt. Control Signal Process. 2021, 35, 1202–1216. [Google Scholar] [CrossRef]
  26. Rušiti, D.; Oliveira, T.R.; Krstić, M.; Gerdts, M. Robustness to delay mismatch in extremum seeking. Eur. J. Control 2021, 62, 75–83. [Google Scholar] [CrossRef]
  27. Fridman, E.; Zhang, J. Averaging of linear systems with almost periodic coefficients: A time-delay approach. Automatica 2020, 122, 109287. [Google Scholar] [CrossRef]
  28. Zhu, Y.; Fridman, E. Extremum seeking via a time-delay approach to averaging. Automatica 2022, 135, 109965. [Google Scholar] [CrossRef]
  29. Pan, G.; Zhu, Y.; Fridman, E.; Wu, Z. Extremum seeking of general nonlinear static maps: A time-delay approach. Automatica 2024, 166, 111710. [Google Scholar] [CrossRef]
  30. Fridman, E. Introduction to Time-Delay Systems; Birkhauser: Basel, Switzerland, 2014. [Google Scholar]
  31. Zhu, Y.; Krstić, M. Delay-Adaptive Linear Control; Princeton University Press: Princeton, NJ, USA, 2020. [Google Scholar]
  32. Li, J.; Zhu, Y.; Su, H. Extremum Seeking for the First Derivative of Nonlinear Maps: A Time-delay Approach. In Proceedings of the 2024 14th Asian Control Conference (ASCC), Dalian, China, 5–8 July 2024; pp. 672–677. [Google Scholar]
  33. Khalil, H.K. Nonlinear Systems; Prentice-Hall: Upper Saddle River, NJ, USA, 2002. [Google Scholar]
  34. Yang, X.; Fridman, E. Extremum seeking in the presence of large delays via time-delay approach to averaging. arXiv 2023, arXiv:2310.09474. [Google Scholar]
  35. Yang, X.; Fridman, E. A Robust Time-Delay Approach to Continuous-Time Extremum Seeking for Multi-Variable Static Map. In Proceedings of the 2023 62nd IEEE Conference on Decision and Control (CDC), Singapore, 13–15 December 2023; pp. 6768–6773. [Google Scholar]
Figure 1. Extremum seeking for the first derivative of nonlinear maps with delays.
Figure 1. Extremum seeking for the first derivative of nonlinear maps with delays.
Mathematics 13 02196 g001
Figure 2. Numerical simulation results: (a) the map y = f ( θ ) = ( θ 0.5 ) 3 + θ and its first derivative f ( 1 ) ( θ ) = 3 ( θ 0.5 ) 2 + 1 ; (b) the case with k = 0.03 , D = 1 ; (c) the case with k = 0.03 , D = 3.7 ; (d) the case with k = 0.024 , D = 3.7 .
Figure 2. Numerical simulation results: (a) the map y = f ( θ ) = ( θ 0.5 ) 3 + θ and its first derivative f ( 1 ) ( θ ) = 3 ( θ 0.5 ) 2 + 1 ; (b) the case with k = 0.03 , D = 1 ; (c) the case with k = 0.03 , D = 3.7 ; (d) the case with k = 0.024 , D = 3.7 .
Mathematics 13 02196 g002
Table 1. Real bounds case.
Table 1. Real bounds case.
ε δ σ 0 σ DUB
[32]0.00010.030.91.0-0.236
Theorem 10.00010.030.91.01.00.268
[32]0.00020.030.91.0-0.339
Theorem 10.00020.030.91.01.00.385
Table 2. Estimated bounds case.
Table 2. Estimated bounds case.
ε δ σ 0 σ DUB
[32]0.00010.030.91.0-0.329
Theorem 10.00010.030.91.01.00.380
[32]0.00020.030.91.0-0.521
Theorem 10.00020.030.91.01.00.600
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Li, J.; Su, H.; Zhu, Y. Extremum Seeking for the First Derivative of Nonlinear Maps with Constant Delays via a Time-Delay Approach. Mathematics 2025, 13, 2196. https://doi.org/10.3390/math13132196

AMA Style

Li J, Su H, Zhu Y. Extremum Seeking for the First Derivative of Nonlinear Maps with Constant Delays via a Time-Delay Approach. Mathematics. 2025; 13(13):2196. https://doi.org/10.3390/math13132196

Chicago/Turabian Style

Li, Jianzhong, Hongye Su, and Yang Zhu. 2025. "Extremum Seeking for the First Derivative of Nonlinear Maps with Constant Delays via a Time-Delay Approach" Mathematics 13, no. 13: 2196. https://doi.org/10.3390/math13132196

APA Style

Li, J., Su, H., & Zhu, Y. (2025). Extremum Seeking for the First Derivative of Nonlinear Maps with Constant Delays via a Time-Delay Approach. Mathematics, 13(13), 2196. https://doi.org/10.3390/math13132196

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop