2000 character limit reached
Extremum Seeking with High-Order Lie Bracket Approximations: Achieving Exponential Decay Rate
Published 1 Apr 2025 in math.OC and math.DS | (2504.01136v2)
Abstract: This paper focuses on the further development of the Lie bracket approximation approach for extremum seeking systems. Classical results in this area provide extremum seeking algorithms with exponential convergence rates for quadratic-like cost functions, and polynomial decay rates for cost functions of higher degrees. This paper proposes a novel control design approach that ensures the motion of the extremum seeking system along directions associated with higher-order Lie brackets, thereby ensuring exponential convergence for cost functions that are polynomial-like but with degree greater than two.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.