On Universal Minkowski Classes of Polytopes: Theory and Applications

arXiv:2610.41966 · math.OC · Submitted 2026-10-30 · Read on arXiv

math.OC

Submitted: 2026-10-30

Updated: 2026-10-30

License: http://creativecommons.org/licenses/by/4.0/

The gist: This paper establishes the existence, in every dimension, of universal Minkowski classes of configuration-constrained polytopes, with direct applications to set-theoretic control.

Abstract

This paper establishes the existence, in every dimension, of universal Minkowski classes of configuration-constrained polytopes, with direct applications to set-theoretic control. For any prescribed accuracy, such a class contains an approximation of every compact convex set to that accuracy and admits a jointly affine parameterization of facets and vertices. The construction is explicit and relies on a combinatorial averaging procedure that produces minimal configuration enclosures. In control, these polytopic templates enable convex reformulations of otherwise non-convex problems, including invariant-set computation and control Lyapunov function design. Tutorial examples illustrate both the geometric construction and its control applications.

Related papers