cs.RONov 15, 2026

Ontology-Compiled Control Barrier Functions for Heterogeneous Robot Teams

Authors: Peng Wu, Seyede Fatemeh Ghoreishi, Nathan Bastian, Mohsen Imani, Tian Lan, Mahdi Imani

Organizations: Northeastern University, Boston, MA, USA · Syracuse University, Syracuse, NY, USA · University of California, Irvine, CA, USA · The George Washington University, Washington, DC, USA

Abstract

Safety filters for heterogeneous robot teams fail because of missing constraints, overestimated braking capabilities and conflicts between individually satisfiable constraints. We present OntoCBF, which compiles a domain ontology with a class taxonomy, typed relations, safety axioms and a dynamics profile per robot class into a control barrier function filter with one quadratic program per agent. Description-logic entailment supplies the constraints of any team online, including those that follow from chains of relations and from classes defined by what a robot carries, so the existing safety axioms cover new robot classes, payload classes and combinations. We prove that a subclass may reuse the braking capability of its parent whenever it can produce every velocity of the parent, a property separate from subsumption. For box-bounded double integrators this property is also necessary, and every loss of safety then begins with a conflict. Once three robots interact, the safe set of pairwise barriers contains states from which a collision is unavoidable, and such states persist in larger teams under any fixed capability reduction. In a simulated warehouse where humans ignore the robots, a filter written for the design classes violates safety in 89-100 % of the episodes with unseen classes. In all scenarios, including one with 32 robots, OntoCBF violates safety in 20-70 % of the episodes, each time after a conflict, with a median deepest intrusion of 10-17 % of the keep-out distance. A multi-agent PPO policy trained with the filter in the loop lowers the rate of infeasible quadratic programs, nearly all of them conflicts, by 18-41 %.

Figures & tables

Appendix figures & tables13 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Sep 14, 2026

Exact Feasibility Certification and Optimal Responsibility Allocation for Multi-Robot CBF Safety Filters

Multi-robot Control Barrier Function (CBF) safety filters can become infeasible, but a failed quadratic program (QP) does not indicate why the conflict occurred or how to resolve it. To address this, we develop an exact feasibility certificate for multi-agent CBF filters with heterogeneous control-affine dynamics and convex input sets. The certificate quantifies a feasibility reserve by separating the demand imposed by safety constraints from the available actuator supply. This decomposition shows when CBF gain tuning or increased actuation can and cannot resolve infeasibility, and identifies the agents and interactions responsible for the conflict. We further propose an algorithm to optimally allocate shared safety constraints by maximizing the worst local feasibility margin, yielding a linear program for polyhedral input sets. In 320320 paired closed-loop simulations, the proposed allocation reduces infeasible control steps from roughly 50%50\% to 6.2%6.2\%, and reduces safety-violating runs from 118/160118/160 to 24/16024/160. In addition, across 5252 infeasibility events, the certificate identifies an interaction whose relaxation restores feasibility in 94%94\% of cases.
Nov 14, 2026

Distilling Safety Filters for Filter-free Multi-agent RL

Reinforcement learning (RL) can teach robot teams to navigate shared spaces, but trial and error causes collisions that real robots cannot afford. Control barrier function (CBF) safety filters prevent these collisions by correcting unsafe actions, yet in a team the filter becomes a centralized optimization whose number of constraints grows quadratically with the team size. We propose an approach that builds the filter's safety into the RL policy and examine how such a system behaves during filter-free deployment. However, the filter that keeps training safe also hides what the policy must learn: it masks the cost of unsafe actions, which actor-critic methods then overvalue, and it keeps near-collision states out of the training data. Our approach therefore learns only from executed safe actions with implicit Q-learning and distills the filter into the policy at synthetic near-collision states. We prove that filter distillation loss bounds the policy's constraint violation and hence how far agents can cross their safety margin, so errors never accumulate. When distillation states cover deployed states, the loss also bounds the collision probability at every step. Without a filter and acting only on local observations, our policies have no collisions in 1,800 test episodes with multiple agents. A policy trained with three agents transfers zero-shot to teams of twenty at constant per-agent computation and stays collision-free with up to eight agents. We test our policies on Crazyflie quadrotors with up to five flying at the same time.
Apr 14, 2026

Capability-Aware Heterogeneous Control Barrier Functions for Decentralized Multi-Robot Safe Navigation

Safe decentralized navigation in heterogeneous robot teams is challenging because robots with different dynamics and control limits cannot satisfy identical collision-avoidance obligations equally well. Existing methods often rely on model-specific safety formulations or allocate avoidance responsibility without considering whether the assigned control is physically realizable, possibly leading to safety-constrained QP infeasibility and safety violations. We propose Capability-Aware Heterogeneous Control Barrier Functions (CA-HCBF), a decentralized framework for consistent safety enforcement and capability-aware responsibility allocation. We derive a unified operational-space second-order control-affine formulation for holonomic and nonholonomic mobile robots through canonical transformation and backstepping, addressing the relative-degree mismatch while preserving forward invariance of the pairwise safe set. Second, we quantify each robot's achievable control authority along the safety-critical direction using a support-function-based capability metric and use it to distribute pairwise avoidance responsibility. A feasibility-aware clipping mechanism further mitigates physically unrealizable responsibility assignments. Simulations with up to 30 heterogeneous robots and hardware experiments demonstrate high task completion with low safety violations and reduction in local QP infeasibility.