betaFeedback

WorksComputer Science

Ontology-Compiled Control Barrier Functions for Heterogeneous Robot Teams

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 %.

Introduction

Warehouses, hospitals and construction sites increasingly operate heterogeneous robot teams in spaces shared with people. Their safety requirements depend on what each entity is and on how the entities are related. A drone keeps farther from a person than a ground robot does, a carrier is responsible for the distance between its payload and nearby people, and ground robots avoid restricted zones that drones may cross. Industrial standards state such requirements in the same terms, through separation distances that depend on the type of machine and on its stopping performance ([18] (ISO 2016)). Safety filters based on control barrier functions (CBFs) enforce requirements of this kind on top of a learned or hand-designed controller with minimal changes to its commands ([1, 34]), and they are a common safety layer for multi-agent reinforcement learning (MARL) ([7] (Zhang et al. 2025b)).

In existing multi-agent safety filters, the constrained pairs, the keep-out distances and the braking capabilities are fixed at design time for the robot types known at that point ([34, 7, 11]). Learned graph CBFs for collision avoidance generalize across team sizes and, empirically, across robot models [19] (Zhang et al. 2025b). Semantic safety filters query language models for constraints, which leaves the completeness and consistency of the constraint set unverified [6, 28]. Robot fleets change over their lifetime, and whenever a team gains a new robot model, payload type or task combination, an engineer has to determine by hand which constraints apply to the new entities and whether the existing safety certificate still holds.

We let a domain ontology, of the kind already standardized for robotics [15], carry the safety specification. A filter for a heterogeneous team can miss a constraint for a new entity, overestimate the braking capability of a robot, or contain constraints that are each satisfiable and exclude each other. In our warehouse ontology (Figure 1), the taxonomy states that a LightDrone is a Drone and that every Drone is Aerial. A safety axiom states how far an Aerial agent stays from a Human, and a property chain relates each carrier to the people near its payload. Entailment removes the first failure, because the constraints of unlisted classes, payloads and combinations follow from these statements. The second failure depends on dynamics, because a HeavyDrone, a Drone that brakes less strongly, inherits every constraint of Drone and needs a braking capability of its own. A test on the dynamics profiles in the ontology, together with classification, decides when a subclass may reuse the capabilities, and with them the certificate, of its parent. We prove that the third failure is intrinsic to pairwise barriers.

OntoCBF pipeline and robot and payload taxonomies

Figure 1. (a) OntoCBF. (b) Robot classes with per-axis acceleration limits aˉ\bar{a} (m/s2^2), and payload classes. LightDrone (green) is a dynamic subtype of Drone. HeavyDrone (red) brakes less strongly and Forklift has no design ancestor, so both receive their own capability. These classes and Chemical appear only in tests.

Our contributions are the following.

  1. We formulate safe control of heterogeneous teams whose active constraints are entailed by an ontology and switch online. Our method, OntoCBF, compiles these entailments into a CBF filter with one quadratic program (QP) per agent and trains a shared multi-agent PPO (MAPPO) policy with the filter in the loop.

  1. Theorem 4 shows that a subclass inherits exactly the constraints of its parent under a classification test, and its capabilities under dynamic subtyping, an inclusion of velocity sets that braking barriers of box-bounded double integrators require.

  1. Propositions 5–7 show that, with capabilities assigned this way, safety is lost only after a conflict, and that some states with positive pairwise barriers lead to a collision under every input, for three robots and, under any fixed capability reduction, for large enough teams.

  1. Experiments in a simulated warehouse with unseen classes and up to 32 robots show that OntoCBF removes the first two failures, that every remaining violation follows a conflict, and that the learned policy lowers the rate of infeasible QPs by 18–41 % (§ 6).

Related Work

Multi-agent safety filters. Our barriers and responsibility split follow Wang et al. [33, 34], and Kim et al. [20] extend the split to kinematically heterogeneous robots. Sah and Keshavan [30] give an exact pointwise test of joint feasibility for heterogeneous teams. Learned graph CBFs enforce collision avoidance in teams of any size (Zhang et al., 2025b}), are trained jointly with PPO-style policies (Zhang et al., 2025a}), and now cover heterogeneous teams through type embeddings (Yang et al., [37]) or, for unseen robot models, through features of their reachable velocity sets (Kim et al., [19]). Constrained MARL bounds expected costs (Gu et al., [14]), and shields from temporal-logic specifications act on discrete abstractions (ElSayed-Aly et al., [11]; Xiao et al. [36]). Several works check or design the compatibility of multiple CBFs under input limits (Tan and Dimarogonas, [31]; Breeden and Panagou [4]; Isaly et al. [16]; Mousavi et al. [25]), and Proposition 7 shows that pairwise braking barriers are incompatible on parts of their own safe set.

Semantic safety and reuse of certificates. Semantic safety filters derive constraints from language or vision-language models (Brunke et al., [6]; Ravichandran et al. [28]), and logical specifications have been compiled into CBFs as compositions of state constraints (Lindemann and Dimarogonas, [21]; Molnar and Ames [23]). Ontologies model safety in human–robot collaboration (Dhanda et al., [10]) and have been used to verify robot plans (Wu et al., [35]), to shape risk fields for motion planning (van der Ploeg et al., [32]) and to mask the actions of a learner (Fatima and Tolg, [12]). To our knowledge, OntoCBF is the first method that compiles entailments into control constraints with an invariance guarantee. Behavioral subtyping requires a subtype to preserve what clients of the supertype rely on (Liskov and Wing, [22]). A system that admits at least the inputs of another can reuse its controllers (Reissig et al., [29]), and barriers transfer between systems through reduced-order models (Cohen et al., [9]), learned inverse dynamics (Nadali et al., [26]) or a simulation function with a margin (Bousias et al., [3]). Part 2 of Theorem 4 is the zero-margin, class-level form of such a transfer. Parts 1 and 3 add what an ontology requires, namely a classification test for identical constraints and, for box-bounded double integrators, the necessity of dynamic subtyping for braking barriers (Table 1).

Line of workTeamHet.Sem.Spec.SwitchNewReuseLearn
Multi-robot CBF filters ([34, 20, 30])◦✓✗✗◦✗✗✓
Learned graph CBFs ([37, 19] (Zhang et al. 2025b))◦✓✗✗◦◦✗✓
Safe MARL and shields ([14, 11, 8])◦✗◦◦✗✗✗✓
Logic compiled into CBFs ([21, 23])◦✗◦✓✓✗✗✗
Constraints from (V)LMs ([6, 28])✗✗✓✗◦◦✗◦
Ontologies for robot safety ([35, 32, 12])✗✗✓✓✗◦✗◦
Certificate transfer ([29, 3])✗✓✗✗✗◦✓✗
OntoCBF (ours)◦✓✓✓✓✓✓✓

Table 1. Related work compared on team certificate, class-specific dynamics, typed relational constraints, formal specification, guarantee across switches, unseen types without redesign, certificate-reuse condition and learning in the loop (✓ addressed, ◦ partly, ✗ absent).

Problem Setting

Entities and dynamics. The workspace contains controlled agents I={1,…,N}\mathcal{I} = \{1,\ldots,N\}, humans H\mathcal{H}, restricted zones Z\mathcal{Z} and payloads P\mathcal{P}. Each entity ee belongs to a class κ(e)\kappa(e), a concept name of the ontology, and we call the restriction of κ\kappa to I\mathcal{I} the team composition. An agent of class CC has dynamics x˙i=fC(xi)+gC(xi)ui\dot{x}_i = f_C(x_i) + g_C(x_i)u_i with ui∈UCu_i \in U_C compact. In our experiments it is a planar double integrator, p˙i=vi\dot{p}_i = v_i, v˙i=ui\dot{v}_i = u_i, with UC=[−aˉC,aˉC]2U_C = [-\bar{a}_C,\bar{a}_C]^2. Humans are double integrators with unknown accelerations bounded by ∥v˙h∥≤aˉh\lVert\dot{v}_h\rVert\le\bar{a}_h, an agent carries at most one payload, which sits at pi+oip_i + o_i for a fixed offset oio_i, and zones are static.

Ontology. We use the description logic of OWL 2 ([2]), in which an ontology consists of a TBox T\mathcal{T} of terminological axioms and an ABox A\mathcal{A} of facts about individuals. Our TBox contains the taxonomy of Figure 1b as concept inclusions C⊑C′C \sqsubseteq C', disjointness axioms such as Aerial⊓Ground⊑⊥\mathrm{Aerial} \sqcap\mathrm{Ground} \sqsubseteq\bot, the symmetric role near, the role carries from ControlledAgent to Payload, and the role nearCarried, which the property chain carries ∘\circ near ⊑\sqsubseteq nearCarried derives from carries(a,p)(a,p) and near(p,b)(p,b). Payloads have their own taxonomy, Chemical ⊑\sqsubseteq HazardousPayload ⊑\sqsubseteq Payload, and the defined class HazardCarrier ≡\equiv ControlledAgent ⊓∃\sqcap\exists carries.HazardousPayload contains whichever agent currently carries a hazardous payload. Each robot class is annotated with a dynamics profile, here aˉC\bar{a}_C and a nominal speed vˉC\bar{v}_C. We write T∪A⊨φ\mathcal{T} \cup\mathcal{A} \models\varphi if φ\varphi holds in every model of T∪A\mathcal{T} \cup\mathcal{A}, which HermiT decides soundly and completely for OWL 2 DL ([13]).

