Cart (Loading....) | Create Account
Close category search window
 

On the construction of invariant sets for piecewise affine systems using the transition graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Benlaoukli, H. ; Autom. Control Dept., SUPELEC, Gif-sur-Yvette, France ; Hovd, M. ; Olaru, S. ; Boucher, P.

The present paper introduces an algorithmic construction of the maximal invariant set for a PWA (piecewise affine) system. The classical analysis of this type of dynamical systems is based on the construction of a Lyapunov function which lead subsequently to the invariant set description by means of the Lyapunov function level sets. As an alternative, expansive/contractive schemes exploit the global one-step forward/backward evolution of the system dynamics in order to obtain the invariant set as a fixed point of the set iterates. Both approaches address the problem of finding an invariant set from a global point of view, and therefore result in very demanding computations. The conditions under which the resulting invariant sets are finitely determined are not clear. The approach proposed in this paper is different in the sense that each polyhedral region is treated separately considering only the infinite-time endogenous (by the same region of the state space) transitions, providing (at least from a local point of view) clear conditions on the finite determinedness. In order to address with the global behavior, a transition graph between local piecewise descriptions is used.

Published in:

Control and Automation, 2009. ICCA 2009. IEEE International Conference on

Date of Conference:

9-11 Dec. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.