Abstract

Piecewise affine (PWA) systems are powerful models for describing both non-linear and hybrid systems. One of the key problems in controlling these systems is the inherent computational complexity of controller synthesis and analysis, especially if constraints on states and inputs are present. In addition, few results are available which address the issue of computing stabilizing controllers for PWA systems without placing constraints on the location of the origin. This paper first introduces a method to obtain stability guarantees for receding horizon control of discrete-time PWA systems. Based on this result, two algorithms which provide low complexity state feedback controllers are introduced. Specifically, we demonstrate how multi-parametric programming can be used to obtain minimum-time controllers, i.e., controllers which drive the state into a pre-specified target set in minimum time. In a second segment, we show how controllers of even lower complexity can be obtained by separately dealing with constraint satisfaction and stability properties. To this end, we introduce a method to compute PWA Lyapunov functions for discrete-time PWA systems via linear programming. Finally, we report results of an extensive case study which justify our claims of complexity reduction.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.