.png){kind=icon}
.png){kind=icon}
Return
Data-enabled extremum seeking: A cooperative concurrent learning-based approach
.png){kind=icon}
OA
AI
DOI：10.1002/acs.3189.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces a new class of feedback-based data-driven extremum seeking algorithms for the solution of model-free optimization problems in smooth continuous-time dynamical systems. The novelty of the algorithms lies on the incorporation of memory to store recorded data that enables the use of information-rich datasets during the optimization process, and allows to dispense with the time-varying dither excitation signal needed by standard extremum seeking algorithms that rely on a persistence of excitation (PE) condition. The model-free optimization dynamics are developed for single-agent systems, as well as for multi-agent systems with communication graphs that allow agents to share their state information while preserving the privacy of their individual data. In both cases, sufficient richness conditions on the recorded data, as well as suitable optimization dynamics modeled by ordinary differential equations are characterized in order to guarantee convergence to a neighborhood of the solution of the extremum seeking problems. The performance of the algorithms is illustrated via different numerical examples in the context of source-seeking problems in multivehicle systems.
Keywords:
concurrent learning
data‐ driven optimization
extremum seeking
multi‐ agent systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
2.6K
Citations:
3.6K
Organization
View more organizations