A novel and efficient order reduction for both constrained convex generators and constrained zonotopes

A central challenge with any reachability technique is the growth over time of the data structures that store the set-valued estimates. There are various techniques established for Constrained Zonotopes (CZ), although their computational complexity represents a limiting factor on the size of the set descriptions when running the methods in real-time. Thus, when running a guaranteed state observer to estimate the state of a dynamical system using CZs, the number of generators and constraints has to be maintained small such that the order reduction procedures can be run within the sampling time. This paper resorts to using ellipsoids for portions of the set description, which results in a computationally efficient method for a particular class of constrained Convex Generators (CCGs) that can also be used for ellipsotopes and CZs. Our approach is shown to have comparable performance and in some cases outperforms existing methods for Constrained Zonotopes. We provide numerical examples to illustrate the advantages of our proposed approach, particularly in the context of guaranteed state estimation.