SafeDiSTL is a constrained multi‑agent reinforcement learning framework that decomposes joint constraints using Signal Temporal Logic robustness to assign credit to individual agents. By measuring episode‑level violations through running‑maximum cost increments and computing action sensitivities, the method distributes each cost increment among agents at the same decision time, accounting for delayed effects. Experiments on cooperative payload transport, connected navigation, and networked traffic control show that SafeDiSTL improves safe‑success rates and throughput compared to constrained baselines while preserving unconstrained policy performance.
arXiv:2606. 24010v1 Announce Type: new Abstract: Multi-agent systems are widely used in safety-critical applications that require coordinated behavior under strict safety constraints.
The paper examines inference‑time observation attacks on Safe Multi‑Agent Reinforcement Learning (SMARL), where an adversary perturbs observations of some agents to alter their actions. It introduces the MinMax Attack framework, which jointly selects adversarial target actions for compromised agents while considering the cooperative resistance of benign agents. The authors derive a bound on the induced safety cost and show through experiments that MinMax Attack causes higher safety costs than existing baselines while maintaining task reward, thus improving attack effectiveness and stealthiness.
arXiv:2510. 09041v3 Announce Type: replace-cross Abstract: Deep reinforcement learning (DRL) has demonstrated remarkable success in developing autonomous driving policies.
arXiv:2606. 14130v1 Announce Type: new Abstract: Safe coordination problems surface in multi-agent reinforcement learning when global safety cannot be enforced by any agent unilaterally: the admissibility of one agent's action may depend on the dynamics of other agents.
arXiv:2606. 02337v1 Announce Type: new Abstract: Constrained Multi-agent reinforcement learning (CMARL) faces two intertwined challenges: the joint action space grows exponentially with the number of agents, and additional requirements couple agents in ways that reward structure alone does not capture.
arXiv:2608. 10056v1 Announce Type: cross Abstract: Following a target human in crowded environments involves an inherent conflict between staying close to the target and navigating safely among surrounding pedestrians and obstacles.
The paper introduces new evaluation metrics for safe reinforcement learning that go beyond average safety guarantees by examining how often and how severely safety bounds are violated, consistency across tasks and bounds, and the relationship between training-time and final policy behavior. It also proposes a safety tier system for categorizing algorithms and presents empirical safety evaluations on multiple navigation tasks. The authors recommend reporting aggregate metrics, distributional data, and task‑specific results together, and provide an open‑source suite, SafeRLEval, to facilitate reliable safety assessment.
arXiv:2606. 18308v1 Announce Type: cross Abstract: Safe coordination in networked cyber-physical systems forces learning algorithms to simultaneously handle hybrid discrete-continuous actions, hard training-time safety constraints, and physics-governed dynamics.
arXiv:2608. 11658v1 Announce Type: cross Abstract: Many reinforcement learning systems, from fleet management to traffic signal control, must serve an objective that changes dynamically after deployment, and retraining a policy for each new objective is prohibitively expensive.
arXiv:2603. 15136v2 Announce Type: replace-cross Abstract: Offline safe reinforcement learning (RL) seeks reward-maximizing policies from static datasets under strict safety constraints.
The paper presents a modeling and simulation framework to study reinforcement learning (RL) control of connected and automated vehicle (CAV) platoon joining maneuvers in mixed traffic. Using SUMO and agent-based modeling, it evaluates Deep Q-Network (DQN), Double DQN (DDQN), and Proximal Policy Optimization (PPO) algorithms, finding that PPO achieves a 98 % joining success rate with less than 1 % collision rate by incorporating risk penalties. The study also shows a trade‑off between safety, joining effectiveness, and decision efficiency, and demonstrates that an external safety controller can prevent collisions but may reduce joining efficiency.
arXiv:2602.05863v3 Announce Type: replace Abstract: Group Relative Policy Optimization (GRPO) remains the dominant critic-free approach for fine-tuning LLMs and VLMs, but its compatibility with const...