Online Risk-Bounded Motion Planning for Autonomous Vehicles in Dynamic Environments
Not on the map. Why?
Abstract (arXiv)
A crucial challenge to efficient and robust motion planning for autonomous vehicles is understanding the intentions of the surrounding agents. Ignoring the intentions of the other agents in dynamic environments can lead to risky or over-conservative plans. In this work, we model the motion planning problem as a partially observable Markov decision process (POMDP) and propose an online system that combines an intent recognition algorithm and a POMDP solver to generate risk-bounded plans for the ego vehicle navigating with a number of dynamic agent vehicles. The intent recognition algorithm predicts the probabilistic hybrid motion states of each agent vehicle over a finite horizon using Bayesian filtering and a library of pre-learned maneuver motion models. We update the POMDP model with the intent recognition results in real time and solve it using a heuristic search algorithm which produces policies with upper-bound guarantees on the probability of near colliding with other dynamic agents. We demonstrate that our system is able to generate better motion plans in terms of efficiency and safety in a number of challenging environments including unprotected intersection left turns and lane changes as compared to the baseline methods.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Apr 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 3; 2024: 1; 2025: 0; 2026: 1.
9 papers.
- 2021Risk Conditioned Neural Motion Planningcited by 3
- 2023Graph-based Prediction and Planning Policy Network (GP3Net) for scalable self-driving in dynamic environments using Deep Reinforcement Learningcited by 3
- 2022Security of Deep Reinforcement Learning for Autonomous Driving: A Surveycited by 1
- 2023Dual Formulation for Chance Constrained Stochastic Shortest Path with Application to Autonomous Vehicle Behavior Planningcited by 1
- 2023Safe Explicable Planningcited by 1
- 2022A Fully Polynomial Time Approximation Scheme for Constrained MDPs and Stochastic Shortest Path under Local Transitionscited by 0
- 2022Multi-Agent Chance-Constrained Stochastic Shortest Path with Application to Risk-Aware Intelligent Intersectioncited by 0
- 2024Provably Efficient Partially Observable Risk-Sensitive Reinforcement Learning with Hindsight Observationcited by 0
- 2026MoMo: Conditioned Contrastive Representation Learning for Preference-Modulated Planningcited by 0
- 2026MoMo: Conditioned Contrastive Representation Learning for Preference-Modulated Planning8 May 2026
- 2024Provably Efficient Partially Observable Risk-Sensitive Reinforcement Learning with Hindsight Observation28 Feb 2024
- 2023Graph-based Prediction and Planning Policy Network (GP3Net) for scalable self-driving in dynamic environments using Deep Reinforcement Learning10 Dec 2023
- 2023Safe Explicable Planning4 Apr 2023
- 2023Dual Formulation for Chance Constrained Stochastic Shortest Path with Application to Autonomous Vehicle Behavior Planning25 Feb 2023
- 2022Security of Deep Reinforcement Learning for Autonomous Driving: A Survey12 Dec 2022
- 2022Multi-Agent Chance-Constrained Stochastic Shortest Path with Application to Risk-Aware Intelligent Intersection3 Oct 2022
- 2022A Fully Polynomial Time Approximation Scheme for Constrained MDPs and Stochastic Shortest Path under Local Transitions10 Apr 2022
- 2021Risk Conditioned Neural Motion Planning4 Aug 2021