2022
DOI: 10.1109/lcsys.2021.3050451
|View full text |Cite
|
Sign up to set email alerts
|

Extremum Seeking Under Persistent Gradient Deception: A Switching Systems Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…For unconstrained optimization problems, it has been shown in [22,Section 5.2] and [45] that switched ES algorithms are stable when each mode is stable and the switching is sufficiently slow. The novelty of Theorem 3 lies in the incorporation of constraints into the switched zeroth-order dynamics via projection maps.…”
Section: Switching Objective Functionsmentioning
confidence: 99%
“…For unconstrained optimization problems, it has been shown in [22,Section 5.2] and [45] that switched ES algorithms are stable when each mode is stable and the switching is sufficiently slow. The novelty of Theorem 3 lies in the incorporation of constraints into the switched zeroth-order dynamics via projection maps.…”
Section: Switching Objective Functionsmentioning
confidence: 99%
“…4,5 In addition, the HJB (Hamilton-Jacobi-Bellman) equation for the switched system is a nonlinear difference or differential equation with multiple variables, and it is very difficult to obtain an analytical solution for solving such this equation. Although some methods have been proposed in the literature [6][7][8] to solve the optimal constrained control problem of the linear switched systems, these methods cannot be directly used to solve the optimal control problem of the nonlinear switched systems.…”
Section: Introductionmentioning
confidence: 99%