By Topic

Geometric computation of value set boundaries

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cockburn, J.C. ; Dept. of Electr. Eng., FAMU-FSU, Tallahassee, FL, USA ; Lopez, M.A.

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

Published in:

American Control Conference, 2000. Proceedings of the 2000  (Volume:6 )

Date of Conference: