Branch-Stochastic Model Predictive Control for Motion Planning under Multi-Modal Uncertainty with Scenario Clustering

• URL: http://arxiv.org/abs/2605.22600v1
• Date: Thu, 21 May 2026 15:15:16 GMT
• Title: Branch-Stochastic Model Predictive Control for Motion Planning under Multi-Modal Uncertainty with Scenario Clustering
• Abstract summary: We present a novel combination of SMPC and the branching structure, enabling the planner to generate distinct trajectories for different possible intentions.<n>A novel scenario clustering is proposed to merge prediction scenarios based on high-level decision similarity, thereby ensuring real-time tractability.<n> Simulation studies in challenging highway scenarios demonstrate that the proposed method improves safety, reduces conservatism, and achieves real-time computational performance.
• Score: 4.456206353869196
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Motion planning for autonomous driving must account for multi-modal uncertainty in both the intentions and trajectories of surrounding vehicles. Handling uncertainty in a worst-case manner guarantees robustness but often leads to excessive conservatism. Stochastic Model Predictive Control (SMPC) reduces trajectory-level conservatism through chance constraints, yet remains conservative with respect to intention uncertainty since constraints must hold across all intentions. We present a novel combination of SMPC and the branching structure, enabling the planner to generate distinct trajectories for different possible intentions while maintaining safety under trajectory uncertainty. A novel scenario clustering is proposed to merge prediction scenarios based on high-level decision similarity, thereby ensuring real-time tractability. Furthermore, an adaptive branching-time computation postpones commitment to separate plans until intention uncertainty is sufficiently reduced. Simulation studies in challenging highway scenarios demonstrate that the proposed method improves safety, reduces conservatism, and achieves real-time computational performance.

Related papers

• Stochastic Multi-Objective Kinodynamic Planning Against Adversaries [4.800861909357391]
  This paper addresses multi-objective kinodynamic planning in environments with hybrid adversaries that probabilistically transition to adversarial modes based on the ego state.<n>We introduce Multi-Objective RRT (SMO-RRT), for which we prove probabilistic completeness, followed by Multi-Objective Stable RRT (SMO-SST)<n>For both algorithms, we derive a finite-sample bound on the probability of chance constraint violation for systems with non-Gaussian, state-dependent uncertainty.
  arXiv  Detail & Related papers  (2026-07-21T16:56:34Z)
• Safe Overtaking for Autonomous Racing Using Hierarchical Optimization and Learning-Based Control [14.05083688629287]
  This paper proposes a hierarchical overtaking framework that separates maneuver-level decision making from safety-certified trajectory control.<n>A reinforcement learning policy adapts the discrete-time CBF decay parameter online, enabling context-dependent modulation of safety margins without directly controlling vehicle inputs.
  arXiv  Detail & Related papers  (2026-07-15T00:19:14Z)
• World Models as Adversaries: Multi-Agent Self-Play Fine-Tuning for Robust Motion Planning [60.88859946006306]
  Adversa World Modeling is a theoretically grounded multi-agent self-play fine-tuning framework.<n>In inner minimization, the planner's predictive world model is converted into a role-conditioned adversary that learns sparse, scene-adaptive attack coalitions.<n> Experiments on the nuPlan and InterPlan benchmarks demonstrate that our method generates transferable adversarial interactions.
  arXiv  Detail & Related papers  (2026-07-12T07:44:16Z)
• Bridging Predictive Uncertainty and Safe Action: Sample-Conditioned Differentiable Planning for Autonomous Driving [46.91409391705346]
  Complex, dynamic, and interactive driving environments pose significant challenges for autonomous driving.<n>A fundamental bottleneck in current systems is the disconnect between highly expressive uncertainty modeling and interpretable, safe motion planning.<n>We propose a novel sample-conditioned differentiable planning framework that bridges this gap by explicitly incorporating diffusion-generated future trajectories into the optimization process.
  arXiv  Detail & Related papers  (2026-06-02T08:10:02Z)
• Probabilistic Recursively Feasible Motion Planning Under Uncertain Environments [5.47494170074467]
  We present a Probabilistic Recursively Feasible Model Predictive Control (PRF-MPC) framework that guarantees recursive feasibility with a specified probability.<n>Building on this analysis, we construct safety constraints that ensure, with high probability, that the current safe set is contained within the safe sets at future time steps.
  arXiv  Detail & Related papers  (2026-05-18T18:35:37Z)
