Reducing the wrapping effect of set computation via Delaunay triangulation for guaranteed state estimation of nonlinear discrete-time systems

Abstract

AbstractSet computation methods have been widely used to compute reachable sets, design invariant sets and estimate system state for dynamic systems. The wrapping effect of such set computation methods plays an essential role in the accuracy of their solutions. This paper studies the wrapping effect of existing interval, zonotopic and polytopic set computation methods and proposes novel approaches to reduce the wrapping effect for these set computation methods based on the task of computing the dynamic evolution of a nonlinear uncertain discrete-time system with a set as the initial state. The proposed novel approaches include the partition of a polytopic set via Delaunay triangulation and also the representation of a polytopic set by the union of small zonotopes for the following set propagation. The proposed novel approaches with the reduced wrapping effect has been further applied to state estimation of a nonlinear uncertain discrete-time system with improved accuracy. Similar to bisection for interval and zonotopic sets, Delaunay triangulation has been introduced as a set partition tool for polytopic sets, which has opened new research directions in terms of novel set partition, set representation and set propagation for reducing the wrapping effect of set computation.