Lie bracket approximation of extremum seeking systems

From MaRDI portal
Publication:522782

DOI10.1016/J.AUTOMATICA.2013.02.016zbMATH Open1360.93200arXiv1109.6129OpenAlexW2166003201WikidataQ60432177 ScholiaQ60432177MaRDI QIDQ522782FDOQ522782


Authors: Hans-Bernd Dürr, Miloš S. Stanković, Christian Ebenbauer, Karl Henrik Johansson Edit this on Wikidata


Publication date: 19 April 2017

Published in: Automatica (Search for Journal in Brave)

Abstract: Extremum seeking feedback is a powerful method to steer a dynamical system to an extremum of a partially or completely unknown map. It often requires advanced system-theoretic tools to understand the qualitative behavior of extremum seeking systems. In this paper, a novel interpretation of extremum seeking is introduced. We show that the trajectories of an extremum seeking system can be approximated by the trajectories of a system which involves certain Lie brackets of the vector fields of the extremum seeking system. It turns out that the Lie bracket system directly reveals the optimizing behavior of the extremum seeking system. Furthermore, we establish a theoretical foundation and prove that uniform asymptotic stability of the Lie bracket system implies practical uniform asymptotic stability of the corresponding extremum seeking system. We use the established results in order to prove local and semi-global practical uniform asymptotic stability of the extrema of a certain map for multi-agent extremum seeking systems.


Full work available at URL: https://arxiv.org/abs/1109.6129




Recommendations




Cites Work


Cited In (44)





This page was built for publication: Lie bracket approximation of extremum seeking systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522782)