SafeDiSTL: Decomposing Joint Constraints for Safe Multi-Agent Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Cooperative multi-agent tasks often impose constraints on a shared objective or collective safety. A team level violation cost function can measure this constraint outcome, but does not distinguish which agents' actions most strongly influence that violation. We present SafeDiSTL, a constrained multi-agent reinforcement learning framework that allows for credit assignment even with joint constraint measurements. We use Signal Temporal Logic (STL) robustness to measure episode-level violation through running-maximum cost increments. Smooth full-episode robustness and differentiable dynamics provide action sensitivities, which allocate each cost increment across agents at the same decision time. These sensitivities account for delayed effects when weighting agents' shares of each cost increment. We study the framework in cooperative payload transport, connected navigation, and networked traffic control tasks. SafeDiSTL achieves 1.6-5.1x the safe-success rate in transport, improves navigation safe-success by 11.1%, and delivers 50-68% more throughput in traffic when compared to constrained baselines. Results demonstrate a strong improvement of the learned policy in dealing with shared constraint while retaining the performance of unconstrained policies.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 26 references that are in the map. First posted on arXiv 9 Oct 2026.
Builds on
13 of 26 references.
References · 13
- 2017Constrained Policy Optimizationcited by 983
- 2021The Surprising Effectiveness of PPO in Cooperative, Multi-Agent Gamescited by 942
- 2017Counterfactual Multi-Agent Policy Gradientscited by 751
- 2024Reinforcement learningcited by 247
- 2022VMAS: A Vectorized Multi-Agent Simulator for Collective Robot Learningcited by 68
- 2020Backpropagation through Signal Temporal Logic Specifications: Infusing Logical Structure into Gradient-Based Methodscited by 54
- 2020Q-value Path Decomposition for Deep Multiagent Reinforcement Learningcited by 24
- 2025STLCG++: A Masking Approach for Differentiable Signal Temporal Logic Specificationcited by 8
- 2023Learning Responsibility Allocations for Safe Human-Robot Interaction with Applications to Autonomous Drivingcited by 7
- 2023Multi-Agent Reinforcement Learning Guided by Signal Temporal Logic Specificationscited by 7
- 2023Risk-aware Safe Control for Decentralized Multi-agent Systems via Dynamic Responsibility Allocationcited by 2
- 2026STL-SVPIO: Signal Temporal Logic guided Stein Variational Path Integral Optimizationcited by 2
1 more
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025A Survey of Safe Reinforcement Learning and Constrained MDPs: A Technical Survey on Single-Agent and Multi-Agent Safety
- 2025Resolving Conflicting Constraints in Multi-Agent Reinforcement Learning with Layered Safety
- 2026Contract-Based Compositional Shielding for Safe Multi-Agent Reinforcement Learning
- 2024Safe Multiagent Coordination via Entropic Exploration
- 2026Safe and Generalizable Hierarchical Multi-Agent RL via Constraint Manifold Control
- 2026Dual-Quadruped Collaborative Transportation in Narrow Environments via Safe Reinforcement Learning
- 2024Safe Multi-Agent Reinforcement Learning with Convergence to Generalized Nash Equilibrium
- 2025Safe Multi-Agent Navigation guided by Goal-Conditioned Safe Reinforcement Learning