Abstract
In this paper, we revisit the full lattice representation of continuous piecewise affine (PWA) functions and give a formal proof of its representation ability. Based on this, we derive the irredundant lattice PWA representations through removal of redundant terms and literals. Necessary and sufficient conditions for irredundancy are proposed. Besides, we explain how to remove terms and literals in order to ensure irredundancy. An algorithm is given to obtain an irredundant lattice PWA representation. In the worked examples, the irredundant lattice PWA representations are used to express the optimal solution of explicit model predictive control problems, and the results turn out to be much more compact than those given by a state-of-the-art algorithm.
Sign-in/Register to access full text options 
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.
