A dither-free extremum-seeking control approach using 1st-order least-squares fits for gradient estimation
Authors:
- 1 December 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01912216,p. 2679-2684
Abstract
In this paper, we present a novel type of extremum-seeking controller, which continuously uses past data of the performance map to estimate the gradient of this performance map by means of a 1st-order least squares fit. The approach is intuitive by nature and avoids the need of dither in the extremum-seeking loop. The avoidance of dither allows for an asymptotic stability result (opposed to practical stability in dither-based schemes) and, hence, for exact convergence to the performance optimal parameter. Additionally, the absence of dither eliminates one of the time-scales of classical extremum-seeking schemes, allowing for a possibly faster convergence. A stability proof is presented for the static-map setting which relies on a Lyapunov-Razumikhin type of proof for time-delay systems. Simulations illustrate the effectiveness of the approach also for the dynamic setting.Keywords
This publication has 8 references indexed in Scilit:
- Lyapunov-based switched extremum seeking for photovoltaic power maximizationControl Engineering Practice, 2013
- Multidimensional global extremum seeking via the DIRECT optimisation algorithmAutomatica, 2013
- On a shubert algorithm-based global Extremum Seeking Scheme2012
- Peak-seeking control using gradient and Hessian estimates2010
- Newton-like extremum-seeking part I: Theory2009
- On non-local stability properties of extremum seeking controlAutomatica, 2006
- Real‐Time Optimization by Extremum‐Seeking Control2003
- Stability of extremum seeking feedback for general nonlinear dynamic systemsAutomatica, 2000