Discrete-time extremum seeking algorithms

Abstract

In this paper, we propose three kinds of discrete-time extremum seeking control algorithms. As the static map from the setpoint to the cost function can be approximately represented by a polynomial, the extremum can be easily found according to the polynomial. In the first algorithm, the extremum seeking control is realized by the least square estimation method. In the second and third algorithms, the extremum point is estimated by approximating the static map as a parabola and an ellipse, respectively. The simulation results show the feasibility of the proposed algorithms.