Robust Safety Assurance for Robotic Swarms Using Decentralized Collision Verification

arXiv:2611.01081v1 Announce Type: new Abstract: In this paper we present the methodologies, results, and analysis used to deploy a decentralized safety verification algorithm on a robotic swarm to prevent collisions at runtime in an outdoor environment. Typically, approaches toward verification of swarms of cyber-physical systems (CPS) are evaluated solely in numerical simulations or in highly controlled, noiseless indoor environments. Our efforts to implement collision avoidance on a real swarm system outdoors have revealed that the underlying algorithmic assumptions juxtaposed against the implementation details of the target system are critical factors in a method's efficacy in the real world. Here we modify, enhance, and analyze a decentralized reachability-based method for collision avoidance on a size, weight, and power-constrained uncrewed aerial vehicle (UAV) swarm with the objective of illustrating the challenges of real-world CPS deployments as well as provide guidance for researchers in this space. Verification performance, resource utilization, and timing data were gathered over the course of 140 total outdoor vehicle flights, including 6 swarm flights composed of 8 UAVs, and used to improve collision-avoidance performance as experimentation progressed. Our extensive experiments show that the proposed decentralized runtime verification approach can efficiently verify the safety of multiple UAVs in real-time and help all agents take safe actions to avoid collisions. On average, each agent, using our open-source safety_checker library, takes approximately 500-520 ms to verify its safety for the next 4 s into the future, in which the reachable set broadcast time dominates the total verification time (~300-500 ms).