• Action-Conditioned Risk Gating for Safety-Critical Control under Partial Observability [79.08785366532287]
  We propose a lightweight risk-gated reinforcement learning approximation for risk-sensitive control under partial observability.<n>We evaluate the approach in two safety-critical partially observable domains: automated glucose regulation and safety-constrained navigation.
  arXiv  Detail & Related papers  (2026-05-14T01:23:09Z)
• Decentralized Contingency MPC based on Safe Sets for Nonlinear Multi-agent Collision Avoidance [1.5856188608650232]
  This paper develops a decentralized contingency MPC framework for multi-agent systems with nonlinear dynamics.<n>Under a state-only information pattern, each agent follows the same consensual rule set, enabling safe decentralized planning without communication.<n> Simulation results demonstrate performance in both sparse and dense multi-agent environments.
  arXiv  Detail & Related papers  (2026-05-11T15:40:36Z)
• Statistical Contraction for Chance-Constrained Trajectory Optimization of Non-Gaussian Stochastic Systems [0.0]
  Our framework employs conformal inference to generate confidence sets for the closed-loop dynamics around arbitrary reference trajectories.<n>Via appropriate constraint tightening, chance constraints can be reformulated into tractable, statistically valid deterministic constraints on the reference trajectories.<n>This enables a formal pathway to leverage and validate learning-based motion planners and controllers, such as those with neural contraction metrics, in safety-critical real-world applications.
  arXiv  Detail & Related papers  (2026-03-07T08:01:20Z)
• Scenario-aware Uncertainty Quantification for Trajectory Prediction with Statistical Guarantees [16.41262478059784]
  We propose a novel scenario-aware uncertainty quantification framework to provide the predicted trajectories with prediction intervals and reliability assessment.<n>We evaluated our framework using the real-world nuPlan dataset, demonstrating its effectiveness in scenario-aware uncertainty quantification and reliability assessment.
  arXiv  Detail & Related papers  (2025-12-05T12:54:39Z)
• ResAD: Normalized Residual Trajectory Modeling for End-to-End Autonomous Driving [64.42138266293202]
  ResAD is a Normalized Residual Trajectory Modeling framework.<n>It reframes the learning task to predict the residual deviation from an inertial reference.<n>On the NAVSIM benchmark, ResAD achieves a state-of-the-art PDMS of 88.6 using a vanilla diffusion policy.
  arXiv  Detail & Related papers  (2025-10-09T17:59:36Z)
• Adaptive Conformal Prediction Intervals Over Trajectory Ensembles [50.31074512684758]
  Future trajectories play an important role across domains such as autonomous driving, hurricane forecasting, and epidemic modeling.<n>We propose a unified framework based on conformal prediction that transforms sampled trajectories into calibrated prediction intervals with theoretical coverage guarantees.
  arXiv  Detail & Related papers  (2025-08-18T21:14:07Z)
• Plan-R1: Safe and Feasible Trajectory Planning as Language Modeling [74.41886258801209]
  We propose a two-stage trajectory planning framework that decouples principle alignment from behavior learning.<n>Plan-R1 significantly improves planning safety and feasibility, achieving state-of-the-art performance.
  arXiv  Detail & Related papers  (2025-05-23T09:22:19Z)
• ConstrainedZero: Chance-Constrained POMDP Planning using Learned Probabilistic Failure Surrogates and Adaptive Safety Constraints [34.9739641898452]
  This work introduces the ConstrainedZero policy algorithm that solves CC-POMDPs in belief space by learning neural network approximations of the optimal value and policy. Results show that by separating safety constraints from the objective we can achieve a target level of safety without optimizing the balance between rewards and costs.
  arXiv  Detail & Related papers  (2024-05-01T17:17:22Z)
• Provable Guarantees for Generative Behavior Cloning: Bridging Low-Level Stability and High-Level Behavior [51.60683890503293]
  We propose a theoretical framework for studying behavior cloning of complex expert demonstrations using generative modeling. We show that pure supervised cloning can generate trajectories matching the per-time step distribution of arbitrary expert trajectories.
  arXiv  Detail & Related papers  (2023-07-27T04:27:26Z)
• Bootstrap Motion Forecasting With Self-Consistent Constraints [52.88100002373369]
  We present a novel framework to bootstrap Motion forecasting with Self-consistent Constraints. The motion forecasting task aims at predicting future trajectories of vehicles by incorporating spatial and temporal information from the past. We show that our proposed scheme consistently improves the prediction performance of several existing methods.
  arXiv  Detail & Related papers  (2022-04-12T14:59:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.