arXiv (All)
open access
Combining Exponential and Polynomial Convergence Rates for Accelerated Extremum Seeking: A High-Order Lie Bracket Approach
In this paper, we leverage the recently developed general higher-order Lie bracket approximation theory and framework for control-affine systems to show that we can design extremum seeking (ES) systems that combine flows based on: (i) first-order Lie bracket approximation, which provide an exponenti
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimal, and approximately optimal, quantum strategies for $\mathrm{XOR}^{*}$ and $\mathrm{FFL}$ games#670265
- Optimal, and approximately optimal, quantum strategies for $\mathrm{XOR}^{*}$ and $\mathrm{FFL}$ games#668200
- StructRL: Online Structured Reinforcement Learning for Long-Horizon Vision-Language-Action Tasks#1131194
- Action mathematics#1331940
- Square Root Gauss-Newton iLQR#1035023
Record · ID 1402627
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive