Data-driven approximation of control invariant set for linear system based on convex piecewise linear fitting
Abstract
Control invariant set is critical for guaranteeing safe control and the problem of computing control invariant set for linear discrete-time system is revisited in this paper by using a data-driven approach. Specifically, sample points on convergent trajectories of linear MPC are recorded, of which the convex hull formulates a control invariant set for the linear system. To approximate the convex hull of multiple sample points, a convex piecewise linear (PWL) fitting framework has been proposed, which yields a polyhedral approximation with predefined complexity. A descent algorithm for the convex PWL fitting problem is also developed, which is guaranteed to converge to a local optimum. The proposed strategy is flexible in computing the control invariant set in high dimension with a predefined complexity. Simulation results show that the proposed data-driven approximation can compute the approximated control invariant set with high accuracy and relatively low computational cost.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.