pith. sign in

arxiv: 2605.22600 · v1 · pith:ZJ263CB3new · submitted 2026-05-21 · 💻 cs.RO

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

Zekun Xing , Ramkrishna Chaudhari , Marion Leibold , Dirk Wollherr , Martin Buss This is my paper

Pith reviewed 2026-05-22 05:25 UTC · model grok-4.3

classification 💻 cs.RO
keywords motion planningstochastic model predictive controlbranching structurescenario clusteringmulti-modal uncertaintyautonomous drivingchance constraints
0
0 comments X

The pith

Branch-stochastic model predictive control generates distinct trajectories for each possible intention of other vehicles while enforcing safety via chance constraints.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows how combining stochastic model predictive control with a branching structure lets a motion planner create separate plans for different possible intentions of surrounding cars. Standard stochastic control treats all intentions together and becomes overly cautious, but branching allows the vehicle to commit to one plan per likely intention once uncertainty drops. Scenario clustering merges similar predictions to keep the computation fast enough for real-time use, and an adaptive branching time decides when to split the plans. A sympathetic reader would care because this balance could make autonomous cars drive more naturally and safely in complex traffic without stopping for every possible future.

Core claim

By embedding a branching structure into stochastic model predictive control and adding scenario clustering based on high-level decision similarity, the planner produces intention-specific trajectories that satisfy chance constraints on trajectory uncertainty, with an adaptive branching time that postpones the split until uncertainty is low enough for tractability and safety.

What carries the argument

The branch-stochastic MPC, which applies stochastic chance constraints within each branch of a decision tree that separates plans according to surrounding vehicles' possible intentions, combined with clustering of prediction scenarios to maintain real-time feasibility.

Load-bearing premise

Clustering scenarios by high-level decision similarity preserves the probabilistic safety properties required by the chance constraints.

What would settle it

An experiment in which clustered scenarios cause the actual collision probability to exceed the specified chance constraint threshold in a simulated multi-modal traffic scene.

Figures

Figures reproduced from arXiv: 2605.22600 by Dirk Wollherr, Marion Leibold, Martin Buss, Ramkrishna Chaudhari, Zekun Xing.

