Irredundant lattice representations of continuous piecewise affine functions

Research output: Contribution to journalArticleScientificpeer-review

10 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)109-120
JournalAutomatica
Volume70
DOIs
Publication statusPublished - 2016

Keywords

  • Piecewise affine function
  • Irredundant representation
  • Lattice representation

Fingerprint

Dive into the research topics of 'Irredundant lattice representations of continuous piecewise affine functions'. Together they form a unique fingerprint.

Cite this