Stability analysis of discrete-time piecewise-affine systems over non-invariant domains

Matteo Rubagotti, Luca Zaccarian, Alberto Bemporad

2012

Closed access Metadata (CSL-JSON)
DOI 10.1109/cdc.2012.6426761
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

This paper analyzes stability of discrete-time piecewise-affine systems defined on non-invariant domains. An algorithm based on linear programming is proposed, in order to prove the exponential stability of the origin and to find a positively invariant estimate of the region of attraction. The theoretical results are based on the definition of a piecewise-affine, possibly discontinuous, Lyapunov function. The proposed method presents a relatively low computational burden, and is proven to lead to feasible solutions in a broader range of cases with respect to a previously proposed approach.