REVIEW 4 cited by
Robust Safety under Stochastic Uncertainty with Discrete-Time 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
read the original abstract
Robots deployed in unstructured, real-world environments operate under considerable uncertainty due to imperfect state estimates, model error, and disturbances. Given this real-world context, the goal of this paper is to develop controllers that are provably safe under uncertainties. To this end, we leverage Control Barrier Functions (CBFs) which guarantee that a robot remains in a ``safe set'' during its operation -- yet CBFs (and their associated guarantees) are traditionally studied in the context of continuous-time, deterministic systems with bounded uncertainties. In this work, we study the safety properties of discrete-time CBFs (DTCBFs) for systems with discrete-time dynamics and unbounded stochastic disturbances. Using tools from martingale theory, we develop probabilistic bounds for the safety (over a finite time horizon) of systems whose dynamics satisfy the discrete-time barrier function condition in expectation, and analyze the effect of Jensen's inequality on DTCBF-based controllers. Finally, we present several examples of our method synthesizing safe control inputs for systems subject to significant process noise, including an inverted pendulum, a double integrator, and a quadruped locomoting on a narrow path.
Forward citations
Cited by 4 Pith papers
-
Self-Adaptive Learning and Model Predictive Control for Tracking Unknown Dynamics with No Regret
A self-adaptive MPC with multiple online-learned RFF predictors and Hedge-based selection achieves O(T^{3/4}) expected regret for tracking unknown, switching target dynamics.
-
Data-Efficient Control of Polynomial Systems via Physics-Guided Quadratic Constraints
A physics-guided quadratic constraint added to a sum-of-squares optimization lets a single short noisy trajectory certify robust safety for polynomial control systems, reducing data needs substantially.
-
Sequential QCQP for Bilevel Optimization with Line Search
A bilevel optimization algorithm uses a tilted QCQP and a control-barrier line search to guarantee anytime feasibility and an O(1/k) ergodic convergence rate.
-
Dependency-Guided Code Generation: Structured Matrix Decomposition and Consistency-Guided Refinement
A dependency-aware code generation method that decomposes code-dependency matrices into quantized and low-rank components and uses them in a consistency-guided retrieval-refinement loop.
Discussion (0). Continue with ORCID to comment.