Pith. sign in

REVIEW 1 cited by

Minimally Conservative Controlled-Invariant Set Synthesis Using Control Barrier Certificates

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.07640 v4 pith:6BLHTRBJ submitted 2024-11-12 eess.SY cs.SY

classification eess.SYcs.SY
keywords safecontrolcontrolled-invariantmethodstatebarriercbcscertificates
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Finding a controlled-invariant set for a system with state and control constraints is crucial for safety-critical applications. However, existing methods often produce overly conservative solutions. This paper presents a method for generating controlled-invariant (safe) sets for nonlinear polynomial control-affine systems using Control Barrier Certificates (CBCs). We formulate CBC conditions as Sum-of-Squares (SOS) constraints and solve them via an SOS Program (SOSP). First, we generalize existing SOSPs for CBC synthesis to handle environments with complex unsafe state representations. Then, we propose an iterative algorithm that progressively enlarges the safe set constructed by the synthesized CBCs by maximizing boundary expansion at each iteration. We theoretically prove that our method guarantees strict safe set expansion at every step. Finally, we validate our approach with numerical simulations in 2D and 3D for single-input and multi-input systems. Empirical results show that the safe set generated by our method covers in most part a larger portion of the state space compared to two state-of-the-art techniques.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization

    eess.SY 2025-06 conditional novelty 6.0 of 10

    A convex optimization method, based on a probabilistic reformulation of control inputs, computes and iteratively enlarges controlled reach-avoid sets for discrete-time polynomial systems.

Pith tools