Decentralized Runtime Synthesis of Shields for Multi-Agent Systems

by   Dhananjay Raju, et al.

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 behavior of the agent. We derive an upper bound on the maximum deviation for any agent from its original behavior. We prove that the worst-case synthesis time is quadratic in the number of agents at runtime as opposed to exponential at design-time for existing methods. We test the performance of the decentralized, runtime shield synthesis approach on a collision-avoidance problem. For 50 agents in a 50x50 grid, the synthesis at runtime requires a few seconds per agent whenever a potential collision is detected. In contrast, the centralized design-time synthesis of shields for a similar setting is intractable beyond 4 agents in a 5x5 grid.


page 1

page 2

page 3

page 4


Online Synthesis for Runtime Enforcement of Safety in Multi-Agent Systems

A shield is attached to a system to guarantee safety by correcting the s...

ALAN: Adaptive Learning for Multi-Agent Navigation

In multi-agent navigation, agents need to move towards their goal locati...

Ontology-Based Feedback to Improve Runtime Control for Multi-Agent Manufacturing Systems

Improving the overall equipment effectiveness (OEE) of machines on the s...

Correct-by-Design Teamwork Plans for Multi-Agent Systems

We propose Teamwork Synthesis, a version of the distributed synthesis pr...

Optimized Directed Roadmap Graph for Multi-Agent Path Finding Using Stochastic Gradient Descent

We present a novel approach called Optimized Directed Roadmap Graph (ODR...

Multi-UAV Collision Avoidance using Multi-Agent Reinforcement Learning with Counterfactual Credit Assignment

Multi-UAV collision avoidance is a challenging task for UAV swarm applic...

Characterizing Properties and Trade-offs of Centralized Delegation Mechanisms in Liquid Democracy

Liquid democracy is a form of transitive delegative democracy that has r...

Please sign up or login with your details

Forgot password? Click here to reset