Operating system

Stability (learning theory)

Machine learning

Quadratic equation

Mathematical analysis

Artificial intelligence

Programming language

Geometry

Control (management)

Constant (computer programming)

Constructive

Computer vision

Mathematics

Computer science

Control theory (sociology)

Dither

Upper and lower bounds

Noise shaping

Process (computing)

IEEE Transactions on Automatic Control

This article proposes a constructive method for sampled-data extremum seeking (ES) with square wave dithers and constant delays, by using two time-delay approaches: one to averaging and the other to sampled-data control. We consider gradient-based ES for static maps which are of quadratic forms. By transforming the ES system to the time-delay system, we have developed a stability analysis via a Lyapunov–Krasovskii method. We derive the practical stability conditions in terms of linear matrix inequalities for the resulting time-delay system. The time-delay approach offers a quantitative calculation on the upper bound of the dither and sampling periods, constant delays that the ES system is able to tolerate, as well as the ultimate bound of the extremum seeking error. This is in the presence of uncertainties of extremum value and extremum point.

Sampled-Data Extremum Seeking With Constant Delay: A Time-Delay Approach