Search arXiv⌕ Search

arXiv · 2611.07788

Geometry-Evolving Barrier Functions for Safety Evaluation in Dynamic Environments

Abstract

Autonomous systems operating in dynamic environments often involve multiple interacting agents, giving rise to high-dimensional safety evaluation problems. Hamilton--Jacobi (HJ) reachability provides rigorous finite-horizon safety guarantees, but solving a global HJ partial differential equation (PDE) over the entire state space leads to prohibitive computational complexity. In this paper, we introduce Geometry-Evolving Barrier Functions (GEBFs), a novel representation for dynamic safety evaluation that propagates local safety geometry of the solution to a terminal-value HJ PDE. By evolving the value, gradient, and curvature information along a Hamiltonian-induced reference trajectory, GEBFs provide a compact representation of the local HJ safety landscape. Under suitable local regularity assumptions, we establish consistency between the GEBF and the value, gradient, and Hessian of the HJ solution along an HJ-optimal characteristic. Building on these theoretical results, we develop an iterative algorithm that couples local geometric propagation with trajectory refinement. We further establish a trajectory-wise one-sided relationship between the GEBF and HJ value function, together with a fixed-point consistency result for the iterative scheme. Experiments on widely adopted agent--obstacle collision-avoidance benchmarks, across low- and high-dimensional systems, demonstrate that GEBFs accurately capture the evolution of dynamic safety boundaries, while achieving substantially lower computational cost than conventional HJ reachability.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhi Zhang, Francesco Belardinelli, Alessandro Abate. 2026-11-05. Geometry-Evolving Barrier Functions for Safety Evaluation in Dynamic Environments. https://arxiv.org/abs/2611.07788

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Modeling Rainwater Harvesting Systems with Covered Storage Tank on A Smartphone

A model for simulating rainwater harvesting systems with a covered storage tank is described. The model is simple enough to serve as the simulation engine of a smartphone app for designing such systems. The results of the simulation can be used to find the optimum tank size and the reliability of the system in meeting a given demand. This is illustrated by using the model for designing two such systems, one in an urban environment and the other in an arid rural location. The Python scripts used for the simulations are included as ancillary material.

eess.SY↗

To Learn or Not to Learn: A Screening Test for Control Problems Before Reinforcement Learning

Reinforcement learning (RL) can be a powerful alternative to classical control methods when standard model-based control is insufficient, e.g., when deriving a suitable model is intractable or impossible. However, in many cases, the choice between model-based and RL-based control is not obvious. Because training RL agents is computationally expensive, RL should be limited to cases where it is expected to outperform model-based control. To the best of our knowledge, there exists no approach to automatically screen out control problems before RL training for which RL is not expected to yield any benefit. In this work, we take the first step towards such an automated screening test. We present a test that identifies problems for which RL-based control is not expected to be superior in two steps. Only control problems that pass both steps should be considered for RL. Part I evaluates the suitability of a provided model for model-based control by analyzing the impact of its uncertainties on the control problem. For this, we use reachset-conformant system identification combined with simulation-based analysis. If the uncertainties are found to be relevant in Part I, Part II then evaluates their learnability using a statistically calibrated dependence analysis. We apply our screening test to several benchmarks, reliably identifying control problems for which RL-based control does not measurably improve upon model-based control, thereby achieving a speed-up of up to $21\times$ compared to trying RL.

eess.SY↗

State-Feedback Passivity Control for Synchronous Machine Systems

The passivity of a generating station enables network stability to be established from conditions verified locally at each station. For synchronous machines, however, passivity can only be certified under conditions on the operating point, and these conditions fail under heavy loading and weak damping. This paper develops a state-feedback controller that enforces passivity using a storage battery connected at the terminal bus. A bilinear term arising from the product of the rotor-speed and stator-current deviations is treated as a bounded uncertainty, leading to robust positive-real conditions that can be enforced by a state feedback control designed using a single algebraic Riccati equation. The resulting controller guarantees passivity whenever the Riccati equation admits a positive-definite solution, with no separate condition on the operating point. Numerical examples show that existing conditions certify passivity only up to a fraction of the rated current, whereas the proposed state-feedback approach certifies it at the rated operating point of the machine.

eess.SY↗