Geometric computation of value set boundaries

Show full item record

Redirect: RIT Scholars content from RIT Digital Media Library has moved from to RIT Scholar Works, please update your feeds & links!
Title: Geometric computation of value set boundaries
Author: Cockburn, Juan; Lopez, Mario
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 extrema1 segments of the plant. The advantage of this approach is that, when the uncertainty is affine, it preserves the geometric parameterizations of value set boundaries. The effectiveness of this procedure is illustrated in the computation of value sets of affine uncertain plants.
Description: Proceedings of the American Control Conference, Chicago, Illinoi, June 2000.
Record URI:
Date: 2000-06

Files in this item

Files Size Format View
JCockburnConfProc06-2000.pdf 529.9Kb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML

Advanced Search