Balance Reward and Safety Optimization for Safe Reinforcement Learning: A Perspective of Gradient Manipulation

Authors

  • Shangding Gu Technical University of Munich
  • Bilgehan Sel Virginia Tech
  • Yuhao Ding University of California - Berkeley
  • Lu Wang MIcrosoft
  • Qingwei Lin Microsoft Research
  • Ming Jin Virginia Tech
  • Alois Knoll Technical University of Munich

DOI:

https://doi.org/10.1609/aaai.v38i19.30102

Keywords:

General

Abstract

Ensuring the safety of Reinforcement Learning (RL) is crucial for its deployment in real-world applications. Nevertheless, managing the trade-off between reward and safety during exploration presents a significant challenge. Improving reward performance through policy adjustments may adversely affect safety performance. In this study, we aim to address this conflicting relation by leveraging the theory of gradient manipulation. Initially, we analyze the conflict between reward and safety gradients. Subsequently, we tackle the balance between reward and safety optimization by proposing a soft switching policy optimization method, for which we provide convergence analysis. Based on our theoretical examination, we provide a safe RL framework to overcome the aforementioned challenge, and we develop a Safety-MuJoCo Benchmark to assess the performance of safe RL algorithms. Finally, we evaluate the effectiveness of our method on the Safety-MuJoCo Benchmark and a popular safe benchmark, Omnisafe. Experimental results demonstrate that our algorithms outperform several state-of-the-art baselines in terms of balancing reward and safety optimization.

Published

2024-03-24

How to Cite

Gu, S., Sel, B., Ding, Y., Wang, L., Lin, Q., Jin, M., & Knoll, A. (2024). Balance Reward and Safety Optimization for Safe Reinforcement Learning: A Perspective of Gradient Manipulation. Proceedings of the AAAI Conference on Artificial Intelligence, 38(19), 21099-21106. https://doi.org/10.1609/aaai.v38i19.30102

Issue

Section

AAAI Technical Track on Safe, Robust and Responsible AI Track