Skip to Main Content
This paper adapts the so-called Shubert algorithm for Extremum Seeking Control (ESC) to seek the global extremum (in presence of local extrema) of general dynamic plants. Different from derivative based methods that are widely used in ESC, the Shubert algorithm is a good representative of sampling optimization methods. With knowledge of the Lipschitz constant of an unknown static mapping, this deterministic algorithm seeks the global extremum. By introducing “waiting time” the proposed Shubert algorithm-based global extremum seeking guarantees the semi-global practical convergence (in the initial states) to the global extremum if compact sets of inputs are considered. Several numerical examples demonstrate how proposed method may be successfully deployed.
Date of Conference: 10-13 Dec. 2012