DocumentCode :
300878
Title :
A continuous knapsack problem formulation for the robustness analysis of a polytope of polynomials
Author :
Cerone, V. ; Croce, F.D.
Author_Institution :
Dipartimento di Autom. e Inf., Politecnico di Torino, Italy
Volume :
5
fYear :
1995
fDate :
21-23 Jun 1995
Firstpage :
3856
Abstract :
The problem of checking robust stability of a polytope of polynomials is equivalent to a zero exclusion condition at each frequency. In this paper, we show that this problem can be formulated as two continuous knapsack problems with bounded variables, which are solvable in 𝒪(n) time
Keywords :
computational complexity; control system analysis; operations research; polynomials; robust control; continuous knapsack problem formulation; polynomials polytope; robust stability; robustness analysis; zero exclusion condition; Computational complexity; Frequency; Polynomials; Robust stability; Robustness; Uncertainty;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
American Control Conference, Proceedings of the 1995
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-2445-5
Type :
conf
DOI :
10.1109/ACC.1995.533863
Filename :
533863
Link To Document :
بازگشت