Figure 1
Figure 1. Figure 1: Overview of motion planning framework. trajectory is applied to the system, and the process is repeated over a receding horizon. The SMPC OCP is formulated as: min U J(ξ0, U) (6a) s.t. ξk+1 = fd(ξk,uk), k ∈ [0, N − 1], (6b) ξk ∈ Xk, k ∈ [1, N], (6c) uk ∈ Uk, k ∈ [0, N − 1], (6d) Pr[ξk ∈ So,i] ≥ β o,i, k ∈ [1, N], i ∈ Θ o , o ∈ O, (6e) where N is the prediction horizon, U = {uk} N−1 k=0 denotes the sequence… view at source ↗
Figure 2
Figure 2. Figure 2: Illustration of the merged clusters obtained from sce [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Sketch of the traffic configuration used for simulations. [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Closed-loop results for the first scenario, comparing B [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Closed-loop behavior in the second scenario, comparing [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Computation time and average branch count of our [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes Branch-Stochastic Model Predictive Control (BSMPC) for autonomous driving motion planning under multi-modal uncertainty in surrounding vehicles' intentions and trajectories. It integrates SMPC chance constraints for trajectory-level uncertainty with a branching structure to produce distinct plans per intention mode, introduces scenario clustering by high-level decision similarity to maintain real-time tractability, and adds an adaptive branching-time mechanism that postpones commitment until intention uncertainty decreases. Simulation studies in highway scenarios are presented to demonstrate gains in safety, reduced conservatism, and real-time performance.

Significance. If the safety properties are preserved, the combination of branching with SMPC plus clustering could meaningfully reduce conservatism relative to standard SMPC while retaining probabilistic guarantees, offering a practical advance for real-time planners facing intention uncertainty. The adaptive branching-time idea is a useful addition for computational efficiency if its effect on chance-constraint validity is rigorously bounded.

major comments (2)
  1. [scenario clustering and chance-constraint sections] The central safety claim rests on the scenario clustering step preserving the validity of the original SMPC chance constraints. When scenarios are merged solely by high-level decision similarity, the effective probability mass assigned to tail trajectories inside each cluster can deviate from the unclustered distribution; this risks under-estimating the true violation probability and invalidating the chance-constraint guarantee. A formal bound or proof that the clustered measure still upper-bounds the original violation probability is required (see the scenario clustering description and the chance-constraint formulation).
  2. [adaptive branching-time computation] The adaptive branching-time computation inherits the same issue: by postponing the split, the method extends the horizon over which the (now-clustered) probabilities must satisfy the chance constraints. It is unclear whether the adaptive rule accounts for the altered probability masses or introduces additional conservatism to restore the original guarantee; without this, the safety claim for the full planning horizon is not yet established.
minor comments (2)
  1. The abstract states that simulations demonstrate improvements but supplies no quantitative metrics, baseline comparisons, or violation-rate statistics; adding these numbers would allow readers to judge the practical magnitude of the claimed gains.
  2. Notation for the clustered scenario probabilities and the branching-time decision variable should be introduced earlier and used consistently to improve readability of the algorithmic description.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thoughtful and detailed comments on the safety properties of the proposed Branch-Stochastic MPC framework. We address each major comment below and describe the revisions we will make to strengthen the formal guarantees.

read point-by-point responses

  1. Referee: [scenario clustering and chance-constraint sections] The central safety claim rests on the scenario clustering step preserving the validity of the original SMPC chance constraints. When scenarios are merged solely by high-level decision similarity, the effective probability mass assigned to tail trajectories inside each cluster can deviate from the unclustered distribution; this risks under-estimating the true violation probability and invalidating the chance-constraint guarantee. A formal bound or proof that the clustered measure still upper-bounds the original violation probability is required (see the scenario clustering description and the chance-constraint formulation).

    Authors: We agree that the manuscript currently motivates clustering via high-level decision similarity for tractability but does not supply a formal proof that the clustered distribution preserves the original chance-constraint validity. In the revision we will add a dedicated subsection deriving a conservative bound: by assigning to each cluster the worst-case (highest-violation) trajectory within it and inflating its probability mass by the maximum intra-cluster deviation, the chance constraints evaluated on the clustered set remain valid for the original measure. The added analysis will quantify the extra conservatism introduced and will be supported by a short proof sketch. revision: yes

  2. Referee: [adaptive branching-time computation] The adaptive branching-time computation inherits the same issue: by postponing the split, the method extends the horizon over which the (now-clustered) probabilities must satisfy the chance constraints. It is unclear whether the adaptive rule accounts for the altered probability masses or introduces additional conservatism to restore the original guarantee; without this, the safety claim for the full planning horizon is not yet established.

    Authors: The referee is correct that the interaction between adaptive branching and clustering must be analyzed explicitly. The current adaptive rule triggers branching once mode-probability entropy drops below a threshold, thereby shortening the interval during which clustered probabilities are used. To close the gap we will augment the revision with a lemma showing that the entropy-based trigger, combined with the worst-case probability inflation already introduced for clustering, ensures the chance constraints hold over the entire horizon. The added material will also discuss how the adaptive mechanism limits the accumulation of approximation error. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation builds on external SMPC and branching foundations

full rationale

The paper introduces a combination of SMPC with a branching structure, plus scenario clustering by high-level decision similarity and adaptive branching-time selection. These are framed as novel extensions that reduce conservatism while preserving chance-constraint safety. No equations, parameter fits, or self-citations are shown that reduce the central safety or tractability claims to tautological redefinitions of the inputs. The clustering step is presented as a computational approximation whose validity is asserted via the maintained chance constraints rather than derived by construction from the unclustered distribution. The overall chain therefore remains self-contained against the cited SMPC and branching literature.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract does not detail any specific free parameters, axioms, or new entities; typical control papers may have probability thresholds or clustering parameters but not specified here.

pith-pipeline@v0.9.0 · 5688 in / 949 out tokens · 49219 ms · 2026-05-22T05:25:13.351397+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

58 extracted references · 58 canonical work pages

  1. [1]

    IEEE Transactions on Intelligent Vehicles , volume=

    Non-conservative trajectory planning for automated vehicles by estimating intentions of dynamic obstacles , author=. IEEE Transactions on Intelligent Vehicles , volume=. 2023 , publisher=

    work page 2023

  2. [2]

    A new approach to linear filtering and prediction problems , author=

    work page

  3. [3]

    IEEE Transactions on aerospace and electronic systems , volume=

    Interacting multiple model methods in target tracking: a survey , author=. IEEE Transactions on aerospace and electronic systems , volume=. 1998 , publisher=

    work page 1998

  4. [4]

    IEEE Transactions on Intelligent Vehicles , volume=

    Interaction-aware motion planning for autonomous vehicles with multi-modal obstacle uncertainty predictions , author=. IEEE Transactions on Intelligent Vehicles , volume=. 2023 , publisher=

    work page 2023

  5. [5]

    IEEE Robotics and Automation Letters , volume=

    Interaction-aware motion prediction for autonomous driving: A multiple model kalman filtering scheme , author=. IEEE Robotics and Automation Letters , volume=. 2020 , publisher=

    work page 2020

  6. [6]

    12th international symposium on advanced vehicle control , volume=

    Stochastic predictive control of autonomous vehicles in uncertain environments , author=. 12th international symposium on advanced vehicle control , volume=

    work page

  7. [7]

    IEEE Transactions on Intelligent Vehicles , volume=

    Stochastic model predictive control with a safety guarantee for automated driving , author=. IEEE Transactions on Intelligent Vehicles , volume=. 2021 , publisher=

    work page 2021

  8. [8]

    Integer Programming , year =

    Conforti, Michele and Cornu. Integer Programming , year =

    work page

  9. [9]

    53rd IEEE Conference on Decision and Control , pages=

    Model predictive control with signal temporal logic specifications , author=. 53rd IEEE Conference on Decision and Control , pages=. 2014 , organization=

    work page 2014

  10. [10]

    2022 European Control Conference (ECC) , pages=

    Interaction-aware moving target model predictive control for autonomous vehicles motion planning , author=. 2022 European Control Conference (ECC) , pages=. 2022 , organization=

    work page 2022

  11. [11]

    2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC) , pages=

    Stochastic mpc with multi-modal predictions for traffic intersections , author=. 2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC) , pages=. 2022 , organization=

    work page 2022

  12. [12]

    IEEE Transactions on Control Systems Technology , year=

    Interaction-aware traffic prediction and scenario-based model predictive control for autonomous vehicles on highways , author=. IEEE Transactions on Control Systems Technology , year=

    work page

  13. [13]

    IEEE Transactions on Intelligent Transportation Systems , year=

    A game theoretic decision-making framework with conflict-aware Nash equilibrium selection for autonomous vehicles at uncontrolled intersections , author=. IEEE Transactions on Intelligent Transportation Systems , year=

    work page

  14. [14]

    2021 IEEE International Conference on Robotics and Automation (ICRA) , pages=

    Anytime game-theoretic planning with active reasoning about humans’ latent states for human-centered robots , author=. 2021 IEEE International Conference on Robotics and Automation (ICRA) , pages=. 2021 , organization=

    work page 2021

  15. [15]

    Proceedings of the fifteenth ACM conference on Economics and computation , pages=

    Level-0 meta-models for predicting human behavior in games , author=. Proceedings of the fifteenth ACM conference on Economics and computation , pages=

    work page

  16. [16]

    IEEE Transactions on Intelligent Transportation Systems , year=

    Dynamic Game-Theoretical Decision-Making Framework for Vehicle-Pedestrian Interaction With Human Bounded Rationality , author=. IEEE Transactions on Intelligent Transportation Systems , year=

    work page

  17. [17]

    2024 IEEE Intelligent Vehicles Symposium (IV) , pages=

    Robust and efficient curvilinear coordinate transformation with guaranteed map coverage for motion planning , author=. 2024 IEEE Intelligent Vehicles Symposium (IV) , pages=. 2024 , organization=

    work page 2024

  18. [18]

    Journal of Process Control , volume=

    Stochastic linear model predictive control with chance constraints--a review , author=. Journal of Process Control , volume=. 2016 , publisher=

    work page 2016

  19. [19]

    2022 IEEE Intelligent Vehicles Symposium (IV) , pages=

    On integrating POMDP and scenario MPC for planning under uncertainty--with applications to highway driving , author=. 2022 IEEE Intelligent Vehicles Symposium (IV) , pages=. 2022 , organization=

    work page 2022

  20. [20]

    arXiv preprint arXiv:2408.13742 , year=

    Multi-modal integrated prediction and decision-making with adaptive interaction modality explorations , author=. arXiv preprint arXiv:2408.13742 , year=

    work page arXiv

  21. [21]

    Foundations and Trends

    Social interactions for autonomous driving: A review and perspectives , author=. Foundations and Trends. 2022 , publisher=

    work page 2022

  22. [22]

    Conference on Robot Learning , pages=

    MultiPath: Multiple Probabilistic Anchor Trajectory Hypotheses for Behavior Prediction , author=. Conference on Robot Learning , pages=. 2020 , organization=

    work page 2020

  23. [23]

    IEEE Transactions on Intelligent Vehicles , volume=

    Interaction-aware personalized trajectory prediction for traffic participant based on interactive multiple model , author=. IEEE Transactions on Intelligent Vehicles , volume=. 2022 , publisher=

    work page 2022

  24. [24]

    Advances in Neural Information Processing Systems , volume=

    Motion transformer with global intention localization and local movement refinement , author=. Advances in Neural Information Processing Systems , volume=

    work page

  25. [25]

    IEEE Intelligent Transportation Systems Magazine , volume=

    Predictive trajectory planning for on-road autonomous vehicles based on a spatiotemporal risk field , author=. IEEE Intelligent Transportation Systems Magazine , volume=. 2022 , publisher=

    work page 2022

  26. [26]

    IEEE Transactions on intelligent vehicles , volume=

    A survey of motion planning and control techniques for self-driving urban vehicles , author=. IEEE Transactions on intelligent vehicles , volume=. 2016 , publisher=

    work page 2016

  27. [27]

    Reachability-Based Contingency Planning Against Multi-Modal Predictions with Branch MPC , year=

    Bouzidi, Mohamed-Khalil and Derajic, Bojan and Goehring, Daniel and Reichardt, Joerg , booktitle=. Reachability-Based Contingency Planning Against Multi-Modal Predictions with Branch MPC , year=

    work page

  28. [28]

    IEEE Robotics and Automation Letters , volume=

    Contingency games for multi-agent interaction , author=. IEEE Robotics and Automation Letters , volume=. 2024 , publisher=

    work page 2024

  29. [29]

    IEEE Access , volume=

    Driver-pedestrian interactions at unsignalized crossings are not in line with the Nash equilibrium , author=. IEEE Access , volume=. 2023 , publisher=

    work page 2023

  30. [30]

    IEEE Transactions on Intelligent Transportation Systems , volume=

    Game-theoretic modeling of traffic in unsignalized intersection network for autonomous vehicle control verification and validation , author=. IEEE Transactions on Intelligent Transportation Systems , volume=. 2020 , publisher=

    work page 2020

  31. [31]

    2011 IEEE intelligent vehicles symposium (IV) , pages=

    Towards fully autonomous driving: Systems and algorithms , author=. 2011 IEEE intelligent vehicles symposium (IV) , pages=. 2011 , organization=

    work page 2011

  32. [32]

    European Conference on Computer Vision , pages=

    Trajectron++: Dynamically-feasible trajectory forecasting with heterogeneous data , author=. European Conference on Computer Vision , pages=. 2020 , organization=

    work page 2020

  33. [33]

    IEEE Transactions on Intelligent Transportation Systems , volume=

    Efficient sampling-based motion planning for on-road autonomous driving , author=. IEEE Transactions on Intelligent Transportation Systems , volume=. 2015 , publisher=

    work page 2015

  34. [34]

    2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC) , pages=

    Safe Reinforcement Learning for Urban Driving using Invariably Safe Braking Sets , author=. 2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC) , pages=. 2022 , organization=

    work page 2022

  35. [35]

    Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

    Gameformer: Game-theoretic modeling and learning of transformer-based interactive prediction and planning for autonomous driving , author=. Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

    work page

  36. [36]

    IEEE Transactions on Intelligent Transportation Systems , volume=

    Trajectory planning for autonomous high-speed overtaking in structured environments using robust MPC , author=. IEEE Transactions on Intelligent Transportation Systems , volume=. 2019 , publisher=

    work page 2019

  37. [37]

    IEEE Transactions on Intelligent Transportation Systems , volume=

    Safe optimization of highway traffic with robust model predictive control-based cooperative adaptive cruise control , author=. IEEE Transactions on Intelligent Transportation Systems , volume=. 2017 , publisher=

    work page 2017

  38. [38]

    2021 IEEE International Intelligent Transportation Systems Conference (ITSC) , pages=

    Multistage stochastic model predictive control for urban automated driving , author=. 2021 IEEE International Intelligent Transportation Systems Conference (ITSC) , pages=. 2021 , organization=

    work page 2021

  39. [39]

    2023 IEEE Intelligent Vehicles Symposium (IV) , pages=

    Scenario-based decision-making, planning and control for interaction-aware autonomous driving on highways , author=. 2023 IEEE Intelligent Vehicles Symposium (IV) , pages=. 2023 , organization=

    work page 2023

  40. [40]

    IEEE Intelligent transportation systems magazine , volume=

    Scenario model predictive control for lane change assistance and autonomous driving on highways , author=. IEEE Intelligent transportation systems magazine , volume=. 2017 , publisher=

    work page 2017

  41. [41]

    and Yeh, Goro and Singh, Avinash and Bae, Sangjae , booktitle=

    Isele, David and Añon, Alexandre Miranda and Tariq, Faizan M. and Yeh, Goro and Singh, Avinash and Bae, Sangjae , booktitle=. Delayed-Decision Motion Planning in the Presence of Multiple Predictions , year=

    work page

  42. [42]

    IEEE Robotics and Automation Letters , volume=

    Interactive multi-modal motion planning with branch model predictive control , author=. IEEE Robotics and Automation Letters , volume=. 2022 , publisher=

    work page 2022

  43. [43]

    2019 American Control Conference (ACC) , pages=

    Contingency model predictive control for automated vehicles , author=. 2019 American Control Conference (ACC) , pages=. 2019 , organization=

    work page 2019

  44. [44]

    2024 IEEE 27th International Conference on Intelligent Transportation Systems (ITSC) , pages=

    Motion planning under uncertainty: Integrating learning-based multi-modal predictors into branch model predictive control , author=. 2024 IEEE 27th International Conference on Intelligent Transportation Systems (ITSC) , pages=. 2024 , organization=

    work page 2024

  45. [45]

    IEEE Transactions on Intelligent Vehicles , volume=

    Resilient branching MPC for multi-vehicle traffic scenarios using adversarial disturbance sequences , author=. IEEE Transactions on Intelligent Vehicles , volume=. 2022 , publisher=

    work page 2022

  46. [46]

    2024 IEEE 63rd Conference on Decision and Control (CDC) , pages=

    An Efficient Risk-aware Branch MPC for Automated Driving that is Robust to Uncertain Vehicle Behaviors , author=. 2024 IEEE 63rd Conference on Decision and Control (CDC) , pages=. 2024 , organization=

    work page 2024

  47. [47]

    2011 , publisher =

    Rajamani, Rajesh , title =. 2011 , publisher =

    work page 2011

  48. [48]

    kdd , volume=

    A density-based algorithm for discovering clusters in large spatial databases with noise , author=. kdd , volume=

    work page

  49. [49]

    2019 7th International Conference on Information and Communication Technology (ICoICT) , pages=

    The MSOF-DTW Method for Checking Timeseries Similarities , author=. 2019 7th International Conference on Information and Communication Technology (ICoICT) , pages=. 2019 , organization=

    work page 2019

  50. [50]

    Proceedings of the 3rd international conference on knowledge discovery and data mining , pages=

    Using dynamic time warping to find patterns in time series , author=. Proceedings of the 3rd international conference on knowledge discovery and data mining , pages=

    work page

  51. [51]

    2018 21st International Conference on Intelligent Transportation Systems (ITSC) , pages=

    Combining stochastic and scenario model predictive control to handle target vehicle uncertainty in an autonomous driving highway scenario , author=. 2018 21st International Conference on Intelligent Transportation Systems (ITSC) , pages=. 2018 , organization=

    work page 2018

  52. [52]

    2017 IEEE Intelligent Vehicles Symposium (IV) , pages=

    CommonRoad: Composable benchmarks for motion planning on roads , author=. 2017 IEEE Intelligent Vehicles Symposium (IV) , pages=. 2017 , organization=

    work page 2017

  53. [53]

    Mathematical Programming Computation , volume=

    CasADi: a software framework for nonlinear optimization and optimal control , author=. Mathematical Programming Computation , volume=. 2019 , publisher=

    work page 2019

  54. [54]

    Mathematical programming , volume=

    On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , author=. Mathematical programming , volume=. 2006 , publisher=

    work page 2006

  55. [55]

    IEEE Transactions on Intelligent Transportation Systems , volume=

    Interaction-aware trajectory prediction and planning for autonomous vehicles in forced merge scenarios , author=. IEEE Transactions on Intelligent Transportation Systems , volume=. 2022 , publisher=

    work page 2022

  56. [56]

    2023 IEEE Intelligent Vehicles Symposium (IV) , pages=

    Interaction and decision making-aware motion planning using branch model predictive control , author=. 2023 IEEE Intelligent Vehicles Symposium (IV) , pages=. 2023 , organization=

    work page 2023

  57. [57]

    IEEE transactions on control systems technology , volume=

    Predictive control for autonomous driving with uncertain, multimodal predictions , author=. IEEE transactions on control systems technology , volume=. 2024 , publisher=

    work page 2024

  58. [58]

    Information retrieval for music and motion , volume=

    Dynamic time warping , author=. Information retrieval for music and motion , volume=. 2007 , publisher=

    work page 2007