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

Matteo Rubagotti, Luca Zaccarian, Alberto Bemporad

Research output: Contribution to journalConference article

6 Citations (Scopus)

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.

Original languageEnglish
Article number6426761
Pages (from-to)4235-4240
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
DOIs
Publication statusPublished - Dec 1 2012
Event51st IEEE Conference on Decision and Control, CDC 2012 - Maui, HI, United States
Duration: Dec 10 2012Dec 13 2012

Fingerprint

Piecewise Affine Systems
Lyapunov functions
Exponential Stability
Asymptotic stability
Lyapunov Function
Linear programming
Stability Analysis
Discrete-time
Invariant
Estimate
Range of data

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modelling and Simulation
  • Control and Optimization

Cite this

Stability analysis of discrete-time piecewise-affine systems over non-invariant domains. / Rubagotti, Matteo; Zaccarian, Luca; Bemporad, Alberto.

In: Proceedings of the IEEE Conference on Decision and Control, 01.12.2012, p. 4235-4240.

Research output: Contribution to journalConference article

@article{b86850b515334c638c6714ff2fac15a9,
title = "Stability analysis of discrete-time piecewise-affine systems over non-invariant domains",
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.",
author = "Matteo Rubagotti and Luca Zaccarian and Alberto Bemporad",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/CDC.2012.6426761",
language = "English",
pages = "4235--4240",
journal = "Proceedings of the IEEE Conference on Decision and Control",
issn = "0191-2216",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

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

AU - Rubagotti, Matteo

AU - Zaccarian, Luca

AU - Bemporad, Alberto

PY - 2012/12/1

Y1 - 2012/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84874254081&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874254081&partnerID=8YFLogxK

U2 - 10.1109/CDC.2012.6426761

DO - 10.1109/CDC.2012.6426761

M3 - Conference article

SP - 4235

EP - 4240

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

SN - 0191-2216

M1 - 6426761

ER -