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

Unified frameworks for sampled-data extremum seeking control: Global optimisation and multi-unit systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
66
0
3

Year Published

2016
2016
2021
2021

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 93 publications
(70 citation statements)
references
References 23 publications
0
66
0
3
Order By: Relevance
“…For example, this could be done following the same approach but with a different robust nonlinear controller, obtained from the multiplicative fault tolerant controller proposed in [21]. Another improvement direction could target the convergence rate and domain of attraction of the auto-tuning algorithm, for example, by using different ES algorithms with semi-global convergence properties, [29,38,39]. Furthermore, we saw that the ES-based IFT proposed here requires less experiments per learning iteration compared with the available IFT algorithms, which require a number of experiments that is directly proportional to the number of tuned gains.…”
Section: Resultsmentioning
confidence: 99%
“…For example, this could be done following the same approach but with a different robust nonlinear controller, obtained from the multiplicative fault tolerant controller proposed in [21]. Another improvement direction could target the convergence rate and domain of attraction of the auto-tuning algorithm, for example, by using different ES algorithms with semi-global convergence properties, [29,38,39]. Furthermore, we saw that the ES-based IFT proposed here requires less experiments per learning iteration compared with the available IFT algorithms, which require a number of experiments that is directly proportional to the number of tuned gains.…”
Section: Resultsmentioning
confidence: 99%
“…Lyapunov function based stability analysis established in [27] and extremum seeking algorithms in [28], to justify the modular design method for ILC-MPC proposed in [29], where an ES-based modular approach to design ILC-MPC schemes for a class of constrained linear systems is proposed.…”
Section: The Main Contribution Of This Work Is To Present a Rigorous mentioning
confidence: 99%
“…The technique is related to other methods previously adopted for parameter tuning [2], [10], in which however the goal is to optimise the performance and/or identify the parameters, while in the plant tuning problem the only aim is to reach the target output. It is also worth mentioning that the goal of driving the output to a desired value could be cast in terms of minimizing the norm of the error and faced as an extremum-seeking problem [15], [18], [20]. There are also interesting connections with robust optimization (see [4] for an extensive survey).…”
Section: Ggiordano@tudelftnlmentioning
confidence: 99%
“…Theorem 2: Given system (19), consider the control v = v * (y) as in (11) and assume it satisfies the bound (12) for the static problem, where ξ > 0 is a decision variable. Let ν be defined as in (15) and µ as in (21). Then, the closed-loop dynamic model is stable if…”
Section: Non-static Plantsmentioning
confidence: 99%