Pith. sign in

REVIEW

Disturbance rejection 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 2508.01601 v2 pith:5UFZ7URH submitted 2025-08-03 eess.SY cs.SY

Disturbance rejection control barrier functions

classification eess.SY cs.SY
keywords disturbancesdrcbfscbfsdisturbancerobustbarriercontrolexisting
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Most existing robust control barrier functions (CBFs) can only handle matched disturbances, restricting their applications in real-world scenarios. While some recent advances extend robust CBFs to unmatched disturbances, they heavily rely on differentiability property of disturbances, and fail to accommodate non-differentiable case for safety constraints with high relative degree.To address these limitations, this paper proposes a class of disturbance rejection CBFs (DRCBFs), including knowledge-based DRCBFs (kDRCBFs) and reciprocal-compensated DRCBFs (rDRCBFs).These two DRCBFs can strictly guarantee safety under general bounded disturbances, which includes both matched or unmatched, differentiable or non-differentiable disturbances as special cases. Moreover, no information of disturbance is needed in rDRCBFs. Simulation results illustrate that the proposed DRCBFs outperform existing robust CBFs.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.