Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) 2001
DOI: 10.1109/acc.2001.945716
|View full text |Cite
|
Sign up to set email alerts
|

Stabilizing a class of time delay systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2009
2009
2013
2013

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…The stabilization of a control system involves finding the zero distribution of its characteristic polynomial. It is relatively easy to study a delay-free system because of its finite number of zeros [3][4][5][6], while that of a time-delay system is somewhat difficult on account of its infinite number of zeros [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21]. It was Pontryagin [22] who originally studied and presented the necessary and sufficient conditions for the stability of certain classes of quasi-polynomials.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The stabilization of a control system involves finding the zero distribution of its characteristic polynomial. It is relatively easy to study a delay-free system because of its finite number of zeros [3][4][5][6], while that of a time-delay system is somewhat difficult on account of its infinite number of zeros [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21]. It was Pontryagin [22] who originally studied and presented the necessary and sufficient conditions for the stability of certain classes of quasi-polynomials.…”
Section: Introductionmentioning
confidence: 99%
“…So far, two categories of approaches have been proposed to compute such a stabilizing region. One category, which is based on Tsypkins results and the generalized Nyquist criterion [6][7][8][9], on the concept of singular frequencies [10][11][12], or on a generalized Hermite-Biehler theorem [13][14][15][16], calculates the feasible k p-intervals first, then constructs the (ki, kd) region for a fixed kp. The other category, based on the boundary crossing theorem and D-decomposition theory [17][18][19], constructs the (kp, kd) or (kp, ki) region of a fixed ki or kd in given intervals.…”
Section: Introductionmentioning
confidence: 99%