Many robotic applications involve scenarios where multiple robots interact and the decisions of one robot influence the behavior of others. This paper presents a quadratic programming (QP)-based feedback controller for multi-robot conflict resolution with input constraints. Safety is enforced using coupled Control Barrier Function (CBF), while a yielding matrix encodes how robots influence each other. Unlike existing methods with fixed or hard priorities, the proposed framework enables yielding preferences while guaranteeing deadlock-free operation by design. Sufficient conditions are established for the controller to be locally Lipschitz. The optimal CBF sign- indefinite slack is shown to admit a finite uniform bound, which is compensated through an enlarged CBF safety margin to obtain a forward invariant set contained within the desired safe set. The analysis also identifies an irreducible slack component due to finite maximum deceleration that cannot be eliminated by increasing the slack penalty. Finally, sufficient conditions on the yielding matrix and nominal controller are derived to exclude deadlock states. Simulations demonstrate adaptive coordination across yielding preferences and robustness to robot failures.
Figures & tables
Fig. 1 : Two mobile robots, modeled as disks of radius d , navigate narrow corridors, through a conflict zone (green shaded hexagon), where ψm denotes the minimum pairwise intersection angle among the corridors. The unsafe region is a disk with a dynamically changing radius min{R1,R2} , where each Ri equals the robot’s stopping distance based on its velocity vi , plus a desired safety margin. No two robots may occupy an unsafe region simultaneously.
Fig. 2 : (a)-(b): ν=0.9 , robots 1 and 2 yield preferences: q12=2 , q21=1 . Robot distances from the conflict-zone center are shown. The red arrow shows robot 1 exiting a circle of radius d0 centered at the origin of the conflict zone, after which the conflict with robot 2 is resolved. (c)-(d): ν=0.9 , with swapped yield preferences q12=1 , q21=2 , showing robots’ speed trajectories for vr=3[m/s] .
Fig. 3 : (a)-(b): Robots 1 and 2 yield preferences: q12=0.1 , q21=0.05 . (a) For ν=0.1 , the exit time of yielding robot 2 increases compared to Fig. 2 , as yielding reduces its acceleration and, thus speed. (b) ν=0.1 provides greater weight on asymmetric coupling cost, producing a large initial acceleration difference.
Fig. 4 : ν=0.9 , with robots 1 and 2 yield preferences: q12=2 , q21=1 , inducing robot 2 to yield. When robot 1 fails at 10[m] from the origin, it initiates emergency braking um=−3.4[m/s2] .
Multi-robot Control Barrier Function (CBF) safety filters can become infeasible, but a failed quadratic program (QP) does not indicate why the conflict occurred or how to resolve it. To address this, we develop an exact feasibility certificate for multi-agent CBF filters with heterogeneous control-affine dynamics and convex input sets. The certificate quantifies a feasibility reserve by separating the demand imposed by safety constraints from the available actuator supply. This decomposition shows when CBF gain tuning or increased actuation can and cannot resolve infeasibility, and identifies the agents and interactions responsible for the conflict. We further propose an algorithm to optimally allocate shared safety constraints by maximizing the worst local feasibility margin, yielding a linear program for polyhedral input sets. In 320 paired closed-loop simulations, the proposed allocation reduces infeasible control steps from roughly 50% to 6.2%, and reduces safety-violating runs from 118/160 to 24/160. In addition, across 52 infeasibility events, the certificate identifies an interaction whose relaxation restores feasibility in 94% of cases.
Chandan Kumar Sah, Jishnu Keshavan
Department of Mechanical Engineering, Indian Institute of Science, Bengaluru 560012, India
Safe decentralized navigation in heterogeneous robot teams is challenging because robots with different dynamics and control limits cannot satisfy identical collision-avoidance obligations equally well. Existing methods often rely on model-specific safety formulations or allocate avoidance responsibility without considering whether the assigned control is physically realizable, possibly leading to safety-constrained QP infeasibility and safety violations. We propose Capability-Aware Heterogeneous Control Barrier Functions (CA-HCBF), a decentralized framework for consistent safety enforcement and capability-aware responsibility allocation. We derive a unified operational-space second-order control-affine formulation for holonomic and nonholonomic mobile robots through canonical transformation and backstepping, addressing the relative-degree mismatch while preserving forward invariance of the pairwise safe set. Second, we quantify each robot's achievable control authority along the safety-critical direction using a support-function-based capability metric and use it to distribute pairwise avoidance responsibility. A feasibility-aware clipping mechanism further mitigates physically unrealizable responsibility assignments. Simulations with up to 30 heterogeneous robots and hardware experiments demonstrate high task completion with low safety violations and reduction in local QP infeasibility.
Joonkyung Kim, Yanze Zhang, Wenhao Luo +1
Department of Computer Science and Engineering, Texas A&M University · Department of Computer Science, University of Illinois Chicago
This paper presents a feasibility-enhanced control barrier function (FECBF) framework for multi-UAV collision avoidance. In dense multi-UAV scenarios, the feasibility of the CBF quadratic program (CBF-QP) can be compromised due to internal incompatibility among multiple CBF constraints. To address this issue, we analyze the internal compatibility of CBF constraints and derive a sufficient condition for internal compatibility. Based on this condition, a sign-consistency constraint is introduced to mitigate internal incompatibility. The proposed constraint is incorporated into a decentralized CBF-QP formulation using worst-case estimates and slack variables. Simulation results demonstrate that the proposed method significantly reduces infeasibility and improves collision avoidance performance compared with existing baselines in dense scenarios. Additional simulations under varying time delays demonstrate the robustness of the proposed method. Real-world experiments validate the practical applicability of the proposed method.
Qishen Zhong, Junlong Wu, Jian Yang +4
School of Automation Science and Engineering, South China University of Technology, Guangzhou 510641, Guangdong, China