Pith. sign in

REVIEW 1 cited by

A Semi-Algebraic Framework for Verification and Synthesis of Control Barrier Functions

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 2209.00081 v3 pith:RRGPBD7U submitted 2022-08-31 eess.SY cs.SY

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

Safety is a critical property for control systems in medicine, transportation, manufacturing, and other applications, and can be defined as ensuring positive invariance of a predefined safe set. This paper investigates the problems of verifying positive invariance of a semi-algebraic set as well as synthesizing sets that can be made positive invariant through Control Barrier Function (CBF)-based control. The key to our approach consists of mapping conditions for positive invariance to sum-of-squares constraints via the Positivstellensatz from real algebraic geometry. Based on these conditions, we propose a framework for verifying safety of CBF-based control including single CBFs, high-order CBFs, multi-CBFs, and systems with trigonometric dynamics and actuation constraints. In the area of synthesis, we propose algorithms for constructing CBFs, namely, an alternating-descent approach and a local CBF approach. We evaluate our approach through case studies on quadrotor UAV and power converter test systems.

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