2014
DOI: 10.1109/tac.2014.2314519
|View full text |Cite
|
Sign up to set email alerts
|

Quadratically Parameterized Root Locus Analysis

Abstract: Classical affine root locus applies to controllers that are linear in a parameter k and yield affinely parameterized closed-loop denominator polynomials. This paper presents root locus rules for controllers that are rational in k and yield quadratically parameterized closed-loop denominator polynomials. We show that the quadratic root locus has several advantages relative to the classical affine root locus. Specifically, the quadratic root locus is high-parameter stabilizing for minimum-phase systems that are … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…Nowadays, the analysis of the robust quality of control systems with interval parameters is also of great practical importance. There are some well‐known works where the root approach is proposed as the solution to the problem [27, 29, 31, 37–51]. It is worth mentioning that the proposed approach is quite simple and obvious for a designer.…”
Section: Introductionmentioning
confidence: 99%
“…Nowadays, the analysis of the robust quality of control systems with interval parameters is also of great practical importance. There are some well‐known works where the root approach is proposed as the solution to the problem [27, 29, 31, 37–51]. It is worth mentioning that the proposed approach is quite simple and obvious for a designer.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, the QRL has attracted the attention of some control researchers. In Wellman and Hoagg (2014), the asymptote rules of the QRL are derived by exploiting the Newton's binomial formula and making an asymptotic approximation of the geometric locus with the big O notation. The inconvenience of that approach is that the proof is very long (five pages), obscure and intricate.…”
Section: Introductionmentioning
confidence: 99%