REVIEW 4 cited by
MAMPS: Safe Multi-Agent Reinforcement Learning via Model Predictive Shielding
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Reinforcement learning is a promising approach to learning control policies for performing complex multi-agent robotics tasks. However, a policy learned in simulation often fails to guarantee even simple safety properties such as obstacle avoidance. To ensure safety, we propose multi-agent model predictive shielding (MAMPS), an algorithm that provably guarantees safety for an arbitrary learned policy. In particular, it operates by using the learned policy as often as possible, but instead uses a backup policy in cases where it cannot guarantee the safety of the learned policy. Using a multi-agent simulation environment, we show how MAMPS can achieve good performance while ensuring safety.
Forward citations
Cited by 4 Pith papers
-
Toward Adaptable Multi-Agent Reinforcement Learning: An Assumption-Aware Review
A survey proposing adaptability as a three-part taxonomy (learning, policy, scenario-driven) for organizing and evaluating MARL under changing conditions.
-
Solving Multi-Agent Safe Optimal Control with Distributed Epigraph Form MARL
Def-MARL is a CTDE safe MARL algorithm that solves the multi-agent safe optimal control problem via a distributed epigraph form, achieving near-100% safety rates in simulation and hardware.
-
A Dynamic Safety Shield for Safe and Efficient Reinforcement Learning of Navigation Tasks
A dynamic safety shield uses an RL supervisor to adaptively weight obstacle-avoidance and action-matching terms in an MPC cost, improving the goals-to-collisions ratio in navigation RL.
-
Tackling Uncertainties in Multi-Agent Reinforcement Learning through Integration of Agent Termination Dynamics
Adding a penalty for ally deaths to distributional multi-agent Q-learning improves win rates on StarCraft II and driving benchmarks compared with six baseline algorithms.
Discussion (0). Continue with ORCID to comment.