English

Multi-Agent Safety Verification using Symmetry Transformations

Formal Languages and Automata Theory 2019-11-05 v1 Logic in Computer Science Symbolic Computation Systems and Control Systems and Control

Abstract

We show that symmetry transformations and caching can enable scalable, and possibly unbounded, verification of multi-agent systems. Symmetry transformations map solutions and to other solutions. We show that this property can be used to transform cached reachsets to compute new reachsets, for hybrid and multi-agent models. We develop a notion of virtual system which define symmetry transformations for a broad class of agent models that visit waypoint sequences. Using this notion of virtual system, we present a prototype tool CacheReach that builds a cache of reachtubes for this system, in a way that is agnostic of the representation of the reachsets and the reachability analysis subroutine used. Our experimental evaluation of CacheReach shows up to 66% savings in safety verification computation time on multi-agent systems with 3-dimensional linear and 4-dimensional nonlinear fixed-wing aircraft models following sequences of waypoints. These savings and our theoretical results illustrate the potential benefits of using symmetry-based caching in the safety verification of multi-agent systems.

Cite

@article{arxiv.1911.00608,
  title  = {Multi-Agent Safety Verification using Symmetry Transformations},
  author = {Hussein Sibai and Navid Mokhlesi and Chuchu Fan and Sayan Mitra},
  journal= {arXiv preprint arXiv:1911.00608},
  year   = {2019}
}
R2 v1 2026-06-23T12:02:44.783Z