DocumentCode
2537451
Title
Geometric computation of value set boundaries
Author
Cockburn, Juan C. ; Lopez, Mario A.
Author_Institution
Dept. of Electr. Eng., FAMU-FSU, Tallahassee, FL, USA
Volume
6
fYear
2000
fDate
2000
Firstpage
4326
Abstract
In this paper a general algorithm to find the boundaries of value sets bounded by elliptic arcs is developed. This algorithm uses a generalized line-sweep search procedure to extract the value set boundary from a set of generalized polygons describing the image of the bounding set or the extremal segments of the plant. The advantage of this approach is that, when the uncertainty is affine, it preserves the geometric parametrizations of value set boundaries. The effectiveness of this procedure is illustrated in the computation of value sets of affine uncertain plants
Keywords
feedback; linear systems; robust control; search problems; set theory; transfer functions; uncertain systems; elliptic arcs; geometric parametrizations; linear time invariant systems; polygons; qualitative feedback theory; robust control; search problem; transfer function; uncertain systems; value set boundaries; Computer science; Control system analysis; Damping; Frequency domain analysis; Mathematics; Robust control; Springs; Transfer functions; Uncertainty; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference, 2000. Proceedings of the 2000
Conference_Location
Chicago, IL
ISSN
0743-1619
Print_ISBN
0-7803-5519-9
Type
conf
DOI
10.1109/ACC.2000.877038
Filename
877038
Link To Document