Verifying Provable Stability Domains for Discrete-Time Systems Using Ellipsoidal State Enclosures

Stability contractors, based on interval analysis, were introduced in recent work as a tool to verify stability domains for nonlinear dynamic systems. These contractors rely on the property that - in case of provable asymptotic stability - a finitely large domain in a multi-dimensional state space is mapped into its interior after a certain integration time for continuous-time processes or after a certain number of discretization steps in a discrete-time setting. However, a disadvantage of the use of axis-aligned interval boxes in such computations is the omnipresent wrapping effect. As shown in this contribution, the replacement of classical interval representations by ellipsoidal domain enclosures reduces this undesirable effect. It also helps to find suitable ratios for the edge lengths if interval-based domain representations are investigated. Moreover, ellipsoidal domains naturally represent the possible regions of attraction of asymptotically stable equilibrium points that can be analyzed with the help of quadratic Lyapunov functions, for which stability criteria can be cast into linear matrix inequality (LMI) constraints. For that reason, this paper further presents possible interfaces of ellipsoidal enclosure techniques with LMI approaches. This combination aims at the maximization of those domains that can be proven to be stable for a discrete-time range-only localization algorithm in robotics. There, an Extended Kalman Filter (EKF) is applied to a system for which the dynamics are characterized by a discrete-time integrator disturbance model with additive Gaussian noise. In this scenario, the measurement equations correspond to the distances between the object to be localized and beacons with known positions.