vix.ing · top · new · best · stats · spec

Finite-Time Computation of Polyhedral Input-Saturated Output-Admissible Sets

2023/11/28 by Yaashia Gautam, Gautam, Yaashia, Marco M. Nicotra +1
Computer Science · Engineering · #Advanced Control Systems Optimization #FOS: Electrical engineering #FOS: Mathematics #Formal Methods in Verification #Optimization and Control (math.OC) #Real-time simulation and control systems #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.2311.16427

openalex publication_date 2023/11/28 · openalex created_date 2023/11/30 · openalex updated_date 2026/07/28

Abstract

The paper introduces a novel algorithm for computing the output admissible set of linear discrete-time systems subject to input saturation. The proposed method takes advantage of the piecewise-affine dynamics to propagate the output constraints within the non-saturated and saturated regions. The constraints are then shared between regions to ensure a proper transition from one region to another. The resulting algorithm generates a set that is proven to be polyhedral, safe, positively invariant, and finitely determined. Moreover, the set is also proven to be strictly larger than the maximal output admissible set that would be obtained by treating input saturation as a constraint.

Related