Description

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.

Date of creation, presentation, or exhibit

2000

Comments

Proceedings of the American Control Conference, Chicago, Illinoi, June 2000. Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.

Document Type

Conference Proceeding

Department, Program, or Center

Computer Engineering (KGCOE)

Campus

RIT – Main Campus

Share

COinS