Accelerating Extremum Seeking Convergence by Richardson Extrapolation Methods
Jan-Henrik Metsch, Jonathan Neuhauser, Jerome Jouffroy, Taous-Meriem, Laleg-Kirati, Johann Reger

TL;DR
This paper introduces a method to accelerate the convergence of extremum seeking loops by analyzing their dynamics and applying Richardson extrapolation, enabling faster identification of the system's optimal point.
Contribution
It presents a novel approach to speed up extremum seeking convergence using Richardson extrapolation based on dynamic analysis of ES loops.
Findings
Accelerated convergence demonstrated through theoretical analysis.
Structural information extraction from ES loop dynamics.
Faster limit estimation without waiting for full convergence.
Abstract
In this paper, we propose the concept of accelerated convergence that has originally been developed to speed up the convergence of numerical methods for extremum seeking (ES) loops. We demonstrate how the dynamics of ES loops may be analyzed to extract structural information about the generated output of the loop. This information is then used to distil the limit of the loop without having to wait for the system to converge to it.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsExtremum Seeking Control Systems · Advanced Fiber Laser Technologies · Laser Design and Applications
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
