Policy Bifurcation in Safe Reinforcement Learning

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Zou, Wenjun, Lyu, Yao, Li, Jie, Yang, Yujie, Li, Shengbo Eben, Duan, Jingliang, Zhan, Xianyuan, Liu, Jingjing, Zhang, Yaqin, Li, Keqiang
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914731468521472
author Zou, Wenjun
Lyu, Yao
Li, Jie
Yang, Yujie
Li, Shengbo Eben
Duan, Jingliang
Zhan, Xianyuan
Liu, Jingjing
Zhang, Yaqin
Li, Keqiang
author_facet Zou, Wenjun
Lyu, Yao
Li, Jie
Yang, Yujie
Li, Shengbo Eben
Duan, Jingliang
Zhan, Xianyuan
Liu, Jingjing
Zhang, Yaqin
Li, Keqiang
contents Safe reinforcement learning (RL) offers advanced solutions to constrained optimal control problems. Existing studies in safe RL implicitly assume continuity in policy functions, where policies map states to actions in a smooth, uninterrupted manner; however, our research finds that in some scenarios, the feasible policy should be discontinuous or multi-valued, interpolating between discontinuous local optima can inevitably lead to constraint violations. We are the first to identify the generating mechanism of such a phenomenon, and employ topological analysis to rigorously prove the existence of policy bifurcation in safe RL, which corresponds to the contractibility of the reachable tuple. Our theorem reveals that in scenarios where the obstacle-free state space is non-simply connected, a feasible policy is required to be bifurcated, meaning its output action needs to change abruptly in response to the varying state. To train such a bifurcated policy, we propose a safe RL algorithm called multimodal policy optimization (MUPO), which utilizes a Gaussian mixture distribution as the policy output. The bifurcated behavior can be achieved by selecting the Gaussian component with the highest mixing coefficient. Besides, MUPO also integrates spectral normalization and forward KL divergence to enhance the policy's capability of exploring different modes. Experiments with vehicle control tasks show that our algorithm successfully learns the bifurcated policy and ensures satisfying safety, while a continuous policy suffers from inevitable constraint violations.
format Preprint
id arxiv_https___arxiv_org_abs_2403_12847
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Policy Bifurcation in Safe Reinforcement Learning
Zou, Wenjun
Lyu, Yao
Li, Jie
Yang, Yujie
Li, Shengbo Eben
Duan, Jingliang
Zhan, Xianyuan
Liu, Jingjing
Zhang, Yaqin
Li, Keqiang
Machine Learning
Safe reinforcement learning (RL) offers advanced solutions to constrained optimal control problems. Existing studies in safe RL implicitly assume continuity in policy functions, where policies map states to actions in a smooth, uninterrupted manner; however, our research finds that in some scenarios, the feasible policy should be discontinuous or multi-valued, interpolating between discontinuous local optima can inevitably lead to constraint violations. We are the first to identify the generating mechanism of such a phenomenon, and employ topological analysis to rigorously prove the existence of policy bifurcation in safe RL, which corresponds to the contractibility of the reachable tuple. Our theorem reveals that in scenarios where the obstacle-free state space is non-simply connected, a feasible policy is required to be bifurcated, meaning its output action needs to change abruptly in response to the varying state. To train such a bifurcated policy, we propose a safe RL algorithm called multimodal policy optimization (MUPO), which utilizes a Gaussian mixture distribution as the policy output. The bifurcated behavior can be achieved by selecting the Gaussian component with the highest mixing coefficient. Besides, MUPO also integrates spectral normalization and forward KL divergence to enhance the policy's capability of exploring different modes. Experiments with vehicle control tasks show that our algorithm successfully learns the bifurcated policy and ensures satisfying safety, while a continuous policy suffers from inevitable constraint violations.
title Policy Bifurcation in Safe Reinforcement Learning
topic Machine Learning
url https://arxiv.org/abs/2403.12847