Loading [a11y]/accessibility-menu.js
Discrete-time extremum seeking algorithms | IEEE Conference Publication | IEEE Xplore

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 ...Show More

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.
Date of Conference: 08-10 May 2002
Date Added to IEEE Xplore: 07 November 2002
Print ISBN:0-7803-7298-0
Print ISSN: 0743-1619
Conference Location: Anchorage, AK, USA

References

References is not available for this document.