Penalized Proximal Policy Optimization for Safe Reinforcement Learning

Safe reinforcement learning aims to learn the optimal policy while satisfying safety constraints, which is essential in real-world applications. However, current algorithms still struggle for efficient policy updates with hard constraint satisfaction. In this paper, we propose Penalized Proximal Policy Optimization (P3O), which solves the cumbersome constrained policy iteration via a single minimization of an equivalent unconstrained problem. Specifically, P3O utilizes a simple yet effective penalty approach to eliminate cost constraints and removes the trust-region constraint by the clipped surrogate objective. We theoretically prove the exactness of the penalized method with a finite penalty factor and provide a worst-case analysis for approximate error when evaluated on sample trajectories. Moreover, we extend P3O to more challenging multi-constraint and multi-agent scenarios which are less studied in previous work. Extensive experiments show that P3O outperforms state-of-the-art algorithms with respect to both reward improvement and constraint satisfaction on a set of constrained locomotive tasks.

Authors

• Linrui Zhang Tsinghua University
• Li Shen Shenzhen Campus of Sun Yat-sen University
• Long Yang Peking University
• Shixiang Chen
• Xueqian Wang Tsinghua Shenzhen International Graduate School, Tsinghua University
• Bo Yuan University of Queensland
• Dacheng Tao College of Computing and Data Science, Nanyang Technological University

Keywords

• Agent-based and Multi-agent Systems: Multi-agent Learning
• Constraint Satisfaction and Optimization: Constraint Optimization
• Machine Learning: Deep Reinforcement Learning