Online Synthesis for Runtime Enforcement of Safety in Multi-Agent Systems
Dhananjay Raju, Suda Bharadwaj, Ufuk Topcu

TL;DR
This paper introduces a decentralized, runtime shield synthesis method for multi-agent systems that ensures safety without requiring global information, significantly improving scalability over traditional design-time approaches.
Contribution
It presents a novel decentralized approach where each agent has an onboard shield that operates at runtime, reducing complexity from exponential to quadratic in the number of agents.
Findings
Runtime synthesis is efficient for 50 agents, taking seconds per agent.
Centralized design-time synthesis becomes intractable beyond 4 agents.
The method guarantees safety with bounded deviation from original behavior.
Abstract
A shield is attached to a system to guarantee safety by correcting the system's behavior at runtime. Existing methods that employ design-time synthesis of shields do not scale to multi-agent systems. Moreover, such shields are typically implemented in a centralized manner, requiring global information on the state of all agents in the system. We address these limitations through a new approach where the shields are synthesized at runtime and do not require global information. There is a shield onboard every agent, which can only modify the behavior of the corresponding agent. In this approach, which is fundamentally decentralized, the shield on every agent has two components: a pathfinder that corrects the behavior of the agent and an ordering mechanism that dynamically modifies the priority of the agent. The current priority determines if the shield uses the pathfinder to modify…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsTest
