Convex set theoretic adaptor control systems

Set theoretic adaptor control (STAC) systems employ a set theoretic concept in their problem formulations, which provides them with many unique properties. Among others, the most prominent one is the guarantee of achieving performance within a finite time. To be able to work, STAC systems need to keep track of a set formed by intersection of many other sets, called information sets. The exact representation of such intersection is quite challenging. Although it is possible to approximate the intersection by using discrete points chosen from its boundary, a large amount of memory may be required. This paper investigates the conditions under which ellipsoidal information sets can be obtained so that the more compact results for approximation of intersection of ellipsoids can possibly be incorporated with STAC schemes making them more attractive in practical applications