liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Robust Verification and Identification of Piecewise Affine Systems
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
2001 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

iecewise affine systems constitute an important subclass of hybrid systems, and consist of several affine dynamic subsystems, between which switchings occur at different occasions. As for hybrid systems in general, there has been a growing interest for piecewise affine systems in recent years, and they occur in many application areas.

In many cases, safety is an important issue, and there is a need for tools that prove that certain states are never reached, or that some states are reached in finite time. The process of proving these kinds of statements is called verification. Many verification tools for hybrid systems have emerged in the last ten years. They all depend on a model of the system, which will in practice be an approximation of the real system. Therefore it would be desirable to learn how large the model errors can be, before the verification is not valid anymore. In this thesis, a verification method for piecewise affine systems is presented, where bounds on the allowed model errors are given along with the verification.

Apart from being necessary for verification, system models are needed for various control, stability analysis, and fault detection tools. Hence, identification of piecewise affine systems is an important area. Here, an overview of different approaches appearing in the literature is presented, and a new identification method based on mixed-integer programming is proposed. One notable property of the latter method is that the global optimum is guaranteed to be found within a finite number of steps. The complexity of the mixed-integer programming approach is discussed, and its relations to existing approaches are pointed out. The special case of identification of Wiener models is considered in detail, since that model structure makes it possible to reduce the computational complexity. A combination of the mixed-integer programming approach and a local minimisation approach is also investigated.

Place, publisher, year, edition, pages
Linköping: Linköping University , 2001. , 116 p.
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 899
Keyword [en]
Piecewise affine systems, Verification, Robustness, Identification, Mixed-integer programming
National Category
Control Engineering
URN: urn:nbn:se:liu:diva-98159Local ID: LIU-TEK-LIC-2001:36ISBN: 91-7373-101-3OAI: diva2:652300
Available from: 2013-10-09 Created: 2013-09-30 Last updated: 2013-10-09Bibliographically approved

Open Access in DiVA

No full text

By organisation
Automatic ControlThe Institute of Technology
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 47 hits
ReferencesLink to record
Permanent link

Direct link