BAP-SRL: Bayesian Adaptive Priority Safe Reinforcement Learning for Vehicle Motion Planning at Mixed Traffic Intersections
Yuansheng Lian, Ke Zhang, Yaming Guo, Shen Li, Meng Li
TL;DR
The paper tackles safe motion planning for autonomous vehicles at mixed-traffic intersections with multiple heterogeneous risk sources. It introduces Bayesian Adaptive Priority Safe Reinforcement Learning (BAP-SRL), which treats constraint priority as latent variables and gates policy gradients via Bayesian updates that combine historical optimization difficulty with instantaneous risk evidence. The method extends PPO-Lagrangian with a per-constraint adaptive weight $w_k(s_t,a_t)$ and decoupled reward and cost critics, reducing gradient cancellation and improving safety without sacrificing efficiency. Experiments in CARLA demonstrate lower collision rates, reduced average risk, and robust performance across adversarial scenarios, indicating practical impact for real-world mixed-traffic autonomy.
Abstract
Navigating urban intersections, especially when interacting with heterogeneous traffic participants, presents a formidable challenge for autonomous vehicles (AVs). In such environments, safety risks arise simultaneously from multiple sources, each carrying distinct priority levels and sensitivities that necessitate differential protection preferences. While safe reinforcement learning (RL) offers a robust paradigm for constrained decision-making, existing methods typically model safety as a single constraint or employ static, heuristic weighting schemes for multiple constraints. These approaches often fail to address the dynamic nature of multi-source risks, leading to gradient cancellation that hampers learning, and suboptimal trade-offs in critical dilemma zones. To address this, we propose a Bayesian adaptive priority safe reinforcement learning (BAP-SRL) based motion planning framework. Unlike heuristic weighting schemes, BAP formulates constraint prioritization as a probabilistic inference task. By modeling historical optimization difficulty as a Bayesian prior and instantaneous risk evidence as a likelihood, BAP dynamically gates gradient updates using a Bayesian inference mechanism on latent constraint criticality. Extensive experiments demonstrate that our approach outperforms state-of-the-art baselines in handling interactions with stochastic, heterogeneous agents, achieving lower collision rates and smoother conflict resolution.
