Pith. sign in

Estimation of Constraint Admissible Invariant Set with Neural Lyapunov Function

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Constraint admissible positively invariant (CAPI) sets play a pivotal role in ensuring safety in control and planning applications, such as the recursive feasibility guarantee of explicit reference governor and model predictive control. However, existing methods for finding CAPI sets for nonlinear systems are often limited to single equilibria or specific system dynamics. This limitation underscores the necessity for a method to construct a CAPI set for general reference tracking control and a broader range of systems. In this work, we leverage recent advancements in learning-based methods to derive Lyapunov functions, particularly focusing on those with piecewise-affine activation functions. Previous attempts to find an invariant set with the piecewise-affine neural Lyapunov function have focused on the estimation of the region of attraction with mixed integer programs. We propose a methodology to determine the maximal CAPI set for any reference with the neural Lyapunov function by transforming the problem into multiple linear programs. Additionally, to enhance applicability in real-time control scenarios, we introduce a learning-based approach to train the estimator, which infers the CAPI set from a given reference. The proposed approach is validated with multiple simulations to show that it can generate a valid CAPI set with the given neural Lyapunov functions for any reference. We also employ the proposed CAPI set estimation method in the explicit reference governor and demonstrate its effectiveness for constrained control.

fields

eess.SY 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Sequentially learning regions of attraction from data

eess.SY · 2025-05-06 · conditional · novelty 5.0

Iteratively refining the tessellation and data converts locally failed piecewise affine Lyapunov certificates into nested level sets that jointly certify attraction to the equilibrium.

citing papers explorer

Showing 1 of 1 citing paper.

  • Sequentially learning regions of attraction from data eess.SY · 2025-05-06 · conditional · none · ref 3 · internal anchor

    Iteratively refining the tessellation and data converts locally failed piecewise affine Lyapunov certificates into nested level sets that jointly certify attraction to the equilibrium.