Higher-order Lie bracket approximation and averaging of control-affine systems with application to extremum seeking
Sameer Pokhrel, Sameh A. Eisa

TL;DR
This paper unifies averaging and approximation theories for control-affine systems using higher-order Lie brackets and demonstrates improved extremum seeking performance through higher-order analysis.
Contribution
It introduces a general, rigorous framework for higher-order Lie bracket approximations using chronological calculus, extending existing theories without many previous assumptions.
Findings
Higher-order Lie bracket approximations are equivalent to higher-order averaging.
The framework reduces to known first and second-order cases.
Numerical simulations show improved extremum seeking convergence rates.
Abstract
This paper provides a rigorous derivation for what is known in the literature as the Lie bracket approximation of control-affine systems in a more general and sequential framework for higher-orders. In fact, by using chronological calculus, we show that said Lie bracket approximations can be derived, and considered, as higher-order averaging terms. Hence, the theory provided in this paper unifies both averaging and approximation theories of control-affine systems. In particular, the Lie bracket approximation of order () turns out to be a higher-order averaging of order (). The derivation and formulation provided in this paper can be directly reduced to the first and second-order Lie bracket approximations available in the literature. However, we do not need to make many of the assumptions that were needed/provided in the literature and show that they are in fact natural…
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.
