A new extremum seeking design using high-order Lie bracket approximations achieves exponential convergence for polynomial-like cost functions of degree >2 without requiring Hessian information at the minimum.
Obstacle avoidance problem for second degree nonholonomic systems,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Extremum seeking with exponential convergence via high-order Lie bracket approximations
A new extremum seeking design using high-order Lie bracket approximations achieves exponential convergence for polynomial-like cost functions of degree >2 without requiring Hessian information at the minimum.