Papers › Control Barrier Functions in Sampled-Data Systems
Control Barrier Functions in Sampled-Data Systems
Joseph Breeden, Kunal Garg, Dimitra Panagou
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper presents conditions for ensuring forward invariance of safe sets under sampled-data system dynamics with piecewise-constant controllers and fixed time-steps. First, we introduce two different metrics to compare the conservativeness of sufficient conditions on forward invariance under piecewise-constant controllers. Then, we propose three approaches for guaranteeing forward invariance, two motivated by continuous-time barrier functions, and one motivated by discrete-time barrier functions. All proposed conditions are control affine, and thus can be incorporated into quadratic programs for control synthesis. We show that the proposed conditions are less conservative than those in earlier studies, and show via simulation how this enables the use of barrier functions that are impossible to implement with the desired time-step using existing methods.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections