paper-with-me

Papers

DESTA: A Framework for Safe Reinforcement Learning with Markov Games of Intervention

2021-10-27 · David Mguni, Usman Islam, Yaqi Sun, Xiuling Zhang, Joel Jennings, Aivar Sootla, Changmin Yu, Ziyan Wang, Jun Wang, Yaodong Yang

Reinforcement learning (RL) involves performing exploratory actions in an unknown system. This can place a learning agent in dangerous and potentially catastrophic system states. Current approaches for tackling safe learning in RL simultaneously trade-off safe exploration and task fulfillment. In this paper, we introduce a new generation of RL solvers that learn to minimise safety violations while maximising the task reward to the extent that can be tolerated by the safe policy. Our approach introduces a novel two-player framework for safe RL called Distributive Exploration Safety Training Algorithm (DESTA). The core of DESTA is a game between two adaptive agents: Safety Agent that is delegated the task of minimising safety violations and Task Agent whose goal is to maximise the environment reward. Specifically, Safety Agent can selectively take control of the system at any given point to prevent safety violations while Task Agent is free to execute its policy at any other states. This framework enables Safety Agent to learn to take actions at certain states that minimise future safety violations, both during training and testing time, while Task Agent performs actions that maximise the task performance everywhere else. Theoretically, we prove that DESTA converges to stable points enabling safety violations of pretrained policies to be minimised. Empirically, we show DESTA's ability to augment the safety of existing policies and secondly, construct safe RL policies when the Task Agent and Safety Agent are trained concurrently. We demonstrate DESTA's superior performance against leading RL methods in Lunar Lander and Frozen Lake from OpenAI gym.

📄 PDF Abstract BibTeX arXiv:2110.14468

Code (0)

등록된 구현이 없습니다.

Tasks

OpenAI Gymreinforcement-learningReinforcement Learning (RL)Safe ExplorationSafe Reinforcement Learning

Similar Papers 제목 키워드 기반

Extended Markov Games to Learn Multiple Tasks in Multi-Agent Reinforcement Learning

2020-02-14 · Borja G. León, Francesco Belardinelli

The combination of Formal Methods with Reinforcement Learning (RL) has recently attracted interest as a way for single-agent RL to learn multiple-task specifications. In this paper we extend this convergence to multi-age…

Multi-agent Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Convex Markov Games: A New Frontier for Multi-Agent Reinforcement Learning

2024-10-22 · Ian Gemp, Andreas Haupt, Luke Marris, SiQi Liu 외

Behavioral diversity, expert imitation, fairness, safety goals and others give rise to preferences in sequential decision making domains that do not decompose additively across time. We introduce the class of convex Mark…

Decision MakingDiversityFairnessMulti-agent Reinforcement Learning+1

Provably Learning Nash Policies in Constrained Markov Potential Games

2023-06-13 · Pragnya Alatur, Giorgia Ramponi, Niao He, Andreas Krause

Multi-agent reinforcement learning (MARL) addresses sequential decision-making problems with multiple agents, where each agent optimizes its own objective. In many real-world instances, the agents may not only want to op…

Decision MakingMulti-agent Reinforcement LearningSafe ExplorationSequential Decision Making

Provably Efficient Generalized Lagrangian Policy Optimization for Safe Multi-Agent Reinforcement Learning

2023-05-31 · Dongsheng Ding, Xiaohan Wei, Zhuoran Yang, Zhaoran Wang 외

We examine online safe multi-agent reinforcement learning using constrained Markov games in which agents compete by maximizing their expected total rewards under a constraint on expected total utilities. Our focus is con…

Multi-agent Reinforcement Learningreinforcement-learningReinforcement LearningSafe Reinforcement Learning

PAC Reinforcement Learning Algorithm for General-Sum Markov Games

2020-09-05 · Ashkan Zehfroosh, Herbert G. Tanner

This paper presents a theoretical framework for probably approximately correct (PAC) multi-agent reinforcement learning (MARL) algorithms for Markov games. The paper offers an extension to the well-known Nash Q-learning …

Multi-agent Reinforcement LearningQ-Learningreinforcement-learningReinforcement Learning+1