Abstract
In this paper, we derive the irredundant lattice piecewise affine (PWA) representation, which is capable of representing any continuous PWA function. Necessary and sufficient conditions for irredundancy are proposed. Besides, we discuss how to remove redundant terms and literals and propose corresponding necessary and sufficient conditions. In a worked example, the irredundant lattice PWA representation is used to express the explicit model predictive controller of a linear system, and the result turns out to be much more compact than that given by the state-of-the-art algorithm.
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 callDisclaimer: 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.
