2014
DOI: 10.1016/j.automatica.2014.10.030
|View full text |Cite
|
Sign up to set email alerts
|

Discrete-time extremum-seeking for Wiener–Hammerstein plants

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 15 publications
(5 citation statements)
references
References 20 publications
0
5
0
Order By: Relevance
“…In this paper, we use an adapted version of the discrete‐time ESC due to Shekhar et al. , which is an effective and easy to tune version of ESC. Our version of the algorithm in Shekhar et al .…”
Section: Extremum Seeking Controlmentioning
confidence: 99%
See 4 more Smart Citations
“…In this paper, we use an adapted version of the discrete‐time ESC due to Shekhar et al. , which is an effective and easy to tune version of ESC. Our version of the algorithm in Shekhar et al .…”
Section: Extremum Seeking Controlmentioning
confidence: 99%
“…, which is an effective and easy to tune version of ESC. Our version of the algorithm in Shekhar et al . has been implemented in our code UTD‐WF.…”
Section: Extremum Seeking Controlmentioning
confidence: 99%
See 3 more Smart Citations