Nonsmooth High-Order Averaging Theory with Application to Extremum Seeking Optimization and Control
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914620623552512 |
|---|---|
| author | Abdelfattah, Hesham Eisa, Sameh A. Stechlinski, Peter |
| author_facet | Abdelfattah, Hesham Eisa, Sameh A. Stechlinski, Peter |
| contents | In this paper, we introduce a higher-order averaging theory and method for a wide range of nonsmooth systems that are generally characterized by the classical averaging canonical form. Utilizing tools from generalized derivatives theory, we provide a nonsmooth near-identity transformation analogous to the one in smooth averaging theory. Additionally, we exploit sharp calculus rules from lexicographic differentiation theory to provide a closed formula for nonsmooth first-order averaging, and for the first time in the literature, nonsmooth second-order averaging. In fact, our approach recovers the smooth averaging results, without needing to check, if the system under consideration is smooth. Equipped with a nonsmooth second-order averaging theory, we generalize literature results and introduce a class of control-affine extremum seeking systems that tolerate nonsmoothness in the vector fields and/or the objective function by analyzing its stability based on a closed formula analogous to first-order Lie bracket approximations available in the smooth literature. We provide numerical simulation results involving complicated nonsmooth functions to demonstrate the effectiveness of our approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2606_00969 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Nonsmooth High-Order Averaging Theory with Application to Extremum Seeking Optimization and Control Abdelfattah, Hesham Eisa, Sameh A. Stechlinski, Peter Optimization and Control Differential Geometry Dynamical Systems In this paper, we introduce a higher-order averaging theory and method for a wide range of nonsmooth systems that are generally characterized by the classical averaging canonical form. Utilizing tools from generalized derivatives theory, we provide a nonsmooth near-identity transformation analogous to the one in smooth averaging theory. Additionally, we exploit sharp calculus rules from lexicographic differentiation theory to provide a closed formula for nonsmooth first-order averaging, and for the first time in the literature, nonsmooth second-order averaging. In fact, our approach recovers the smooth averaging results, without needing to check, if the system under consideration is smooth. Equipped with a nonsmooth second-order averaging theory, we generalize literature results and introduce a class of control-affine extremum seeking systems that tolerate nonsmoothness in the vector fields and/or the objective function by analyzing its stability based on a closed formula analogous to first-order Lie bracket approximations available in the smooth literature. We provide numerical simulation results involving complicated nonsmooth functions to demonstrate the effectiveness of our approach. |
| title | Nonsmooth High-Order Averaging Theory with Application to Extremum Seeking Optimization and Control |
| topic | Optimization and Control Differential Geometry Dynamical Systems |
| url | https://arxiv.org/abs/2606.00969 |