Safety axioms and active constraints. A safety axiom σ=(rσ,Cσ,Cσ′,Dσ)\sigma= (r_\sigma, C_\sigma, C'_\sigma, D_\sigma) requires that the distance between aa and bb stays at least DσD_\sigma whenever rσ(a,b)r_\sigma(a,b), Cσ(a)C_\sigma(a) and Cσ′(b)C'_\sigma(b) are entailed. For rσ=nearCarriedr_\sigma= \mathrm{nearCarried} the distance is measured from the payload of aa. The ABox at time tt,

At={κ(e)(e)}e∪{carries(i,p)}i carries p∪{near(e,e′):e≠e′, ∥pe−pe′∥<ρ},(1)\mathcal{A}_t = \{\kappa(e)(e)\}_e \cup\{\mathrm{carries}(i,p)\}_{i\ \mathrm{carries}\ p} \cup\{\mathrm{near}(e,e') : e \ne e',\ \lVert p_e-p_{e'}\rVert< \rho\}, \tag*{(1)}

changes when an entity enters or leaves the sensing radius ρ\rho of another and when an agent picks up or drops a payload. The constraints active at time tt are the entailed instances of the safety axioms,

Kt={(σ,a,b):T∪At⊨rσ(a,b)∧Cσ(a)∧Cσ′(b)},(2)\mathcal{K}_t = \{(\sigma,a,b) : \mathcal{T} \cup\mathcal{A}_t \models r_\sigma(a,b) \land C_\sigma(a) \land C'_\sigma(b)\}, \tag*{(2)}

and the safe set is St={x:∥qσ,a(x)−pb∥≥Dσ for all (σ,a,b)∈Kt}\mathcal{S}_t = \{x : \lVert q_{\sigma,a}(x)-p_b\rVert\ge D_\sigma\ \text{for all }(\sigma,a,b)\in\mathcal{K}_t\}, where qσ,aq_{\sigma,a} is the position of aa, or of its payload if rσ=nearCarriedr_\sigma=\mathrm{nearCarried}. Since a subclass inherits every axiom attached to its ancestors, the safe set depends on the team composition through entailment.

Barrier functions. For a constraint k=(σ,a,b)k=(\sigma,a,b) let Δp=qσ,a−pb\Delta p=q_{\sigma,a}-p_b, Δv=va−vb\Delta v=v_a-v_b, d=∥Δp∥d=\lVert\Delta p\rVert and n=Δp/dn=\Delta p/d. We use the braking barrier of Wang et al. [33],

hk=2Ak(d−Dσ)+nTΔv,(3)h_k = \sqrt{2A_k(d-D_\sigma)} + n^\mathsf{T}\Delta v, \tag*{(3)}

where Ak≥0A_k \ge0 is the braking capability available to the pair. If hk≥0h_k \ge0, braking at rate AkA_k along nn stops the approach at a distance of at least DσD_\sigma, and hkh_k is continuously differentiable wherever d>Dσd>D_\sigma. Since h˙k\dot{h}_k is affine in the accelerations, the condition h˙k≥−α(hk)\dot{h}_k \ge-\alpha(h_k) with α(h)=γh3\alpha(h)=\gamma h^3 reads

nT(va−vb)≥bk:=−γhk3−AknTΔv2Ak(d−Dσ)−∥Δv∥2−(nTΔv)2d.(4)n^\mathsf{T}(v_a-v_b) \ge b_k := -\gamma h_k^3 - \frac{A_k n^\mathsf{T}\Delta v}{\sqrt{2A_k(d-D_\sigma)}} - \frac{\lVert\Delta v\rVert^2-(n^\mathsf{T}\Delta v)^2}{d}. \tag*{(4)}

Velocity sets and certificates. For a class CC, VC(xi)={fC(xi)+gC(xi)u:u∈UC}V_C(x_i) = \{f_C(x_i) + g_C(x_i)u : u \in U_C\} is the set of state derivatives, called velocities as in viability theory, that an agent of class CC can produce at xix_i. For a team composition κ\kappa let Vκ(x)=∏i∈IVκ(i)(xi)V_\kappa(x) = \prod_{i \in I} V_{\kappa(i)}(x_i), and let Ω(x)=∏h∈H{(vh,w):∥w∥≤aˉh}\Omega(x) = \prod_{h \in H}\{(v_h,w) : \lVert w \rVert\le\bar{a}_h\} be the set of admissible velocities of the humans.

Definition 1 (Dynamic subtype). A robot class C′C' is a dynamic subtype of a robot class CC, written C′⪯dynCC' \preceq_{\mathrm{dyn}} C, if both classes have the same state space and VC(xi)⊆VC′(xi)V_C(x_i) \subseteq V_{C'}(x_i) for all xix_i.

Definition 2 (Joint validity). A family {hk}k∈K\{h_k\}_{k \in K} of functions that are continuously differentiable on an open set containing X\mathcal{X} is jointly valid for κ\kappa on X\mathcal{X} if for every x∈Xx \in\mathcal{X} there is ξ∈Vκ(x)\xi\in V_\kappa(x) such that ∇Ihk(x)⊤ξ+∇Hhk(x)⊤ω≥−α(hk(x))\nabla_I h_k(x)^\top\xi+ \nabla_H h_k(x)^\top\omega\ge-\alpha(h_k(x)) for all k∈Kk \in K and all ω∈Ω(x)\omega\in\Omega(x).

Subsumption C′⊑CC' \sqsubseteq C is entailed by the TBox, and C′⪯dynCC' \preceq_{\mathrm{dyn}} C is a property of the dynamics profiles. For box-bounded double integrators C′⪯dynCC' \preceq_{\mathrm{dyn}} C holds if and only if aˉC′≥aˉC\bar{a}_{C'} \ge\bar{a}_C, so HeavyDrone ⊑\sqsubseteq Drone holds and HeavyDrone ⪯dyn\preceq_{\mathrm{dyn}} Drone fails. A certificate for a team is a family that is jointly valid on a set X\mathcal{X}, together with the capabilities and the gain γ\gamma used to build it.

Objective. Each agent is rewarded for reaching a sequence of goals and acts on a local observation. We seek decentralized policies and a filter that maximize the expected team return subject to x(t)∈Stx(t) \in\mathcal{S}_t for all tt, for any team and any classes that the ontology declares, including those absent at design time and in training.

Compiling the Ontology into a Safety Filter

OntoCBF consists of a reasoner that decides which constraints are active, a CBF filter that enforces them with one QP per agent, and a shared policy trained with MARL that performs the task (Figure 1a).

Compilation and capability assignment

Offline, HermiT classifies T\mathcal{T} once, and OntoCBF stores the ancestors of every class, the safety axioms indexed by role, the defined classes and the dynamics profiles. The design classes, here Drone, Rover and Carrier, are the robot classes of the team for which a certificate is established when the system is designed, and each enters the barriers with the braking capability βC=aˉC\beta_C = \bar{a}_C. Every other robot class CC inherits βC=βC+\beta_C = \beta_{C^+} from its nearest design ancestor C+C^+ if CC is a dynamic subtype of C+C^+ (Definition 1) and has the same subsumers as C+C^+ in ΣT\Sigma_{\mathcal{T}} (§ 5), a test that classification decides. By Theorem 4, CC then also inherits the certificate of C+C^+, provided both have the same payload offset. With several nearest design ancestors, both conditions must hold for each, and the smallest capability is used. All remaining robot classes, Forklift among them, receive βC=aˉC\beta_C = \bar{a}_C and need a certificate of their own. For box-bounded double integrators the dynamic-subtype test reduces to aˉC≥aˉC+\bar{a}_C \ge\bar{a}_{C^+}, so LightDrone inherits from Drone and HeavyDrone receives its own capability. The rule yields βC≤aˉC\beta_C \le\bar{a}_C for every class, which makes every constraint satisfiable on its own wherever its barrier is nonnegative (Lemma 3). Joint validity of all constraints (Definition 2) is a separate property, measured in § 6.2.

Event-triggered reasoning

The reasoner runs at ABox events, which occur when a sensed near assertion appears or disappears and when the task layer asserts or retracts carries at a pickup or a drop. It closes the asserted roles under symmetry and the property chain, realizes the defined classes, so that an agent carrying a hazardous payload becomes a HazardCarrier, and instantiates every safety axiom whose role and classes are entailed for a pair. Each instance becomes a constraint kk with keep-out DσD_{\sigma}, braking capability AkA_k and a split of (4) among its controlled agents. For two robots, Ak=βa+βbA_k=\beta_a+\beta_b, and (4) is split into nTua≥wabk\mathbf{n}^{\mathsf{T}}\mathbf{u}_a \ge w_a b_k and −nTub≥wbbk-\mathbf{n}^{\mathsf{T}}\mathbf{u}_b \ge w_b b_k with wa=βa/Akw_a=\beta_a/A_k and wb=βb/Akw_b=\beta_b/A_k [33]. For a robot and a human, who may accelerate toward the robot, Ak=βa−aˉhA_k=\beta_a-\bar{a}_h, which is positive for all our classes, and the robot alone enforces nTua≥bk+aˉh\mathbf{n}^{\mathsf{T}}\mathbf{u}_a \ge b_k+\bar{a}_h. For a robot and a zone, Ak=βaA_k=\beta_a, and the robot enforces nTua≥bk\mathbf{n}^{\mathsf{T}}\mathbf{u}_a \ge b_k. We call these linear inequalities the barrier inequalities of an agent. Rule saturation is complete for our TBox, agrees with HermiT on 72 random ABoxes and takes 0.06 ms per ABox against 332 ms. It also detects inconsistent ABoxes, which would leave StS_t empty, and OntoCBF then keeps the last consistent ABox and brakes (Appendix B). Reasoning is centralized over the shared ABox, and each QP needs the states and capabilities of the entities within the sensing radius. Activation check. A relation asserted by the task layer, such as carries at a pickup, can activate a constraint with hk<0h_k<0, so the reasoner computes the constraints that the assertion would activate and defers the pickup until each has hk≥0.2h_k\ge0.2 m/s.

Per-agent filter

Agent ii collects its barrier inequalities as half-planes gkTu≥ckg_k^{\mathsf{T}}\mathbf{u}\ge c_k and solves

ui=arg⁡min⁡u∈Uκ(i) ∥u−uinom∥2s.t.gkTu≥ck for every barrier inequality k of agent i,(5)u_i=\underset{\mathbf{u}\in U_{\kappa(i)}}{\arg\min}\ \lVert\mathbf{u}-\mathbf{u}_i^{\mathrm{nom}}\rVert^2 \quad\text{s.t.}\quad g_k^{\mathsf{T}}\mathbf{u}\ge c_k\ \text{for every barrier inequality }k\text{ of agent }i, \tag*{(5)}

over its true input set Uκ(i)U_{\kappa(i)}, so the assigned capability enters only through the barriers. Since u∈R2\mathbf{u}\in\mathbb{R}^2, (5) is solved exactly over the edges and vertices of the feasible polygon. If the polygon is empty, the agent minimizes ∥u−uinom∥2+μ∑kmax⁡(0,ck−gkTu)2\lVert\mathbf{u}-\mathbf{u}_i^{\mathrm{nom}}\rVert^2+\mu\sum_k\max(0,c_k-g_k^{\mathsf{T}}\mathbf{u})^2 over Uκ(i)U_{\kappa(i)} with μ=1000\mu=1000. The filter evaluates (3) with DσD_{\sigma} enlarged by a margin δ=0.05\delta=0.05 m and requires the relative acceleration AkA_k along n\mathbf{n} inside the margin. We log the single-constraint failures and conflicts that § 5 distinguishes. A single-constraint failure is a barrier inequality with hk≥0h_k\ge0 that every input in Uκ(i)U_{\kappa(i)} violates, and a conflict is an empty polygon whose inequalities are each satisfiable on their own.

Learning with the filter in the loop

A policy πθ\pi_{\theta} shared by all agents is trained with MAPPO (Yu et al., 2022) in the design scenario W0 only, with the filter acting on its outputs. Agent ii observes its own state and goal and, for every entity within ρ\rho, the relative state, a class embedding and the keep-out distance that the reasoner currently entails for the pair, pooled by attention. Class embeddings are tied along the taxonomy, eC=∑C′⊑CδC′e_C=\sum_{C'\sqsubseteq C}\delta_{C'} with δC′=0\delta_{C'}=0 for classes absent from training, so an unseen class is represented through its known ancestors (Appendix § 12). The policy outputs a bounded correction uinom=clip⁡(uiPD+sitanh⁡(ai))u_i^{\mathrm{nom}}=\operatorname{clip}(u_i^{\mathrm{PD}}+s_i\tanh(a_i)) to a go-to-goal controller, with sis_i capped at the authority seen in training, a cap introduced after an earlier experiment with LightDrone (Appendix § 12). The reward is goal progress plus an arrival bonus minus penalties on the intervention ∥ui−uinom∥2\lVert u_i-u_i^{\mathrm{nom}}\rVert^2, on infeasible QPs, on violations and on overspeed, with the gradient taken with respect to the pre-filter action aia_i. By Proposition 6, in continuous time the penalty on infeasible QPs targets the only failure mode left under OntoCBF.

Inheritance and Conflicts

Throughout this section and its proofs in Appendix A, the agent set I\mathcal{I} is fixed, uncontrolled entities keep their classes, and T\mathcal{T} is the TBox of Appendix B.

Lemma 3 (Single-constraint feasibility) Let agent aa have the input set [−aˉa,aˉa]2[-\bar{a}_a,\bar{a}_a]^2 and capability βa\beta_a, and consider one of its barrier inequalities from § 4.2.

  1. If βa≤aˉa\beta_a \le\bar{a}_a, then at every state with d>Dσd>D_\sigma and hk≥0h_k\ge0 some input of aa satisfies it.

  1. If βa>aˉa\beta_a>\bar{a}_a, there is a state with hk=0h_k=0 at which every input of aa violates the inequality, and for a zone, or a human who accelerates toward the robot, there is a state with hk>0h_k>0 from which every admissible input of aa leads into the keep-out region.

Part 1 follows from bk≤Akb_k\le A_k on {hk≥0}\{h_k\ge0\}, and part 2 from a head-on approach along a coordinate axis. Let ΣT\Sigma_{\mathcal{T}} be the set of concept names that occur in safety axioms or in TBox axioms other than inclusions between two concept names.

Theorem 4 (Certificate inheritance) Let the team composition κ′\kappa' differ from κ\kappa on J⊆IJ\subseteq\mathcal{I}, and for every i∈Ji\in J let T⊨κ′(i)⊑κ(i)\mathcal{T}\models\kappa'(i)\sqsubseteq\kappa(i), let κ′(i)\kappa'(i) and κ(i)\kappa(i) have the same subsumers in ΣT\Sigma_{\mathcal{T}}, the same payload offset and the same capability, βκ′(i)=βκ(i)\beta_{\kappa'(i)}=\beta_{\kappa(i)}.

  1. For all near and carries relations, κ\kappa and κ′\kappa' yield the same constraints, barriers and weights.

  1. If κ′(i)⪯dynκ(i)\kappa'(i)\preceq_{\mathrm{dyn}}\kappa(i) for all i∈Ji\in J, every family that is jointly valid for κ\kappa on X\mathcal{X} is jointly valid for κ′\kappa' on X\mathcal{X}, and every QP (5) that is feasible under κ\kappa is feasible under κ′\kappa'.

  1. For double integrators with box input sets and βκ(i)=aˉκ(i)\beta_{\kappa(i)}=\bar{a}_{\kappa(i)}, every barrier inequality of agent i∈Ji\in J is feasible at all states with d>Dσd>D_\sigma and hk≥0h_k\ge0 if and only if κ′(i)⪯dynκ(i)\kappa'(i)\preceq_{\mathrm{dyn}}\kappa(i). If κ′(i)̸⪯dynκ(i)\kappa'(i)\not\preceq_{\mathrm{dyn}}\kappa(i), the zero-superlevel set of an inherited zone or human barrier contains states from which every admissible input of agent ii leads into the keep-out region.

Proof sketch. Entailment is monotone and equal subsumers in ΣT\Sigma_{\mathcal{T}} add no axiom instance (Lemma 8), so the inequalities are unchanged, and any witness or feasible QP input for κ\kappa remains one for κ′\kappa' because the velocity sets grow. Part 3 is Lemma 3 with capability aˉκ(i)\bar{a}_{\kappa(i)} and bound aˉκ′(i)\bar{a}_{\kappa'(i)}.

Part 3 shows that, for box-bounded double integrators, the capability of the parent keeps every inherited barrier inequality feasible exactly when the subclass is also a dynamic subtype. Lemma 8 applies to any entity, so a payload subclass with the same subsumers in ΣT\Sigma_{\mathcal{T}}, such as Chemical, leaves the active constraints unchanged. Typing a Payload as HazardousPayload changes them, since its carrier becomes a HazardCarrier. Appendix A extends the theorem to other state spaces through a C1C^1 map π\pi with VC(π(x′))⊆Dπ(x′)VC′(x′)V_{\mathcal{C}}(\pi(x'))\subseteq D_{\pi}(x')V_{\mathcal{C}'}(x'), as for a unicycle, and to inclusions up to a margin.

Assumption 1 (Activation margin) Every constraint kk entering Kt\mathcal{K}_t at time tkt_k has hk(x(tk))>0h_k(x(t_k))>0.

As relations switch, Assumption 1 holds for sensed relations if closing speeds are bounded by vˉ\bar{v} and ρ>Dσ+δ+vˉ2/(2Ak)\rho>D_\sigma+\delta+\bar{v}^2/(2A_k), because a constraint activates at distance ρ\rho (Lemma 11). At nominal speeds our pairs need at most 6.34 m, for a HeavyDrone and a human, and we use ρ=7\rho=7 m. For relations asserted by the task layer, the activation check enforces it.

Proposition 5 (Invariance under switching). Suppose that Kt\mathcal{K}_t changes finitely often on bounded intervals, that Assumption 1 holds, and that hk(x(0))>0h_k(x(0)) > 0 for all k∈K0k \in\mathcal{K}_0. If the inputs applied along an absolutely continuous closed-loop trajectory satisfy every barrier inequality of every agent for almost every t∈[0,T]t \in[0,T], then x(t)∈Stx(t) \in\mathcal{S}_t for all t∈[0,T]t \in[0,T].

The proof applies the comparison lemma between switches, which keeps every active hkh_k positive and every distance above the keep-out, where hkh_k is differentiable.

Proposition 6 (Loss of safety starts with a conflict). Let the first three hypotheses of Proposition 5 hold, let the closed-loop trajectory be absolutely continuous, let every class satisfy aˉh<βC≤aˉC\bar{a}_h < \beta_C \le\bar{a}_C, and let every agent apply the solution of its QP whenever that QP is feasible. Suppose that the state first leaves the zero-superlevel set of an active barrier at t∘t^\circ. Then some constraint kk, active on [tk,t∘][t_k,t^\circ] with tk<t∘t_k < t^\circ, has hk(x(t∘))=0h_k(x(t^\circ)) = 0, and some agent of kk has an infeasible QP on a subset of [tk,t∘)[t_k,t^\circ) of positive measure, with each of its barrier inequalities feasible on its own at those times.

Before t∘t^\circ every active barrier is nonnegative, so Lemma 3 makes each inequality feasible, and an infeasible QP can only come from inequalities that exclude each other. Such conflicts are a property of pairwise barriers, independent of the ontology.

Proposition 7 (Unavoidable conflicts). Consider three double integrators with input sets [−aˉ,aˉ]2[-\bar{a},\bar{a}]^2, capabilities β=aˉ\beta= \bar{a} and the robot–robot barriers (3) with Ak=2aˉA_k = 2\bar{a} and keep-out DD. There is a state with all three barriers positive from which every admissible input of the robots brings two of them closer than DD.

Two robots approach a third from opposite sides, and each pairwise barrier assumes that the middle robot devotes its full braking to that pair. Hence no controller renders the zero-superlevel set of pairwise braking barriers forward invariant, and a certificate for them holds only on a strict subset X\mathcal{X} of it, which makes precise the remark of Wang et al. [34] that their QP may become infeasible in crowded scenes. A chain of mm robots extends the construction to capabilities β=θaˉ\beta= \theta\bar{a} whenever θ(m−1)>1\theta(m-1) > 1, so every fixed capability reduction leaves such conflicts in large enough teams.

Experiments

Setup. Each 12×1212 \times12 m warehouse tile (Appendix § 11) contains two drones that carry parcels across a restricted zone binding only Ground agents, four carriers with payloads, two of them hazardous, and two patrolling rovers. Its four humans ignore the robots, walk at up to 0.80.8 m/s and accelerate at up to 0.50.5 m/s2^2. Besides the robot–robot (0.3 m), robot–human (0.5 m), aerial–human (1.0 m) and ground–zone (1.0 m) axioms, payloads keep 0.8 m and hazardous payloads 2.0 m from people. Episodes last 40 s with a zero-order hold of 0.05 s, whose inter-sample effect we do not bound (Breeden et al., [5]), ρ=7\rho= 7 m, and γ=1\gamma= 1 is selected on validation episodes. W0 is the design team (Drone, Rover and Carrier with Payload and HazardousPayload). W1 replaces the two drones by a LightDrone and a HeavyDrone and one carrier by a Forklift. W2 types the hazardous payloads as Chemical, W3 lets a LightDrone carry a Chemical and a Drone carry a HazardousPayload, two unlisted combinations, and W4 tiles W0 2×22 \times2 (N=32N = 32).

Methods and metrics. All filters share the barrier (3), the QP (5) and, unless stated otherwise, the activation check, so they differ only in where their constraints and capabilities come from. None applies uinomu_i^{\mathrm{nom}} directly. Flat replaces the ontology by hand-written tables of keep-outs and capabilities for the design classes and (robot, payload) pairs, with defaults for unlisted classes (mean design capability 1.4 m/s2^2, keep-outs 0.5 m and 0.8 m), and Flat-cons uses the most conservative listed values as defaults. No-chain drops property chains, Naive inherits capabilities along ⊑\sqsubseteq without the dynamic-subtype test, Untyped treats every payload as hazardous, and No-act. omits the activation check. Covering W1–W3 requires 10 ontology statements in OntoCBF and 18 table entries in Flat, and all methods use the same go-to-goal PD controller, except MAPPO, on 100 seeds per scenario. A violation is a distance below DσD_\sigma for a constraint entailed under the true classes, so Flat and No-chain are also judged on the constraints they omit.

Missing constraints

OntoCBF runs unchanged in all scenarios with the same safety axioms, and W2 reproduces W0 seed by seed, as Lemma 8 predicts. In W1 the HeavyDrone and the Forklift run with their own capabilities, for which a certificate is still to be established. Under OntoCBF, 20–70 % of the episodes contain a violation, and an episode has 5.6–47.9 violating steps out of 800 on average, against 100 % and 551–754 steps without a filter (Table 2 and Table 12, intervals in Table 5). Flat performs like OntoCBF on the design team (20 % against 22 %, where OntoCBF keeps one inequality per entailed axiom and Flat one per table entry) and violates safety in at least 89 % of the episodes of W1–W3, mostly through the omitted aerial–human axiom in W1 (76.2 violating constraint-steps per episode against 1.9) and the omitted hazard keep-out in W2 and W3. Flat-cons, which treats every unlisted robot or pair like the weakest and most restricted listed one, violates safety less often than OntoCBF in every scenario, most of all in W3 (28 against 40 %). Its zone default stops the unseen drones, so it achieves 65 and 91 % of the deliveries of OntoCBF in W1 and W3. Its capability default is valid only because every unseen class brakes at least as strongly as the weakest design class (Lemma 3). Untyped has fewer episodes with a violation in every scenario and achieves 66 % of the ordinary deliveries of OntoCBF in W0. Removing the property chain, the robot or payload taxonomy, or the defined class produces violations in at least 79 % of the episodes where the element is needed and reproduces OntoCBF seed by seed elsewhere (Table 7 and Table 8). Without the activation check, 217 pickups in W3 begin inside a keep-out region (Table 7).

ScenarioFlatFlat-consNo-chainNaiveUntypedNo-act.OntoCBFMAPPOFlatNaiveOntoCBF
W0 (design)20201002216742212000
W1 (unseen robots)891710023177220111822660
W2 (unseen payload)99201002216742212000
W3 (unseen combination)100281004037964026000
W4 (N=32N=32)67671007069987065000

Table 2. Episodes with a violation (left, 100 % for None everywhere) and single-constraint failures summed over episodes (right, zero for all other methods), 100 seeds per cell, all with the PD controller except MAPPO, which runs behind OntoCBF (3 training runs pooled).

ScenarioNoneFlatFlat-consNo-chainNaiveUntypedNo-act.OntoCBF
W0 (design)100 [96, 100]20 [13, 29]20 [13, 29]100 [96, 100]22 [15, 31]16 [10, 24]74 [65, 82]22 [15, 31]
W1 (unseen robots)100 [96, 100]89 [81, 94]17 [11, 26]100 [96, 100]23 [16, 32]17 [11, 26]72 [63, 80]20 [13, 29]
W2 (unseen payload)100 [96, 100]99 [95, 100]20 [13, 29]100 [96, 100]22 [15, 31]16 [10, 24]74 [65, 82]22 [15, 31]
W3 (unseen combination)100 [96, 100]100 [96, 100]28 [20, 37]100 [96, 100]40 [31, 50]37 [28, 47]96 [90, 98]40 [31, 50]
W4 (N=32N=32)100 [96, 100]67 [57, 75]67 [57, 75]100 [96, 100]70 [60, 78]69 [59, 77]98 [93, 99]70 [60, 78]

Table 5. Episodes with a violation (%) in the warehouse with 95 % Wilson intervals, PD controller, 100 seeds per cell.

ScenarioWithoutMeasureAblationOntoCBF
W0 (design)property chainpayload+hazard viol.500.05.2
W1 (unseen robots)robot taxonomyaerial–human viol.150.71.9
W1 (unseen robots)dynamic-subtype testsingle-constraint failures (total)2660
W2 (unseen payload)payload taxonomyhazard–human viol.360.14.4
W3 (unseen combination)defined classhazard–human viol.835.028.2
W3 (unseen combination)activation checkpickups into a violation (total)2170
W0 (design)hazard distinctiondeliveries / courier (ordinary)1.362.06

Table 7. Ablations that remove one element of OntoCBF, each in the scenario that needs the element. Violations are counted in constraint-steps per episode, and single-constraint failures and pickups into a violation are summed over 100 episodes.

ScenarioNo robot tax.No payload tax.No defined classOntoCBF
W0 (design)===22
W1 (unseen robots)100==20
W2 (unseen payload)=99=22
W3 (unseen combination)7910010040
W4 (N=32N=32)===70

Table 8. Episodes with a violation (%) under single-element ablations where the element is needed, PD controller, 100 seeds. The sign = marks scenarios in which the ablation acts exactly as OntoCBF, seed by seed, and all three ablations have zero single-constraint failures.

ScenarioPDMAPPONo filter
Viol.Inf. %Deliv.Viol.Inf. %Deliv.Viol. ep. %
W0 (design)6.11.201.763.10.731.73100
W1 (unseen robots)5.61.151.643.30.751.69100
W2 (unseen payload)6.11.201.763.10.731.73100
W3 (unseen combination)16.01.621.439.00.951.43100
W4 (N=32N=32)47.92.211.8039.61.811.69100

Table 12. PD and MAPPO behind OntoCBF, 100 paired seeds per cell. MAPPO pools 3 runs trained in W0 only, so its cells hold 3×1003 \times100 episodes, and the intervals in § 6 resample training runs and then seeds. The columns give violating steps per episode (Viol.), infeasible QPs as a percentage of agent-steps with active constraints (Inf.) and deliveries per courier (Deliv.), and the last column gives the percentage of episodes with a violation for MAPPO without the filter.

Overestimated capabilities

A HeavyDrone heads for a goal through a human who walks straight at it, from 91 initial states inside the safe set of its own capability (Figure 3). Under Naive, which gives it the capability of Drone, single-constraint failures occur in 1 % of the encounters at γ=1\gamma= 1, 13 % at γ=3\gamma= 3 and 100 % at γ=30\gamma= 30. From γ=10\gamma= 10 on they lead to violations, in 48 % of the encounters at γ=30\gamma= 30 with distances down to 0.75 m against a keep-out of 1.0 m, as part 3 of Theorem 4 predicts. OntoCBF stays free of failures and violations at every gain. Small gains brake early, so an overestimated capability appears as single-constraint failures before it appears as violations. In W1, Naive causes 266 single-constraint failures at γ=1\gamma= 1 and, at γ=10\gamma= 10, violates safety in 44 % of the episodes against 21 % for OntoCBF (Table 4). Joint validity, decided by a linear program at each of the 78,837 states visited in W0 (Table 11), holds for the design family at 94.4 % of them. HeavyDrones under the capability of Drone break it at 853 of these states, and with their own capability they form a new family, valid at 91.6 % of the states where the design family is.

Figure 3. Stress test of the capability assignment for HeavyDrone (§ 6.2) in head-on encounters with a human, all starting inside the safe set of the true capability. Under Naive the HeavyDrone inherits the capability of Drone, and OntoCBF assigns it its own capability. The left panel shows the encounters with a single-constraint failure and the right panel those with a violation.

γ\gammaNaiveOntoCBFMcNemar ppviolating stepsaerial–humanfailures (Naive)NaiveOntoCBF
123200.63+0.8 [−2.6, +4.3]−0.2 [−1.5, +1.0]2661.791.64
327210.26+1.9 [−0.6, +4.3]+3.1 [+0.4, +6.1]9072.001.87
104421<0.001+2.9 [−0.6, +6.3]+2.3 [−3.1, +7.3]22232.132.02

Table 4. Naive and OntoCBF in W1 (unseen robots) as the class-K\mathcal{K} gain grows, with the PD controller and 100 paired seeds (γ=1\gamma= 1 is the main setting). Differences carry paired 95 % bootstrap intervals, and pp comes from McNemar’s exact test on episodes with a violation. OntoCBF has zero single-constraint failures at every gain.

Configuration (two drones substituted)StatesJointly validAll per-agent QPs feasibleValid where the design team is
Drone (design)7883794.43 %92.44 %74442/74442
LightDrone, inherited β=2.0\beta=2.07883794.57 %92.56 %74442/74442
HeavyDrone, β=2.0\beta=2.0 (Naive)7883793.34 %91.56 %73589/74442
HeavyDrone, own β=1.0\beta=1.06484587.11 %84.79 %56485/61668

Table 11. Joint validity (Definition 2) on the states visited by the design team in W0, with both drones substituted.

Conflicts between constraints

Each of the 466 violation onsets in W0, W1, W3 and W4 follows, within 1 s, a conflict of an agent of the violated constraint, consistent with Proposition 6 in continuous time, so every episode with a violation also has a conflict. Conflicts precede only 1.9–3.3 % of all agent-steps within the same window (Table 10). Of all infeasible QPs, 98 % are conflicts, and the rest contain an inequality whose barrier is already negative. Conflicts arise mostly when humans close in on a drone or a hazardous carrier, and the median deepest intrusion is 10–17 % of DσD_\sigma. At 56–68 % of the onsets the robot was not moving toward the other entity. The filter takes at most 6.1 ms per step and the full reasoning step 4.6 ms per event on one CPU core (Table 9).

ScenarioDeliveries/courier NoneDeliveries/courier OntoCBFQP infeas. (%)Filter (ms/step)Events/ep.Reasoning (ms/event)
W0 (design)2.671.761.21.402680.91
W1 (unseen robots)2.831.641.11.422670.91
W2 (unseen payload)2.671.761.21.402680.91
W3 (unseen combination)2.671.431.61.582620.93
W4 (N=32N=32)2.671.802.26.107744.60

Table 9. Deliveries per courier in the warehouse without a filter and with OntoCBF, and computational cost of OntoCBF with the PD controller on one CPU core.

ScenarioOnsetsOnsets after a conflict within 1 sOnsets after a conflict within 2 sBase rate (agent-steps) allBase rate (agent-steps) close encounter
W0 (design)4545452.0 %3.9 %
W1 (unseen robots)3131311.9 %3.7 %
W3 (unseen combination)1081081082.6 %4.6 %
W4 (N=32N=32)2822822823.3 %6.4 %

Table 10. Violation onsets of OntoCBF with PD preceded by a conflict of an agent of the violated constraint, and base rates over agent-steps (window 1 s).

Learning in the loop

Behind the MAPPO policy of § 4.4, trained in W0 only, episodes with a violation fall from 20–70 % to 11–65 % (Table 2). The rate of infeasible QPs per agent-step with active constraints, almost all of them conflicts, drops by 18–41 % in every scenario, with paired 95 % bootstrap intervals below zero over runs and seeds and in each of the 3 runs (Table 13). Mean violating steps per episode change by −8.3 to −2.3, significantly only in W3 (−6.98 [−12.47, −1.70]), deliveries per courier by −0.11 to +0.04, and without the filter the policy violates safety in every episode.

ScenarioRunΔ\Delta infeasible QPs / ep.Δ\Delta violating steps / ep.Δ\Delta deliveries / courier
W0 (design)1−23.9 [−37.7,−10.5]-23.9\ [-37.7,-10.5]−1.3 [−5.3,+2.7]-1.3\ [-5.3,+2.7]−0.01 [−0.05,+0.04]-0.01\ [-0.05,+0.04]
2−34.4 [−47.6,−21.6]-34.4\ [-47.6,-21.6]−4.4 [−7.8,−1.6]-4.4\ [-7.8,-1.6]+0.04 [−0.01,+0.08]+0.04\ [-0.01,+0.08]
3−32.0 [−47.0,−16.4]-32.0\ [-47.0,-16.4]−3.2 [−7.1,+0.7]-3.2\ [-7.1,+0.7]−0.12 [−0.17,−0.07]-0.12\ [-0.17,-0.07]
W1 (unseen robots)1−26.0 [−38.3,−13.7]-26.0\ [-38.3,-13.7]−2.3 [−5.7,+1.0]-2.3\ [-5.7,+1.0]+0.01 [−0.04,+0.05]+0.01\ [-0.04,+0.05]
2−23.4 [−36.0,−10.9]-23.4\ [-36.0,-10.9]−2.8 [−5.9,+0.2]-2.8\ [-5.9,+0.2]+0.05 [+0.01,+0.10]+0.05\ [+0.01,+0.10]
3−27.3 [−40.4,−13.6]-27.3\ [-40.4,-13.6]−1.9 [−5.5,+1.5]-1.9\ [-5.5,+1.5]+0.08 [+0.03,+0.12]+0.08\ [+0.03,+0.12]
W3 (unseen combination)1−31.6 [−45.8,−17.8]-31.6\ [-45.8,-17.8]−4.3 [−10.0,+1.1]-4.3\ [-10.0,+1.1]−0.04 [−0.09,+0.02]-0.04\ [-0.09,+0.02]
2−50.4 [−65.9,−35.5]-50.4\ [-65.9,-35.5]−7.6 [−12.9,−2.8]-7.6\ [-12.9,-2.8]+0.05 [−0.01,+0.10]+0.05\ [-0.01,+0.10]
3−46.2 [−63.8,−28.6]-46.2\ [-63.8,-28.6]−9.0 [−14.5,−3.8]-9.0\ [-14.5,-3.8]−0.02 [−0.07,+0.03]-0.02\ [-0.07,+0.03]
W4 (N=32N=32)1−167.3 [−218.6,−119.4]-167.3\ [-218.6,-119.4]−24.2 [−34.7,−14.5]-24.2\ [-34.7,-14.5]−0.15 [−0.18,−0.12]-0.15\ [-0.18,-0.12]
2−92.0 [−139.7,−43.3]-92.0\ [-139.7,-43.3]−7.8 [−16.1,+0.6]-7.8\ [-16.1,+0.6]−0.05 [−0.08,−0.02]-0.05\ [-0.08,-0.02]
3−49.2 [−97.7,−1.8]-49.2\ [-97.7,-1.8]+7.2 [−4.8,+19.1]+7.2\ [-4.8,+19.1]−0.13 [−0.16,−0.10]-0.13\ [-0.16,-0.10]

Table 13. MAPPO minus PD behind OntoCBF for each training run (W2 equals W0), with paired 95 % bootstrap intervals over the 100 seeds (10,000 resamples). Violating steps fall significantly in 4 of the 12 run–scenario cells.

Conclusion

OntoCBF makes a domain ontology the specification of a multi-robot safety filter, in which entailment removes missing constraints and the dynamic-subtype test, exact for box-bounded double integrators, removes overestimated capabilities. Conflicts between constraints remain possible with pairwise barriers (Proposition 7), and a policy trained in W0 alone makes them less frequent. The guarantees hold in continuous time for double integrators and humans with acceleration bounded by aˉh\bar{a}_h, and they rely on correct class labels and measured profiles, since each entity is constrained only by the axioms of the classes entailed for it (Appendix B). Verified certificates, fail-safe defaults for unknown labels, axiom priorities that favor people, and nonlinear classes are the next steps.

Generative AI Use

Generative AI tools were used for coding and experimental implementation, literature search, and writing and editing. The authors checked all AI-assisted content and take full responsibility for the paper.

Proofs

The constructions in part 2 of Lemma 3, part 3 of Theorem 4 and Proposition 7 show entry into the keep-out used in the barrier, which for the filter is Dσ+δD_{\sigma}+\delta (§ 4.3).

Barrier derivative and barrier inequalities

Let k=(σ,a,b)k=(\sigma,a,b) be a constraint with d=∥Δp∥>Dσd=\lVert\Delta p\rVert>D_{\sigma}, n=Δp/dn=\Delta p/d and ℓ=2Ak(d−Dσ)>0\ell=\sqrt{2A_k(d-D_{\sigma})}>0. The payload offset is constant, so ddtΔp=Δv\frac{d}{dt}\Delta p=\Delta v for every type of constraint, d˙=nTΔv\dot{d}=n^{\mathsf{T}}\Delta v, and n˙=(I−nnT)Δv/d\dot{n}=(I-nn^{\mathsf{T}})\Delta v/d. Differentiating (3) gives

h˙k=AknTΔvℓ+∥Δv∥2−(nTΔv)2d+nT(v˙a−v˙b),(6)\dot{h}_k=\frac{A_k n^{\mathsf{T}}\Delta v}{\ell}+\frac{\lVert\Delta v\rVert^2-(n^{\mathsf{T}}\Delta v)^2}{d}+n^{\mathsf{T}}(\dot{v}_a-\dot{v}_b), \tag*{(6)}

so h˙k≥−γhk3\dot{h}_k\geq-\gamma h_k^3 is equivalent to (4). For two robots, adding nTua≥wabbkn^{\mathsf{T}}u_a\geq w_{ab}b_k and −nTub≥wbbbk-n^{\mathsf{T}}u_b\geq w_{bb}b_k with wa+wb=1w_a+w_b=1 yields nT(ua−ub)≥bkn^{\mathsf{T}}(u_a-u_b)\geq b_k. For a robot and a human with ∥v˙h∥≤aˉh\lVert\dot{v}_h\rVert\leq\bar{a}_h, the inequality nTua≥bk+aˉhn^{\mathsf{T}}u_a\geq b_k+\bar{a}_h yields nT(ua−v˙h)≥nTua−aˉh≥bkn^{\mathsf{T}}(u_a-\dot{v}_h)\geq n^{\mathsf{T}}u_a-\bar{a}_h\geq b_k for every admissible acceleration of the human. For a zone, v˙b=0\dot{v}_b=0. Hence, whenever the agents of kk satisfy their barrier inequalities, h˙k≥−γhk3\dot{h}_k\geq-\gamma h_k^3 holds for all admissible human accelerations. The curvature term in (6) is nonnegative, so hk≥0h_k\geq0 is sufficient for braking at rate AkA_k along nn to stop the approach at a distance of at least DσD_{\sigma}, and tangential motion can only increase that distance.

Single-constraint feasibility

Proof [of Lemma 3] Part 1. Let d>Dσd>D_{\sigma} and hk≥0h_k\geq0. In bkb_k, the first term −γhk3-\gamma h_k^3 is nonpositive and the third term is nonpositive by the Cauchy–Schwarz inequality. If nTΔv≥0n^{\mathsf{T}}\Delta v\geq0, the second term is nonpositive as well. Otherwise hk≥0h_k\geq0 gives ℓ≥−nTΔv>0\ell\geq-n^{\mathsf{T}}\Delta v>0, so the second term is at most AkA_k. Hence bk≤Akb_k\leq A_k. The right-hand side rr of the barrier inequality of agent aa therefore satisfies r=wabk≤waAk=βar=w_ab_k\leq w_aA_k=\beta_a for a robot pair, r=bk+aˉh≤Ak+aˉh=βar=b_k+\bar{a}_h\leq A_k+\bar{a}_h=\beta_a for a human, and r=bk≤Ak=βar=b_k\leq A_k=\beta_a for a zone. The input u⋆=aˉa(sign⁡n1,sign⁡n2)u^\star=\bar{a}_a(\operatorname{sign}n_1,\operatorname{sign}n_2) lies in the box and gives nTu⋆=aˉa(∣n1∣+∣n2∣)≥aˉa∥n∥=aˉa≥βa≥rn^{\mathsf{T}}u^\star=\bar{a}_a(|n_1|+|n_2|)\geq\bar{a}_a\lVert n\rVert=\bar{a}_a\geq\beta_a\geq r. Inside the filter margin the implementation replaces bkb_k by AkA_k, which keeps r≤βar\leq\beta_a.

Part 2, a state with hk=0h_k=0. Let βa>aˉa\beta_a>\bar{a}_a, pick d>Dσd>D_{\sigma}, and set n=(1,0)n=(1,0) and Δv=(−ℓ,0)\Delta v=(-\ell,0). Then hk=0h_k=0, the curvature term vanishes and bk=Akb_k=A_k, so the right-hand side equals βa\beta_a for each type of constraint. Every input in the box violates the inequality, because max⁡u∈[−aˉa,aˉa]2(1,0)u=aˉa<βa\max_{u\in[-\bar a_a,\bar a_a]^2}(1,0)u=\bar a_a<\beta_a.

Part 2, an unavoidable violation at a zone. Write D=DσD=D_\sigma and aˉ=aˉa\bar a=\bar a_a, place the zone at the origin, and fix β′∈(aˉ,βa)\beta'\in(\bar a,\beta_a) and s>0s>0. The agent starts at p(0)=(D+ε,0)p(0)=(D+\varepsilon,0) with v(0)=(−s,0)v(0)=(-s,0) and ε=s2/(2β′)\varepsilon=s^2/(2\beta'), so that hk(x(0))=s(βa/β′−1)>0h_k(x(0))=s(\sqrt{\beta_a/\beta'}-1)>0. Let u(⋅)u(\cdot) be any measurable input with values in [−aˉ,aˉ]2[-\bar a,\bar a]^2, and let t⋆=s/aˉt^\star=s/\bar a. Integrating twice,

D+ε−st−12aˉt2≤p1(t)≤D+ε−st+12aˉt2,∣p2(t)∣≤12aˉt2.D+\varepsilon-st-\frac{1}{2}\bar a t^2\le p_1(t)\le D+\varepsilon-st+\frac{1}{2}\bar a t^2,\qquad|p_2(t)|\le\frac{1}{2}\bar a t^2.

At t⋆t^\star these bounds give D−3s22aˉ≤p1(t⋆)≤D−cs2D-\frac{3s^2}{2\bar a}\le p_1(t^\star)\le D-cs^2 with c=12(1/aˉ−1/β′)>0c=\frac{1}{2}(1/\bar a-1/\beta')>0, and ∣p2(t⋆)∣≤s2/(2aˉ)|p_2(t^\star)|\le s^2/(2\bar a). If s2<min⁡{2aˉD/3,D/c,2cD/(c2+1/(4aˉ2))}s^2<\min\{2\bar aD/3,D/c,2cD/(c^2+1/(4\bar a^2))\}, then 0<p1(t⋆)≤D−cs20<p_1(t^\star)\le D-cs^2 and

∥p(t⋆)∥2≤(D−cs2)2+s44aˉ2=D2−2cDs2+(c2+14aˉ2)s4<D2,\|p(t^\star)\|^2\le(D-cs^2)^2+\frac{s^4}{4\bar a^2}=D^2-2cDs^2+\left(c^2+\frac{1}{4\bar a^2}\right)s^4<D^2,

so the agent is inside the keep-out region at t⋆t^\star for every admissible input.

Part 2, an unavoidable violation with a human. Let the human start at the origin at rest and accelerate toward the robot with v˙h=(aˉh,0)\dot v_h=(\bar a_h,0). In relative coordinates Δp=pa−ph\Delta p=p_a-p_h, the first component of Δp¨\ddot{\Delta p} lies in [−aˉa−aˉh,a^][-\bar a_a-\bar a_h,\hat a] with a^=aˉa−aˉh\hat a=\bar a_a-\bar a_h, and the second lies in [−aˉa,aˉa][-\bar a_a,\bar a_a]. The barrier uses Ak=βa−aˉh>a^A_k=\beta_a-\bar a_h>\hat a. The zone argument with β′∈(max⁡{a^,0},Ak)\beta'\in(\max\{\hat a,0\},A_k), ε=s2/(2β′)\varepsilon=s^2/(2\beta'), t⋆=s/β′t^\star=s/\beta', upper acceleration bound a^\hat a, lower bound −aˉa−aˉh-\bar a_a-\bar a_h and lateral bound aˉa\bar a_a gives hk(x(0))>0h_k(x(0))>0 and Δp1(t⋆)≤D−s2(1−a^/β′)/(2β′)\Delta p_1(t^\star)\le D-s^2(1-\hat a/\beta')/(2\beta'), so ∥Δp(t⋆)∥<D\|\Delta p(t^\star)\|<D for all sufficiently small s>0s>0, whatever the sign of a^\hat a.

For the zone, the conditions s2≤2aˉDmin⁡{1/3,1−aˉ/β′}s^2\le2\bar aD\min\{1/3,1-\bar a/\beta'\} suffice, and with aˉ=1\bar a=1, βa=2\beta_a=2, β′=1.5\beta'=1.5 and D=1D=1 m they allow s≤0.81s\le0.81 m/s. At s=0.8s=0.8 m/s the barrier starts at 0.120.12 m/s and the largest reachable distance at t⋆t^\star is at most 0.950.95 m. Smallness of ss is needed in this argument, since at large speeds a robot may swerve around the keep-out region. For a general compact convex input set UU containing the origin, the argument of part 1 shows that every barrier inequality is feasible on {hk≥0}\{h_k\ge0\} if and only if βa≤min⁡∥n∥=1max⁡u∈Un⊤u\beta_a\le\min_{\|n\|=1}\max_{u\in U}n^\top u, the inradius of UU about the origin. Inclusion UC⊆UC′U_C\subseteq U_{C'} implies this inequality for an inherited capability, and joint validity in Theorem 4 needs the inclusion itself, because a joint witness may use a corner of UCU_C.

Axiom equivalence and certificate inheritance

Let ΣT\Sigma_T be the set of concept names that occur in safety axioms or in TBox axioms other than inclusions between two concept names (definitions, disjointness axioms, domain and range restrictions). For the TBox of Section B, ΣT\Sigma_T consists of Entity, Agent, Object, ControlledAgent, UncontrolledAgent, Aerial, Ground, Human, Payload, HazardousPayload, RestrictedZone and HazardCarrier. Axioms that tie a class to a role, such as C⊑∃r.{h}C\sqsubseteq\exists r.\{h\}, put CC in ΣT\Sigma_T, so a class that adds constraints for other individuals in this way has subsumers in ΣT\Sigma_T that differ from those of its parent.

Lemma 8 (Axiom equivalence) Let TT be the TBox of Section B, and let C′⊑CC'\sqsubseteq C be classes with the same subsumers in ΣT\Sigma_T. Let A\mathcal A be an ABox of concept-name and role assertions that contains C(i)C(i), and let A′\mathcal A' be obtained from A\mathcal A by replacing C(i)C(i) with C′(i)C'(i). Then T∪A′T\cup\mathcal A' is consistent if and only if T∪AT\cup\mathcal A is consistent, and both entail the same instances of every safety axiom.

Proof. Since T⊨C′⊑C\mathcal{T} \models C' \sqsubseteq C, every model of T∪A′\mathcal{T} \cup\mathcal{A}' is a model of T∪A\mathcal{T} \cup\mathcal{A}, so T∪A′\mathcal{T} \cup\mathcal{A}' entails everything that T∪A\mathcal{T} \cup\mathcal{A} entails, and consistency of T∪A′\mathcal{T} \cup\mathcal{A}' implies consistency of T∪A\mathcal{T} \cup\mathcal{A}. For the converse, let U\mathcal{U} be a model of T∪A\mathcal{T} \cup\mathcal{A}, and let U′\mathcal{U}' be obtained from U\mathcal{U} by adding iUi^{\mathcal{U}} to the extension of every concept name B∉ΣTB \notin\Sigma_{\mathcal{T}} with T⊨C′⊑B\mathcal{T} \models C' \sqsubseteq B. The ABox A\mathcal{A} consists of assertions of concept names and roles, as in (1), and U′\mathcal{U}' only enlarges extensions, so U′\mathcal{U}' satisfies A\mathcal{A}. It also satisfies C′(i)C'(i), because C′C' either received iUi^{\mathcal{U}} or lies in ΣT\Sigma_{\mathcal{T}}, where it is one of its own subsumers and hence a subsumer of CC. Every safety axiom and every TBox axiom other than an inclusion between two concept names mentions only individuals, roles and concept names in ΣT\Sigma_{\mathcal{T}}, which keep their interpretation in U′\mathcal{U}'. An inclusion B⊑B′B \sqsubseteq B' between concept names can fail in U′\mathcal{U}' only if iUi^{\mathcal{U}} was added to BB, and then T⊨C′⊑B′\mathcal{T} \models C' \sqsubseteq B', so B′B' received iUi^{\mathcal{U}} as well or B′∈ΣTB' \in\Sigma_{\mathcal{T}}, in which case T⊨C⊑B′\mathcal{T} \models C \sqsubseteq B' and iU∈CU⊆B′Ui^{\mathcal{U}} \in C^{\mathcal{U}} \subseteq B'^{\mathcal{U}}. Hence U′\mathcal{U}' is a model of T∪A′\mathcal{T} \cup\mathcal{A}' with the same safety-axiom instances as U\mathcal{U}, so T∪A′\mathcal{T} \cup\mathcal{A}' is consistent whenever T∪A\mathcal{T} \cup\mathcal{A} is, and every instance that T∪A′\mathcal{T} \cup\mathcal{A}' entails is entailed by T∪A\mathcal{T} \cup\mathcal{A}.

The proof never uses C′⊑CC' \sqsubseteq C for the converse direction, so any two classes with the same subsumers in ΣT\Sigma_{\mathcal{T}} yield the same constraints. For example, Forklift and Carrier are siblings with the same subsumers in ΣT\Sigma_{\mathcal{T}}, and Forklift has the larger acceleration limit, so by part 2 of Theorem 4, applied with this weaker hypothesis, the same payload offset and the capability of Carrier, it could reuse the certificate of Carrier. OntoCBF searches for a certificate only along the taxonomy, which is conservative.

Proof [of Theorem 4] Part 1. Applying Lemma 8 to the agents of JJ one at a time shows that, for all near and carries relations, the ABoxes under κ\kappa and under κ′\kappa' entail the same instances of every safety axiom, so Kt\mathcal{K}_{t} is the same. A barrier (3) depends on the classes of its agents only through AkA_k, and AkA_k and the weights depend on the class only through β\beta, which is the same under κ\kappa and κ′\kappa'.

Part 2. Fix x∈Xx \in X and let ξ∈Vκ(x)\xi\in V_{\kappa}(x) satisfy Definition 2 for κ\kappa. For i∈Ji \in J, ξi∈Vκ(i)(xi)⊆Vκ′(i)(xi)\xi_i \in V_{\kappa(i)}(x_i) \subseteq V_{\kappa'(i)}(x_i), and for i∉Ji \notin J the velocity sets coincide, so ξ∈Vκ′(x)\xi\in V_{\kappa'}(x). The functions hkh_k, the index set K\mathcal{K}, the set Ω(x)\Omega(x) and the value α(hk(x))\alpha(h_k(x)) do not depend on the composition by part 1, so ξ\xi satisfies Definition 2 for κ′\kappa'. For the QPs, write each barrier inequality of agent ii as ∇xihk(x)T(fκ(i)(xi)+gκ(i)(xi)u)≥ski(x)\nabla_{x_i}h_k(x)^{\mathsf{T}}(f_{\kappa(i)}(x_i)+g_{\kappa(i)}(x_i)u) \ge s_{ki}(x), which reads nTu≥ckn^{\mathsf{T}}u \ge c_k for double integrators. By part 1, the share skis_{ki} of agent ii is the same under κ\kappa and κ′\kappa'. If uu is feasible for agent i∈Ji \in J under κ\kappa, its velocity fκ(i)(xi)+gκ(i)(xi)uf_{\kappa(i)}(x_i)+g_{\kappa(i)}(x_i)u lies in Vκ′(i)(xi)V_{\kappa'(i)}(x_i), so some u′∈Uκ′(i)u' \in U_{\kappa'(i)} produces the same velocity and satisfies the same inequalities. The payload offset enters the barriers of nearCarried through qσ,aq_{\sigma,a}, which is why the theorem assumes it unchanged.

Part 3. Under κ′\kappa', agent ii has capability β=aˉκ′(i)\beta= \bar{a}_{\kappa'(i)} and input bound aˉκ′(i)\bar{a}_{\kappa'(i)}. By Lemma 3, all its barrier inequalities are feasible at every state with d>Dσd > D_{\sigma} and hk≥0h_k \ge0 if aˉκ(i)≤aˉκ′(i)\bar{a}_{\kappa(i)} \le\bar{a}_{\kappa'(i)}, which is the condition κ′(i)⊑dynκ(i)\kappa'(i) \sqsubseteq_{\mathrm{dyn}} \kappa(i), and otherwise each type of inequality is infeasible at some state with hk=0h_k = 0. The last claim of part 3 is part 2 of Lemma 3.

Feasibility of every QP versus joint validity. If every agent’s QP is feasible at xx, the applied inputs satisfy Definition 2 at xx, because the two shares of a robot pair sum to the barrier condition and each human inequality contains the worst human acceleration. The converse fails for two drones with β=aˉ=2\beta= \bar{a} = 2 and γ=1\gamma= 1 on the first axis, drone bb at 0 with velocity (1,0)(1,0) and drone aa at 0.8 at rest, and a human at 1.914 at rest. The robot pair requires ua,1≥0.5u_{a,1} \ge0.5 and −ub,1≥0.5-u_{b,1} \ge0.5, and the aerial–human constraint of aa requires −ua,1≥0.3-u_{a,1} \ge0.3, so the QP of aa is infeasible, and each of its inequalities is feasible on its own. The inputs ua=(−0.35,0)u_a = (-0.35,0) and ub=(−1.4,0)u_b = (-1.4,0) satisfy the unsplit pair condition ua,1−ub,1≥1u_{a,1} - u_{b,1} \ge1 and both human conditions, so Definition 2 holds. On the states visited in W0 this gap separates the 94.4% of states with joint validity from the 92.4% at which every QP is feasible (Table 11).

Extensions of Theorem 4

Classes with different state spaces. Let πi:Xκ′(i)→Xκ(i)\pi_i : \mathcal{X}_{\kappa'(i)} \to\mathcal{X}_{\kappa(i)}, i∈Ji \in J, be continuously differentiable maps between state spaces with

Vκ(i)(πi(xi′))⊆Dπi(xi′)Vκ′(i)(xi′)for all xi′∈Xi′,(7)V_{\kappa(i)}(\pi_i(x'_i)) \subseteq D\pi_i(x'_i) V_{\kappa'(i)}(x'_i) \quad\text{for all } x'_i \in\mathcal{X}'_i, \tag*{(7)}

and let Π\Pi apply πi\pi_i to the states of the agents in JJ and the identity to all other states.

Proposition 9 (Inheritance through embeddings). Let the hypotheses of Theorem 4 hold with κ′(i)⪯dynκ(i)\kappa'(i) \preceq_{\mathrm{dyn}} \kappa(i) replaced by (7). If {hk}k∈K\{h_k\}_{k\in K} is jointly valid for κ\kappa on X\mathcal{X}, then {hk∘Π}k∈K\{h_k \circ\Pi\}_{k\in K} is jointly valid for κ′\kappa' on {x′:Π(x′)∈X,xi′∈Xi′ for all i∈J}\{x' : \Pi(x') \in\mathcal{X}, x'_i \in\mathcal{X}'_i \text{ for all } i \in J\}.

Proof. Let x′x' be in that set and x=Π(x′)x = \Pi(x'), and take a witness ξ\xi for κ\kappa at xx. For i∈Ji \in J choose ξi′∈Vκ′(i)(xi′)\xi'_i \in V_{\kappa'(i)}(x'_i) with Dπi(xi′)ξi′=ξiD\pi_i(x'_i)\xi'_i = \xi_i, which exists by (7), and set ξi′=ξi\xi'_i = \xi_i for i∉Ji \notin J. By the chain rule, ∇(hk∘Π)(x′)⊤ξ′=∇hk(x)⊤DΠ(x′)ξ′=∇hk(x)⊤ξ\nabla(h_k \circ\Pi)(x')^\top\xi' = \nabla h_k(x)^\top D\Pi(x')\xi' = \nabla h_k(x)^\top\xi, the terms of the uncontrolled entities are unchanged, and (hk∘Π)(x′)=hk(x)(h_k \circ\Pi)(x') = h_k(x), so ξ′\xi' is a witness for κ′\kappa' at x′x'.

Condition (7) is the infinitesimal form of the consistent abstractions of Pappas et al. [27], and it underlies the transfer of CBFs through reduced-order models (Cohen et al., [9]). The barrier hk∘Πh_k \circ\Pi constrains the embedded point, so the keep-out of the physical robot must be stated for that point or enlarged accordingly. The set Xi′\mathcal{X}'_i on which (7) holds must also be kept invariant, which belongs to the certificate of the design team.

A unicycle inheriting from a double integrator. A dynamic unicycle has state x′=(p,θ,s,ω)x' = (p,\theta,s,\omega) and dynamics p˙=s e(θ)\dot{p} = s\,e(\theta), θ˙=ω\dot{\theta} = \omega, s˙=a\dot{s} = a, ω˙=η\dot{\omega} = \eta, with ∣a∣≤amax⁡|a| \le a_{\max}, ∣η∣≤ηmax⁡|\eta| \le\eta_{\max}, e(θ)=(cos⁡θ,sin⁡θ)e(\theta) = (\cos\theta,\sin\theta) and e⊥(θ)=(−sin⁡θ,cos⁡θ)e^\perp(\theta) = (-\sin\theta,\cos\theta). Its look-ahead point q=p+ℓe(θ)q = p + \ell e(\theta) satisfies q˙=s e(θ)+ℓωe⊥(θ)\dot{q} = s\,e(\theta) + \ell\omega e^\perp(\theta) and

q¨=(a−ℓω2)e(θ)+(sω+ℓη)e⊥(θ).\ddot{q} = (a - \ell\omega^2)e(\theta) + (s\omega+ \ell\eta)e^\perp(\theta).

Let π(x′)=(q,q˙)\pi(x') = (q,\dot{q}). The position components of VDI(π(x′))V_{\mathrm{DI}}(\pi(x')) and Dπ(x′)Vuni(x′)D\pi(x')V_{\mathrm{uni}}(x') coincide, and the inclusion (7) of the acceleration components reads [−aˉ,aˉ]2⊆R(θ)([−amax⁡−ℓω2,amax⁡−ℓω2]×[sω−ℓηmax⁡,sω+ℓηmax⁡])[-\bar{a},\bar{a}]^2 \subseteq R(\theta)([-a_{\max}-\ell\omega^2,a_{\max}-\ell\omega^2] \times[s\omega-\ell\eta_{\max},s\omega+\ell\eta_{\max}]), where R(θ)R(\theta) is the rotation by θ\theta. The squares R(−θ)[−aˉ,aˉ]2R(-\theta)[-\bar{a},\bar{a}]^2 cover the disk of radius 2aˉ\sqrt{2}\bar{a} as θ\theta varies, so the inclusion holds for all θ\theta on the envelope ∣s∣≤smax⁡|s| \le s_{\max}, ∣ω∣≤ωmax⁡|\omega| \le\omega_{\max} if

amax⁡−ℓωmax⁡2≥2aˉandℓηmax⁡−smax⁡ωmax⁡≥2aˉ.a_{\max} - \ell\omega_{\max}^2 \ge\sqrt{2}\bar{a} \quad\text{and}\quad \ell\eta_{\max} - s_{\max}\omega_{\max} \ge\sqrt{2}\bar{a}.

These conditions are also necessary for the inclusion at every heading, and on a set of headings Θ\Theta the factor 2\sqrt{2} can be replaced by max⁡θ∈Θ(∣cos⁡θ∣+∣sin⁡θ∣)\max_{\theta\in\Theta}(|\cos\theta| + |\sin\theta|). The barrier then constrains qq, so the keep-out of the robot itself grows by ℓ\ell, and the envelope must be kept invariant, for instance through a speed bound ∥q˙∥≤vˉ\|\dot{q}\| \le\bar{v}, which implies ∣s∣≤vˉ|s| \le\bar{v} and ∣ω∣≤vˉ/ℓ|\omega| \le\bar{v}/\ell. The conditions are demanding, since with aˉ=1 m/s2\bar{a} = 1\,\mathrm{m/s^2}, ℓ=0.1 m\ell= 0.1\,\mathrm{m}, smax⁡=1 m/ss_{\max} = 1\,\mathrm{m/s} and ωmax⁡=2 rad/s\omega_{\max} = 2\,\mathrm{rad/s} they need ηmax⁡≥20+102≈34.1 rad/s2\eta_{\max} \ge20 + 10\sqrt{2} \approx34.1\,\mathrm{rad/s^2}.

Approximate inclusion.

Corollary 10. Let the hypotheses of the Theorem 4 hold with κ′(i)⪯dynκ(i)\kappa^{\prime(i)} \preceq_{\mathrm{dyn}} \kappa^{(i)} replaced by Vκ(i)(xi)⊆Vκ′(i)(xi)⊕BδiV_{\kappa^{(i)}}(x_i) \subseteq V_{\kappa^{\prime(i)}}(x_i) \oplus B_{\delta_i} for i∈Ji \in J. Suppose that the witnesses for κ\kappa satisfy Definition 2 with margin m>0m > 0 (right-hand side −α(hk(x))+m-\alpha(h_k(x)) + m), and that ∣∇xihk(x)⊤e∣≤Lk∥e∥\lvert\nabla_{x_i}h_k(x)^{\top}e\rvert\le L_k\lVert e\rVert for every difference ee between elements of Vκ(i)(xi)V_{\kappa^{(i)}}(x_i) and Vκ′(i)(xi)V_{\kappa^{\prime(i)}}(x_i). If Lk∑i∈Jδi≤mL_k\sum_{i\in J}\delta_i \le m for all kk, then {hk}k∈K\{h_k\}_{k\in K} is jointly valid for κ′\kappa^{\prime}.

Proof. For i∈Ji \in J pick ξi′∈Vκ′(i)(xi)\xi_i^{\prime} \in V_{\kappa^{\prime(i)}}(x_i) with ∥ξi′−ξi∥≤δi\lVert\xi_i^{\prime}-\xi_i\rVert\le\delta_i, and let ξi′=ξi\xi_i^{\prime}=\xi_i otherwise. For every kk and ω∈Ω(x)\omega\in\Omega(x) the left-hand side of Definition 2 decreases by at most Lk∑i∈Jδi≤mL_k\sum_{i\in J}\delta_i \le m, so it remains at least −α(hk(x))-\alpha(h_k(x)).

For the barrier (3) and classes with a common drift, the differences only affect accelerations, which enter through ±n\pm n, so Lk=1L_k=1.

Activation margin from the sensing radius

Lemma 11. Let a constraint kk be activated at time tkt_k by a sensed relation, so that the distance dd of kk equals ρ\rho at tkt_k. For nearCarried, the relation near is sensed at the payload, from which dd is measured. If the closing speed satisfies −n⊤Δv(tk)≤vˉ-n^{\top}\Delta v(t_k) \le\bar v and ρ>Dσ+δ+vˉ2/(2Ak)\rho> D_\sigma+\delta+\bar v^2/(2A_k), then hk(x(tk))≥2Ak(ρ−Dσ−δ)−vˉ>0h_k(x(t_k)) \ge\sqrt{2A_k(\rho-D_\sigma-\delta)}-\bar v > 0.

The proof is immediate from (3) with keep-out Dσ+δD_\sigma+\delta. If an implementation senses the relation at the position of the carrier, ρ\rho must exceed the bound by the payload offset ∥oa∥\lVert o_a\rVert. For the HeavyDrone and a human, aˉHeavyDrone=1.0\bar a_{\mathrm{HeavyDrone}}=1.0, aˉh=0.5\bar a_h=0.5, Dσ=1.0D_\sigma=1.0 m, δ=0.05\delta=0.05 m and vˉ=1.5+0.8\bar v=1.5+0.8 m/s give ρ>6.34\rho>6.34 m, and at ρ=7\rho=7 m the barrier is at least 0.13 m/s at activation. A Drone or LightDrone carrying a hazardous payload needs 3.82 m, and a Carrier with a hazardous payload needs 4.61 m, or 5.31 m if the relation is sensed at the carrier. These values assume nominal speeds, and a HeavyDrone at 2.0 m/s would need more than 7 m, as would a HeavyDrone carrying a hazardous payload, a combination outside all our scenarios. Sampling at 0.05 s moves the activation inward by at most about 0.12 m, which the slack absorbs. If near is retracted only when the distance exceeds ρ+η\rho+\eta for some η>0\eta>0 and relative speeds are bounded by vmax⁡v_{\max}, two activations of the same pair are at least 2η/vmax⁡2\eta/v_{\max} apart. Together with a positive dwell time of task events, this guarantees finitely many switches on bounded intervals.

Invariance under switching

Proof [of Proposition 5] Let 0=t0<t1<⋯<tm≤T0=t_0<t_1<\cdots<t_m\le T be the times in [0,T][0,T] at which KtK_t changes, and set tm+1=Tt_{m+1}=T. For a constraint kk write Dk=Dσ+δD_k=D_\sigma+\delta for the keep-out used by the filter and dkd_k for its distance. We show by induction over jj that every kk active on [tj,tj+1)[t_j,t_{j+1}) satisfies hk(x(t))≥ηk(t)>0h_k(x(t))\ge\eta_k(t)>0 and dk(t)>Dkd_k(t)>D_k for t∈(tj,tj+1]t\in(t_j,t_{j+1}], where ηk\eta_k solves η˙=−γη3\dot\eta=-\gamma\eta^3 with ηk(tj)=hk(x(tj))\eta_k(t_j)=h_k(x(t_j)). At tjt_j, a constraint that was active before satisfies hk(x(tj))>0h_k(x(t_j))>0 by the induction hypothesis and continuity, a newly active one by Assumption 1, and a constraint active at t0=0t_0=0 by hypothesis. Fix such a kk, and let τ\tau be the supremum of the times t∈[tj,tj+1]t\in[t_j,t_{j+1}] such that hk>0h_k>0 and dk>Dkd_k>D_k on (tj,t](t_j,t]. On (tj,τ)(t_j,\tau) the function hkh_k is continuously differentiable along the trajectory, t↦hk(x(t))t\mapsto h_k(x(t)) is absolutely continuous, and the barrier inequalities of the agents of kk hold for almost every tt, so ddthk(x(t))≥−γhk(x(t))3\frac{d}{dt}h_k(x(t))\ge-\gamma h_k(x(t))^3 almost everywhere by Section A.1. The comparison lemma gives hk(x(t))≥ηk(t)h_k(x(t)) \ge\eta_k(t) on [tj,τ)[t_j,\tau), hence hk(x(τ))≥ηk(τ)>0h_k(x(\tau)) \ge\eta_k(\tau) > 0 by continuity. If dk(τ)=Dkd_k(\tau) = D_k, then d˙k(τ)=n⊤Δv(τ)=hk(x(τ))>0\dot{d}_k(\tau) = n^\top\Delta v(\tau) = h_k(x(\tau)) > 0, which is impossible because dk>Dkd_k > D_k on (tj,τ)(t_j,\tau). So dk(τ)>Dkd_k(\tau) > D_k, hk(x(τ))>0h_k(x(\tau)) > 0, and by continuity τ=tj+1\tau= t_{j+1}. Since every active barrier is positive, every active distance exceeds Dk≥DσD_k \ge D_\sigma, and x(t)∈Stx(t) \in S_t for all t∈[0,T]t \in[0,T].

The proof uses the applied inputs only through the barrier inequalities along the realized trajectory, which the infeasible-QP counter of the experiments checks only at the sampling times. The barrier is not continuously differentiable on a neighborhood of the closure of its zero-superlevel set, because its gradient grows without bound as d↓Dkd \downarrow D_k, so the standard invariance theorem for CBFs does not apply verbatim and the strict margin of Assumption 1 is needed. From hk=0h_k = 0, radial braking at exactly rate AkA_k keeps hk=0h_k = 0 and reaches dk=Dkd_k = D_k in finite time. The rule that requires the relative acceleration AkA_k inside the margin makes the inequality discontinuous at dk=Dkd_k = D_k, which is harmless because, by the proof, the distance stays above DkD_k while the barrier stays positive.

Loss of safety starts with a conflict

Proof [of Proposition 6] Let t∘t^\circ be the infimum of the times tt at which some k∈Ktk \in\mathcal{K}_t has dk(t)<Dkd_k(t) < D_k or hk(x(t))<0h_k(x(t)) < 0, which is finite by assumption. Since Kt\mathcal{K}_t changes finitely often, it is constant on (t∘,t∘+ϵ)(t^\circ,t^\circ+\epsilon) for some ϵ>0\epsilon> 0, and some constraint kk of this set has dk(tn)<Dkd_k(t_n) < D_k or hk(x(tn))<0h_k(x(t_n)) < 0 along a sequence tn↓t∘t_n \downarrow t^\circ. Let tk≤t∘t_k \le t^\circ be the time from which kk is active without interruption. If tk=t∘t_k = t^\circ, Assumption 1 and continuity give hk>0h_k > 0 and dk>Dkd_k > D_k near t∘t^\circ, which contradicts the choice of tnt_n, so tk<t∘t_k < t^\circ. By the definition of t∘t^\circ, dk≥Dkd_k \ge D_k and hk≥0h_k \ge0 on [tk,t∘)[t_k,t^\circ). By continuity hk(x(t∘))=0h_k(x(t^\circ)) = 0, because either hkh_k itself turns negative after t∘t^\circ, or dk(t∘)=Dkd_k(t^\circ) = D_k with d˙k(t∘)≤0\dot{d}_k(t^\circ) \le0, and then hk(x(t∘))=n⊤Δv(t∘)=d˙k(t∘)≤0h_k(x(t^\circ)) = n^\top\Delta v(t^\circ) = \dot{d}_k(t^\circ) \le0. Suppose that every agent of kk had a feasible QP for almost every t∈[tk,t∘]t \in[t_k,t^\circ]. These agents then applied inputs that satisfy their barrier inequalities, including those of kk, for almost every tt, and the argument in the proof of Proposition 5, applied to kk alone on [tk,t∘][t_k,t^\circ], gives hk(x(t∘))≥ηk(t∘)>0h_k(x(t^\circ)) \ge\eta_k(t^\circ) > 0, a contradiction. Hence some agent ii of kk has an infeasible QP on a set E⊆[tk,t∘)E \subseteq[t_k,t^\circ) of positive measure. At every t∈Et \in E all active barriers are nonnegative because t<t∘t < t^\circ, so by part 1 of Lemma 3 and βK(i)≤αˉK(i)\beta_{\mathcal{K}(i)} \le\bar{\alpha}_{\mathcal{K}(i)} each barrier inequality of ii is feasible on its own, and the QP of ii is infeasible only because its inequalities exclude each other.

Unavoidable conflicts among three robots

Proof [of Proposition 7] Name the robots aa, mm and cc, fix aˉ′′∈(aˉ,2aˉ)\bar{a}'' \in(\bar{a},2\bar{a}) and s>0s > 0, and let ε=s2/(2aˉ′′)\varepsilon= s^2/(2\bar{a}''). Robot mm starts at the origin at rest, aa at (−(D+ε),0)(- (D+\varepsilon),0) with velocity (s,0)(s,0), and cc at (D+ε,0)(D+\varepsilon,0) with velocity (−s,0)(-s,0). For the pairs (a,m)(a,m) and (c,m)(c,m) we have d=D+εd = D+\varepsilon and n⊤Δv=−sn^\top\Delta v = -s, so h=4aˉε−s=s(2aˉ/aˉ′′−1)>0h = \sqrt{4\bar{a}\varepsilon} - s = s(\sqrt{2\bar{a}/\bar{a}''} - 1) > 0. For the pair (a,c)(a,c), h=4aˉ(D+2ε)−2s>0h = \sqrt{4\bar{a}(D+2\varepsilon)} - 2s > 0 whenever s<aˉDs < \sqrt{\bar{a}D}. Let the three robots apply arbitrary measurable inputs with values in [−aˉ,aˉ]2[-\bar{a},\bar{a}]^2, write pj=(xj,yj)p_j = (x_j,y_j), and let t⋆=s/aˉt^\star= s/\bar{a}. Integrating twice gives xa(t⋆)≥−(D+ε)+s2/(2aˉ)x_a(t^\star) \ge-(D+\varepsilon) + s^2/(2\bar{a}), xc(t⋆)≤D+ε−s2/(2aˉ)x_c(t^\star) \le D+\varepsilon- s^2/(2\bar{a}), and ∣yj(t)∣≤aˉt2/2|y_j(t)| \le\bar{a}t^2/2 for each robot, so

xc(t⋆)−xa(t⋆)≤2D−2cs2withc=12(1aˉ−1aˉ′′)>0,x_c(t^\star)-x_a(t^\star) \le2D-2cs^2 \quad\text{with} \quad c = \frac{1}{2}\left(\frac{1}{\bar{a}}-\frac{1}{\bar{a}''}\right)>0,

and ∣yj(t)−yl(t)∣≤s2/aˉ|y_j(t)-y_l(t)| \le s^2/\bar{a} for all robots j,lj,l and t≤t⋆t \le t^\star. If xm(τ)=xa(τ)x_m(\tau)=x_a(\tau) or xm(τ)=xc(τ)x_m(\tau)=x_c(\tau) for some τ≤t⋆\tau\le t^\star, the two robots concerned are at distance at most s2/aˉs^2/\bar{a} at τ\tau, which is less than DD for s2<aˉDs^{2}<\bar{a}D. Otherwise xa<xm<xcx_a<x_m<x_c on [0,t⋆][0,t^\star], the gaps xm−xax_m-x_a and xc−xmx_c-x_m at t⋆t^\star are positive and sum to at most 2D−2cs22D-2cs^{2}, and the smaller gap is at most D−cs2D-cs^{2}. The corresponding pair is then at distance at most (D−cs2)2+s4/aˉ2\sqrt{(D-cs^{2})^{2}+s^{4}/\bar{a}^{2}}, which is less than DD when s2<2cD/(c2+1/aˉ2)s^{2}<2cD/(c^{2}+1/\bar{a}^{2}). In both cases two robots are closer than DD at some time in [0,t⋆][0,t^\star].

The construction holds for every gain γ\gamma and every filter, because it bounds the reachable positions of all three robots directly. At the boundary state with ham=hcm=0h_{am}=h_{cm}=0 and the same positions, the two barrier conditions read um,1−ua,1≥2aˉu_{m,1}-u_{a,1}\geq2\bar{a} and uc,1−um,1≥2aˉu_{c,1}-u_{m,1}\geq2\bar{a}, which force um,1=aˉu_{m,1}=\bar{a} and um,1=−aˉu_{m,1}=-\bar{a}, so Definition 2 fails there even for one input of the whole team. With different bounds and capabilities, the same argument with approach speeds in the ratio (βa+βm):(βc+βm)(\beta_a+\beta_m):(\beta_c+\beta_m) and t⋆=(sa+sc)/(aˉa+aˉc)t^\star=(s_a+s_c)/(\bar{a}_a+\bar{a}_c) applies whenever βa+βc+2βm>aˉa+aˉc\beta_a+\beta_c+2\beta_m>\bar{a}_a+\bar{a}_c, which always holds for β=aˉ\beta=\bar{a}.

Chains of robots. Let mm robots with bound aˉ\bar{a} and capability β=θaˉ\beta=\theta\bar{a} start on the first axis at xj(0)=(j−1)(D+ε)x_j(0)=(j-1)(D+\varepsilon) with velocities vj(0)=(m+12−j)σe1v_j(0)=\left(\frac{m+1}{2}-j\right)\sigma e_1, so that every adjacent gap closes at speed σ\sigma, and let ε=σ2/(4θ′′aˉ)\varepsilon=\sigma^{2}/(4\theta''\bar{a}) with θ′′∈(1/(m−1),θ)\theta''\in(1/(m-1),\theta). Every adjacent barrier, with Ak=2θaˉA_k=2\theta\bar{a}, equals σ(θ/θ′′−1)>0\sigma\left(\sqrt{\theta/\theta''}-1\right)>0, and the other barriers are positive for small σ\sigma. The inputs of the inner robots do not affect xm−x1x_m-x_1, and braking the two outer robots as hard as possible gives, at t⋆=(m−1)σ/(2aˉ)t^\star=(m-1)\sigma/(2\bar{a}),

xm(t⋆)−x1(t⋆)≤(m−1)(D+ε)−(m−1)2σ24aˉ=(m−1)D−(m−1)σ24aˉ((m−1)−1θ′′),x_m(t^\star)-x_1(t^\star)\leq(m-1)(D+\varepsilon)-\frac{(m-1)^2\sigma^2}{4\bar{a}}=(m-1)D-\frac{(m-1)\sigma^2}{4\bar{a}}\left((m-1)-\frac{1}{\theta''}\right),

which is less than (m−1)D(m-1)D because θ′′(m−1)>1\theta''(m-1)>1. The crossing and lateral bounds of the three-robot case then give two robots closer than DD for small σ\sigma. At the state with the same positions, ε≤D/(m−1)\varepsilon\leq D/(m-1) and every adjacent barrier zero, all other barriers are nonnegative, and the adjacent barrier conditions uj+1,1−uj,1≥2θaˉu_{j+1,1}-u_{j,1}\geq2\theta\bar{a} add up to um,1−u1,1≥2(m−1)θaˉ>2aˉu_{m,1}-u_{1,1}\geq2(m-1)\theta\bar{a}>2\bar{a}, which no inputs in [−aˉ,aˉ]2[-\bar{a},\bar{a}]^{2} achieve, so Definition 2 fails there. Hence, for every θ∈(0,1]\theta\in(0,1], a chain of m>1+1/θm>1+1/\theta robots contains states with positive barriers from which a collision is unavoidable, and no fixed reduction of the capabilities makes pairwise braking barriers jointly valid on their whole safe set for all team sizes.

Ontology and reasoning

Besides the taxonomy of Table 3, the TBox contains ControlledAgent ⊑\sqsubseteq Agent, UncontrolledAgent ⊑\sqsubseteq Agent, Aerial, Ground ⊑\sqsubseteq ControlledAgent, Payload, RestrictedZone ⊑\sqsubseteq Object, Agent, Object ⊑\sqsubseteq Entity, the disjointness axioms for Agent ⊓\sqcap Object, ControlledAgent ⊓\sqcap UncontrolledAgent, Aerial ⊓\sqcap Ground and Payload ⊓\sqcap RestrictedZone, the symmetric role near on Entity, the role carries from ControlledAgent to Payload, the role nearCarried from ControlledAgent to Entity, the chain carries ∘\circ near ⊑\sqsubseteq nearCarried, and the definition HazardCarrier ≡\equiv ControlledAgent ⊓\sqcap ∃\exists carries.HazardousPayload. The safety axioms are near(ControlledAgent, ControlledAgent) with 0.3 m, near(ControlledAgent, Human) with 0.5 m, near(Aerial, Human) with 1.0 m, near(Ground, RestrictedZone) with 1.0 m from the zone center, nearCarried(ControlledAgent, Human) with 0.8 m, and nearCarried(HazardCarrier, Human) with 2.0 m, the last two measured from the payload.

ClassParentRole in the experimentsaˉ\bar{a}vˉ\bar{v}
DroneAerialdesign class2.01.5
LightDroneDronetest only, ⪯dyn\preceq_{\mathrm{dyn}} Drone, inherits3.01.5
HeavyDroneDronetest only, ̸⪯dyn\not\preceq_{\mathrm{dyn}} Drone, own capability1.01.5
RoverGrounddesign class1.21.0
CarrierGrounddesign class1.00.8
ForkliftGroundtest only, no design ancestor1.21.0
HumanUncontrolledAgentuncontrolled0.5 (disk)0.8
PayloadObjectdesign class––
HazardousPayloadPayloaddesign class––
ChemicalHazardousPayloadtest only––

Table 3. Class profiles with the per-axis acceleration limit aˉ\bar{a} in m/s2^2 and the nominal speed vˉ\bar{v} of the task controller in m/s. Robot–human constraints need βC>aˉh\beta_C > \bar{a}_h, which holds for every robot class.

The OWL file used in all experiments is released with the code.

Completeness of the compiled reasoner. Apart from the definition of HazardCarrier, every TBox axiom above lies in OWL 2 RL ([24]), namely the inclusions and disjointness axioms between concept names, the domain and range restrictions, the symmetric role and the property chain. The definition contributes the inclusions HazardCarrier ⊑\sqsubseteq ControlledAgent and ControlledAgent ⊓∃carries.HazardousPayload⊑\sqcap\exists\mathit{carries}.\mathrm{HazardousPayload} \sqsubseteq HazardCarrier, which are RL rules, and the inclusion HazardCarrier ⊑∃carries.HazardousPayload\sqsubseteq\exists\mathit{carries}.\mathrm{HazardousPayload}, whose existential right-hand side lies outside OWL 2 RL, so we argue directly. Let M\mathcal{M} be the least fixpoint of the ABox under the rules A(x)→B(x)A(x) \to B(x) for atomic inclusions, r(x,y)→Dom⁡r(x)r(x,y) \to\operatorname{Dom}_r(x) and r(x,y)→Ran⁡r(y)r(x,y) \to\operatorname{Ran}_r(y), symmetry of near, the chain carries(x,y)∧near(y,z)→nearCarried(x,z)\mathit{carries}(x,y) \land\mathit{near}(y,z) \to\mathit{nearCarried}(x,z), the two RL inclusions of the definition, and A(x)∧B(x)→⊥A(x) \land B(x) \to\bot for each disjointness axiom. If ⊥∉M\bot\notin\mathcal{M}, extending M\mathcal{M} by one fresh HazardousPayload carried by every HazardCarrier that carries none gives a model of T∪AT \cup A, because the fresh payload has no near relation and its classes HazardousPayload, Payload, Object and Entity cause no clash. Every rule is sound, so T∪AT \cup A is inconsistent if and only if ⊥∈M\bot\in\mathcal{M}, and otherwise it entails a class or role assertion about named individuals if and only if the assertion is in M\mathcal{M}. The argument relies on carries having no functionality or cardinality restriction. The compiled reasoner computes M\mathcal{M}, and its agreement with HermiT on 72 random ABoxes with 5 to 9 individuals, some of them inconsistent, checks the implementation.

Inconsistency. If T∪AtT \cup A_t is inconsistent, it has no model and entails every assertion, in particular near(a,a)(a,a) and ControlledAgent(a)(a) for every agent aa. The instance (σ,a,a)(\sigma,a,a) of the robot–robot axiom is then active and requires ∥pa−pa∥≥0.3 m\lVert p_a-p_a\rVert\ge0.3\,\mathrm{m}, which every state violates, so St=∅S_t = \varnothing. In a consistent ABox every active constraint relates two distinct entities, because (1) asserts near only between distinct entities and the self-pair nearCarried(a,a)(a,a), derived from a carried payload near its carrier, matches only axioms whose second class is Human, which is disjoint from ControlledAgent. The compiled consistency check tests whether ⊥∉M\bot\notin\mathcal{M}, so it also finds clashes that the taxonomy propagates, such as the one below. In each of 100 W0 episodes, with seeds disjoint from the evaluation seeds, a faulty transponder makes the worker closest to a robot also report the class Rover for 3 s, so that one individual is typed both Human and Rover, which the TBox makes disjoint through ControlledAgent ⊓\sqcap UncontrolledAgent ⊑⊥\sqsubseteq\bot. A filter that trusts the label treats the worker as a robot, with a 0.3 m keep-out and no worst-case human acceleration, and within the fault and the 2 s after it 60 episodes violate safety (1995 violating steps and 5 single-constraint failures). The compiled check detects 100 of the 100 faults at the event, and HermiT agrees on 10/10 sampled events. OntoCBF then keeps the last consistent ABox and brakes the team until the contradiction disappears, after which 4 episodes violate safety (78 steps), at the cost of 9.90 against 10.68 deliveries per episode on the same seeds without a fault.

Labels and defaults. Entailment is monotone, so an entity whose class label is missing or too general receives only the constraints of the classes entailed for it, and an entity typed only as Entity receives none. Class labels and dynamics profiles are therefore safety-relevant inputs, and the profiles must be measured under the loads a robot carries. A fail-safe default, such as typing every sensed entity of unknown class as Human, gives such an entity the largest keep-out distances among uncontrolled entities and the worst-case human acceleration. This default belongs to the layer that builds the ABox, because a description logic draws conclusions only from the axioms and assertions that are present.

Experimental details and additional results

Warehouse layout. Each 12 × 12 m tile has six lanes from a pickup station at x=3x = 3 m to a drop station at x=9x = 9 m (Figure 2). The two middle lanes belong to the drones and cross a restricted zone at the center of the tile, which binds only Ground agents, and the four outer lanes belong to the carriers. A second zone lies west of the pickup column. The payload of a drone hangs below it, and the payload of a carrier sits 0.7 m from it along +x+x, toward the drop station. After a drop, the next item waits at the pickup station. Two of the four humans per tile are station workers who walk between the pickup and drop areas of their tile, and the other humans and the rovers move between random points of the whole floor. W4 tiles this layout 2 × 2 on a 24 × 24 m floor.

Scenario W3 warehouse layout comparing OntoCBF and Flat

Figure 2. Scenario W3 (a LightDrone carries a Chemical and a Drone a HazardousPayload), same seed under OntoCBF (t=10t = 10 s) and under Flat at its first hazard violation (t=2.6t = 2.6 s). For a drone that carries a hazardous payload, Flat falls back to its default payload keep-out and keeps the payload only 0.8 m from people.

Gain selection. On 100 W0 validation episodes, with seeds disjoint from the evaluation seeds, OntoCBF with the PD controller violates safety in 14, 15, 17, 17, 24 % of the episodes for γ=1,1.5,2,3,5\gamma= 1, 1.5, 2, 3, 5, with 1.76 to 2.02 deliveries per courier. The selection rule was fixed before evaluation and takes the largest γ\gamma whose violation rate is at most the rate at γ=1\gamma= 1. Since the rate grows with γ\gamma, the rule selects γ=1\gamma= 1, the most conservative gain of the grid, which is also the gain at which an overestimated capability is least visible (Figure 3 and Table 4).

Stress test of the capability assignment (§ 6.2). A human walks straight at a robot whose goal lies behind the human, with initial distances of 2 to 6 m, robot speeds of 0.5 to 1.5 m/s and human speeds of 0 to 0.8 m/s. Only initial states in the safe set of the aerial–human barrier with the true capability of the class are kept (91 encounters per setting for HeavyDrone), so with this capability every single constraint stays feasible by Lemma 3. We sweep the gain γ\gamma of h˙≥−γh3\dot{h} \ge-\gamma h^3, which is 1 in the warehouse (Figure 3). OntoCBF avoids single-constraint failures and violations at all gains, with a minimum distance of 1.12 m, and for Drone, whose capability is the same under both methods, Naive and OntoCBF coincide. At γ=1\gamma= 1, single constraints fail in 1 % of the encounters under Naive, and the HeavyDrone stays outside the keep-out region in all of them, so in the warehouse an overestimated capability shows up mainly as single-constraint failures.

The dynamic-subtype test in the warehouse at larger gains. Table 4 repeats W1, the only scenario with a class that fails the test, for Naive and OntoCBF at larger γ\gamma, and its row for γ=1\gamma= 1 reproduces the main results seed by seed. OntoCBF violates safety in 20–21 % of the episodes at every gain. Naive violates safety in 23 % of the episodes at γ=1\gamma= 1 (McNemar p=0.63p = 0.63 against OntoCBF on the same seeds), in 27 % at γ=3\gamma= 3, where its aerial–human violations are significantly more frequent, and in 44 % at γ=10\gamma= 10 (p<0.001p < 0.001). Its overestimated capability lets the HeavyDrone brake later, which also yields slightly more deliveries.

Single-element ablations. Each ablation changes exactly one element of OntoCBF (Table 7), and Table 8 shows in which scenarios the three ablations below fail.

No robot tax. types every robot outside the design classes as ControlledAgent only, so all its ancestors lie above the design classes and it is assigned its own profile. No payload tax. types every payload class outside the design classes as Payload. No defined class skips the realization of HazardCarrier and writes the hazard keep-out only for the design pair (Carrier, HazardousPayload), closed under both taxonomies.

Specification effort and throughput. W3 alone accounts for 3 of the 10 ontology statements of OntoCBF and 5 of the 18 table entries of Flat that cover W1–W3. Figure 4 places each method by deliveries per courier and episodes with a violation.

Figure 4. Episodes with a violation against deliveries per courier, 100 seeds per point and 3 pooled training runs for MAPPO. Points further down and to the right are better.

ScenarioMethodhazard–human 2.0 mpayload–human 0.8 maerial–human 1.0 mrobot–human 0.5 mground–zone 1.0 mrobot–robot 0.3 mDeliveries/courier ordinaryDeliveries/courier hazardousPickups into viol.
W0 (design)None423.0252.2344.3250.971.963.73.002.00348/2200
W0 (design)Flat5.41.22.30.31.20.02.051.160/1373
W0 (design)Flat-cons5.41.22.30.31.20.02.051.160/1373
W0 (design)No-chain421.578.63.20.31.10.02.121.65126/1500
W0 (design)Naive4.40.82.20.21.30.02.061.160/1373
W0 (design)Untyped5.70.10.60.11.00.01.361.180/1136
W0 (design)No-act.20.21.52.20.21.10.02.061.1899/1391
W0 (design)OntoCBF4.40.82.20.21.30.02.061.160/1373
W0 (design)MAPPO0.90.91.10.61.40.11.951.280/4042
W1 (unseen robots)None423.0247.2336.2244.971.964.93.252.00326/2100
W1 (unseen robots)Flat3.32.476.21.41.40.01.951.170/1343
W1 (unseen robots)Flat-cons4.80.30.80.50.60.01.001.180/996
W1 (unseen robots)No-chain412.9103.91.90.60.90.01.921.66139/1433
W1 (unseen robots)Naive4.10.51.80.82.20.02.101.170/1402
W1 (unseen robots)Untyped5.00.00.70.51.00.01.231.190/1096
W1 (unseen robots)No-act.20.81.81.90.20.60.01.871.20102/1331
W1 (unseen robots)OntoCBF3.10.51.90.21.00.01.871.190/1315
W1 (unseen robots)MAPPO0.90.72.20.71.00.01.891.290/3976
W2 (unseen payload)None423.0252.2344.3250.971.963.73.002.00348/2200
W2 (unseen payload)Flat359.72.02.20.00.90.02.061.56115/1451
W2 (unseen payload)Flat-cons5.41.22.30.31.20.02.051.160/1373
W2 (unseen payload)No-chain421.578.63.20.31.10.02.121.65126/1500
W2 (unseen payload)Naive4.40.82.20.21.30.02.061.160/1373
W2 (unseen payload)Untyped5.70.10.60.11.00.01.361.180/1136
W2 (unseen payload)No-act.20.21.52.20.21.10.02.061.1899/1391
W2 (unseen payload)OntoCBF4.40.82.20.21.30.02.061.160/1373
W2 (unseen payload)MAPPO0.90.91.10.61.40.11.951.280/4042
W3 (unseen combination)None1052.7255.4350.1252.371.962.22.003.00674/2200
W3 (unseen combination)Flat840.60.541.80.20.90.01.621.71156/1342
W3 (unseen combination)Flat-cons17.80.50.40.31.30.01.651.120/1112
W3 (unseen combination)No-chain1237.778.63.20.31.10.02.121.65126/1500
W4 (N=32)None1561.2874.6111.584.6239.2191.03.002.001244/8000
W4 (N=32)Flat477.86.18.33.810.89.12.121.160/5667
W4 (N=32)Flat-cons47.897.99.23.82.30.02.121.660/5667
W4 (N=32)No-chain1588.06.55.43.610.80.02.131.140/5662
W4 (N=32)Naive55.54.09.24.313.70.32.481.160/4768
W4 (N=32)Untyped122.210.19.64.013.10.02.131.160/5666
W4 (N=32)No-act.255.56.57.14.010.80.02.131.600/5666
W4 (N=32)OntoCBF44.15.17.14.07.80.11.981.100/5980

Table 6. Violations by axiom in the warehouse (constraint-steps per episode), deliveries per courier for ordinary and hazardous payloads, and pickups that began inside a keep-out region (out of all pickups). The MAPPO entries pool 3 ×\times100 episodes.

Events before a violation. For every violation onset of OntoCBF with PD in W0, W1, W3 and W4 (W2 replays W0), we identify the last infeasible QP of an agent of the violated constraint. An infeasible QP is a conflict if each of its inequalities is feasible on its own in the true input set. As a base rate, we give the share of agent-steps whose agent had a conflict within the window, over all agent-steps and over those in a close encounter, meaning an active constraint within 1 m of its keep-out. Conflicts make up 98 % of all infeasible QPs, and in the others every inequality that is infeasible on its own has an already negative barrier, as Proposition 6 predicts. We call an onset robot-attributable if, at the onset, a robot of the violated constraint has a positive velocity component toward the other entity. § 6.3 reports the complementary share, the onsets at which the robot was not moving toward the other entity.

Joint validity on visited states. On every step of the 100 W0 evaluation episodes under OntoCBF with PD, we take the active family and ask whether one input for the whole team, inside every agent’s true input set, satisfies all barrier conditions at once, with robot pairs unsplit and worst-case human accelerations. This is a linear feasibility problem, solved with HiGHS. We count only states at which every active barrier of the configuration has hk≥0h_k \ge0 outside the margin. With LightDrones the inequalities are those of the design team and the input sets are larger, so validity can only grow by Theorem 4, and this configuration tests the implementation. With HeavyDrones under the capability of Drone, the inequalities are the same and the input sets are smaller. HeavyDrones with their own capability form a different family, which is valid at 91.6 % of the visited states at which the design team’s family is valid. Feasibility of every agent’s QP is lower than joint validity throughout, because the responsibility split is more restrictive than a joint input.

Training details

All values below are read from the training configuration of the reported runs. MAPPO runs 200 iterations of 40 episodes with Adam (learning rate 0.001), discount 0.99, GAE parameter 0.95, clip ratio 0.2, 5 epochs per iteration, minibatches of 16384 agent-steps and entropy coefficient 0.001. The reward weights are 1 for progress, 1 for arrival, 0.01 for intervention, 0.5 for infeasible QPs, 0.2 for violations and 0.5 for overspeed. Training episodes use the W0 layout (design robot classes, Payload and HazardousPayload) with random positions along the lanes and random initial carrying states, 400 steps each, and evaluation episodes have 800 steps. The arrival bonus is paid when a goal is reached and switched, so waiting at a pickup deferred by the activation check earns nothing. Validation uses W0 episodes with seeds disjoint from the evaluation seeds. The own features of an agent are its goal offset, its velocity, its payload offset, the keep-out its payload currently requires and its class embedding. Each entry for another entity holds the relative position and velocity of the entity, the distance, the keep-out DD, the margin between them and the class embedding of the entity, and an agent that carries a payload also sees chain-related entities measured from its payload. The encoder uses attention pooling with 4 heads of total width 64 and a null token, and entry weights fade linearly to zero over the last 1 m before ρ\rho. Class embeddings have dimension 8 and are tied along the taxonomy (eC=∑C′⊇CδC′e_C = \sum_{C' \supseteq C} \delta_{C'}, with δC=0\delta_C = 0 for classes absent from training), and the actor and critic heads are two-layer tanh MLPs of width 256. Three training seeds are run, so the between-run part of the intervals in § 6 is coarse, and Table 13 gives each run separately. The PD task controller commands ui=2(vides−vi)u_i = 2(v_i^{\mathrm{des}} - v_i), with videsv_i^{\mathrm{des}} pointing at the goal at speed min⁡(vˉκ(i),distance to the goal)\min(\bar v_{\kappa(i)}, \text{distance to the goal}), and humans follow waypoints with the same law and ∥v˙h∥≤aˉh\lVert\dot v_h \rVert\le\bar a_h. Two reward configurations were trained, the weights above and a larger arrival bonus of 3 with intervention weight 0.003. A rule fixed beforehand admits the configurations whose violating steps on W0 validation episodes are at most those of PD and takes the one with the most deliveries, which selected the configuration above. The residual scale sis_i and its cap, used in all results reported here, were introduced in an earlier

version of these experiments with other scenarios, in which the corrections of a policy trained on Drone, scaled up by the larger aˉ\bar{a} of LightDrone, cost goals.

References

  1. [1]Aaron D. Ames, Xiangru Xu, Jessy W. Grizzle, and Paulo Tabuada. Control barrier function based quadratic programs for safety critical systems. IEEE Transactions on Automatic Control, 62(8): 3861–3876, 2017. doi: 10.1109/TAC.2016.2638961.DOI
  2. [2]Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi, and Peter F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003.DOI
  3. [3]Nikolaos Bousias, Charalampia Stamouli, Anastasios Tsiamis, and George J. Pappas. On transferring safety certificates across dynamical systems. arXiv:2602.03987, 2026.arxiv.org/abs/2602.03987
  4. [4]Joseph Breeden and Dimitra Panagou. Compositions of multiple control barrier functions under input constraints. In American Control Conference (ACC), pages 3688–3695, 2023. doi: 10.23919/ACC55779.2023.10156625.
  5. [5]Joseph Breeden, Kunal Garg, and Dimitra Panagou. Control barrier functions in sampled-data systems. IEEE Control Systems Letters, 6:367–372, 2022. doi: 10.1109/LCSYS.2021.3076127.DOI
  6. [6]Lukas Brunke, Yanni Zhang, Ralf Römer, Jack Naimer, Nikola Staykov, Siqi Zhou, and Angela P. Schoellig. Semantically safe robot manipulation: From semantic scene understanding to motion safeguards. IEEE Robotics and Automation Letters, 10(5):4810–4817, 2025. doi: 10.1109/LRA.2025.3553046.DOI
  7. [7]Zhiyuan Cai, Huanhui Cao, Wenjie Lu, Lin Zhang, and Hao Xiong. Safe multi-agent reinforcement learning through decentralized multiple control barrier functions. arXiv:2103.12553, 2021.arxiv.org/abs/2103.12553
  8. [8]Satchit Chatterji and Erman Acar. Analyzing probabilistic logic shields for multi-agent reinforcement learning. In European Conference on Artificial Intelligence (ECAI), volume 413 of Frontiers in Artificial Intelligence and Applications, pages 2538–2545. IOS Press, 2025. doi: 10.3233/FAIA251103.
  9. [9]Max H. Cohen, Tomas G. Molnar, and Aaron D. Ames. Safety-critical control for autonomous systems: Control barrier functions via reduced-order models. Annual Reviews in Control, 57: 100947, 2024. doi: 10.1016/j.arcontrol.2024.100947.DOI
  10. [10]Mandeep Dhanda, Stephanie Hall, Haoruo Zhao, Elies Dekoninck, and Vimal Dhokia. Ontology-based framework for modelling safety in human-robot collaboration systems. International Journal of Computer Integrated Manufacturing, pages 1–22, 2026. doi: 10.1080/0951192X.2026.2711052.DOI
  11. [11]Ingy ElSayed-Aly, Suda Bharadwaj, Christopher Amato, Rüdiger Ehlers, Ufuk Topcu, and Lu Feng. Safe multi-agent reinforcement learning via shielding. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 483–491, 2021. doi: 10.65109/KRJR7599.
  12. [12]Maham Fatima and Boris Tolg. A triage ontology-guided knowledge graph for constraining reinforcement learning decisions in mass casualty incidents. In Third Workshop on Knowledge Graphs and Neurosymbolic AI (KG-NeSy 2026), ISWC 2026 Workshops Joint Proceedings, volume 4313 of CEUR Workshop Proceedings, 2026.
  13. [13]Birte Glimm, Ian Horrocks, Boris Motik, Giorgos Stoilos, and Zhe Wang. HermiT: An OWL 2 reasoner. Journal of Automated Reasoning, 53(3):245–269, 2014. doi: 10.1007/s10817-014-9305-1.DOI
  14. [14]Shangding Gu, Jakub Grudzien Kuba, Yuanpei Chen, Yali Du, Long Yang, Alois Knoll, and Yaodong Yang. Safe multi-agent reinforcement learning for multi-robot control. Artificial Intelligence, 319:103905, 2023. doi: 10.1016/j.artint.2023.103905.DOI
  15. [15]IEEE. IEEE standard ontologies for robotics and automation. IEEE Std 1872-2015, IEEE Standards Association, New York, NY, USA, 2015.
  16. [16]Axton Isaly, Masoumeh Ghanbarpour, Ricardo G. Sanfelice, and Warren E. Dixon. On the feasibility and continuity of feedback controllers defined by multiple control barrier functions. IEEE Transactions on Automatic Control, 69(11):7326–7339, 2024. doi: 10.1109/TAC.2024.3383069.DOI
  17. [18]ISO. Industrial trucks – safety requirements and verification – part 4: Driverless industrial trucks and their systems. ISO 3691-4:2023, International Organization for Standardization, Geneva, Switzerland, 2023.
  18. [19]Joonkyung Kim, Janghyun Cho, Jeehyun Lee, Changjoo Nam, and Yiwei Lyu. Capability-conditioned graph control barrier functions for zero-shot safe navigation of heterogeneous mobile robot teams. arXiv:2610.41214, 2026a.arxiv.org/abs/2610.41214
  19. [20]Joonkyung Kim, Yanze Zhang, Wenhao Luo, and Yiwei Lyu. Capability-aware heterogeneous control barrier functions for decentralized multi-robot safe navigation. arXiv:2604.13245, 2026b.arxiv.org/abs/2604.13245
  20. [21]Lars Lindemann and Dimos V. Dimarogonas. Control barrier functions for signal temporal logic tasks. IEEE Control Systems Letters, 3(1):96–101, 2019. doi: 10.1109/LC SYS.2018.2853182.DOI
  21. [22]Barbara H. Liskov and Jeannette M. Wing. A behavioral notion of subtyping. ACM Transactions on Programming Languages and Systems, 16(6):1811–1841, 1994. doi: 10.1145/197320.197383.DOI
  22. [23]Tamas G. Molnar and Aaron D. Ames. Composing control barrier functions for complex safety specifications. IEEE Control Systems Letters, 7:3615–3620, 2023. doi: 10.1109/LCSYS.2023.3339719.DOI
  23. [24]Boris Motik, Bernardo Cuenca Grau, Ian Horrocks, Zhe Wu, Achille Fokoue, and Carsten Lutz. OWL 2 web ontology language profiles (second edition). W3C Recommendation, 2012.
  24. [25]Shima Sadat Mousavi, Xiao Tan, and Aaron D. Ames. From vertices to convex hulls: Certifying set-wise compatibility for CBF constraints. IEEE Control Systems Letters, 9:3011–3016, 2025. doi: 10.1109/LCSYS.2025.3648436.DOI
  25. [26]Alireza Nadali, Ashutosh Trivedi, and Majid Zamani. Transfer of safety controllers through learning deep inverse dynamics model. IFAC-PapersOnLine, 58(11):129–134, 2024. doi: 10.1016/j.ifacol.2024.07.436.DOI
  26. [27]George J. Pappas, Gerardo Lafferriere, and Shankar Sastry. Hierarchically consistent control systems. IEEE Transactions on Automatic Control, 45(6):1144–1160, 2000. doi: 10.1109/9.863598.DOI
  27. [28]Zachary Ravichandran, David Snyder, Alexander Robey, Hamed Hassani, Vijay Kumar, and George J. Pappas. Contextual safety reasoning and grounding for open-world robots. arXiv:2602.19983, 2026.arxiv.org/abs/2602.19983
  28. [29]Gunther Reissig, Alexander Weber, and Matthias Rungger. Feedback refinement relations for the synthesis of symbolic controllers. IEEE Transactions on Automatic Control, 62(4):1781–1796, 2017. doi: 10.1109/TAC.2016.2593947.DOI
  29. [30]Chandan Kumar Sah and Jishnu Keshavan. Exact feasibility certification and optimal responsibility allocation for multi-robot CBF safety filters. arXiv:2609.14935, 2026.
  30. [31]Xiao Tan and Dimos V. Dimarogonas. Compatibility checking of multiple control barrier functions. In IEEE Conference on Decision and Control (CDC), pages 939–944, 2022. doi: 10.1109/CDC51059.2022.9993001.DOI
  31. [32]Chris van der Ploeg, Michiel Braat, Beatrice Masini, N. J. Brouwer, and J. P. Paardekooper. Connecting the dots: Context-driven motion planning using symbolic reasoning. In IEEE Intelligent Vehicles Symposium (IV), pages 1–8, 2023. doi: 10.1109/IV55152.2023.10186794.DOI
  32. [33]Li Wang, Aaron D. Ames, and Magnus Egerstedt. Safety barrier certificates for heterogeneous multi-robot systems. In American Control Conference (ACC), pages 5213–5218, 2016. doi: 10.1109/ACC.2016.7526486.DOI
  33. [34]Li Wang, Aaron D. Ames, and Magnus Egerstedt. Safety barrier certificates for collisions-free multirobot systems. IEEE Transactions on Robotics, 33(3):661–674, 2017. doi: 10.1109/TRO.2017.2659727.DOI
  34. [35]Feiyu Wu, Xu Zheng, Yue Qu, Zhuocheng Wang, Zicheng Feng, and Hui Li. Grounding generative planners in verifiable logic: A hybrid architecture for trustworthy embodied AI. In International Conference on Learning Representations (ICLR), 2026.arxiv.org/abs/2602.08373
  35. [36]Wenli Xiao, Yiwei Lyu, and John M. Dolan. Model-based dynamic shielding for safe and efficient multi-agent reinforcement learning. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 1587–1596, 2023.arxiv.org/abs/2304.06281
  36. [37]Zhibo Yang, Junwei Liu, Zhuohan Li, and Wei Zhang. hGCBF: Heterogeneous graph control barrier functions for safe multi-agent systems. IEEE Access, 14:43463–43471, 2026. doi: 10.1109/ACCESS.2026.3670495.

Paper details

vlnc:W_ruyptsy6
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Generative AI tools

View statement
Looking for related papers…
Contents