The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2015 23rd Mediterranean Conference on Control and Automation (MED) 2015
DOI: 10.1109/med.2015.7158799
|View full text |Cite
|
Sign up to set email alerts
|

Multivariable algebraic loops in linear anti-windup implementations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 38 publications
0
6
0
Order By: Relevance
“…As compared to existing LMI-proposals for anti-windup, the above result provides a convenient way of incorporating not only robustness into the compensation optimization, but also the directional characteristics of the plant through the static matrix H. The optimization is carried out offline to obtain static matrices F and E from which M and hence, the compensators Q 1 and Q 2 are recovered according to (11). An example of its implementation is given is section V. This offline optimization is different from the online LCP implementation (see [22] for a discussion on this).…”
Section: Main Result: Lmi-based Synthesismentioning
confidence: 99%
See 3 more Smart Citations
“…As compared to existing LMI-proposals for anti-windup, the above result provides a convenient way of incorporating not only robustness into the compensation optimization, but also the directional characteristics of the plant through the static matrix H. The optimization is carried out offline to obtain static matrices F and E from which M and hence, the compensators Q 1 and Q 2 are recovered according to (11). An example of its implementation is given is section V. This offline optimization is different from the online LCP implementation (see [22] for a discussion on this).…”
Section: Main Result: Lmi-based Synthesismentioning
confidence: 99%
“…[10], [7], [29]). In [30], we showed that well-posedness is equivalent to the feasibility of a corresponding linear complementarity problem (LCP) for which efficient solution algorithms are well-established (also see [22]). For the proposed framework, the LCP always has a unique solution.…”
Section: Multivariable Algebraic Loop and Well-posednessmentioning
confidence: 99%
See 2 more Smart Citations
“…We show that many existing anti-windup designs correspond to particular implementations of the algebraic loop. Some preliminary results have been presented in [1,3]; here we provide formal proofs of the two main results (Proposition 5 and Proposition 7). In addition we include simulation results which demonstrate both the simplicity of on-line implementation of LCP solvers and the benefits offered by such a generalized framework.…”
Section: Introductionmentioning
confidence: 87%