Pith. sign in

REVIEW 1 cited by

High Order Control Lyapunov-Barrier Functions for Temporal Logic Specifications

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 2102.06787 v1 pith:F7ZF7AZX submitted 2021-02-12 eess.SY cs.ROcs.SY

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

Recent work has shown that stabilizing an affine control system to a desired state while optimizing a quadratic cost subject to state and control constraints can be reduced to a sequence of Quadratic Programs (QPs) by using Control Barrier Functions (CBFs) and Control Lyapunov Functions (CLFs). In our own recent work, we defined High Order CBFs (HOCBFs) for systems and constraints with arbitrary relative degrees. In this paper, in order to accommodate initial states that do not satisfy the state constraints and constraints with arbitrary relative degree, we generalize HOCBFs to High Order Control Lyapunov-Barrier Functions (HOCLBFs). We also show that the proposed HOCLBFs can be used to guarantee the Boolean satisfaction of Signal Temporal Logic (STL) formulae over the state of the system. We illustrate our approach on a safety-critical optimal control problem (OCP) for a unicycle.

Discussion (0). Sign in 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. Fixed time convergence guarantees for Higher Order Control Barrier Functions

    eess.SY 2025-07 conditional novelty 5.0 of 10

    A repeated-root differential constraint for higher-order control barrier functions is proposed to guarantee reaching a safe set within a user-specified fixed time, with second-order formulas and robot simulations.

Pith tools