This work constructs a confidence set for the unknown categorical mode law and derives a multiplicative domination bound that transfers a Safe-Horizon collision-risk certificate from a selected scenario-sampling distribution to every law in the confidence set.
Abstract
Scenario-based MPC is an attractive strategy for chance-constrained motion planning that approximates uncertainty via a finite set of sampled scenarios. As a sampling-based method, scenario-based MPC is sensitive to distribution mismatch. We address this problem in the context of Safe-Horizon Model Predictive Control (SH-MPC) with obstacles governed by switching dynamic modes. From finite mode observations, we construct a confidence set for the unknown categorical mode law and derive a multiplicative domination bound that transfers a Safe-Horizon collision-risk certificate from a selected scenario-sampling distribution to every law in the confidence set. Wasserstein geometry is used to regularize probability reallocation among modes according to the similarity of their induced trajectory predictions, while a collision-risk surrogate biases sampling toward dangerous modes. The resulting certificate explicitly quantifies the additional tightening required under distribution mismatch and exposes the multiplicative conservatism that arises when several obstacle-wise transfer factors are combined
Safe navigation in human crowds requires efficiency and reliability. Learning-based policies run fast but can fail under distribution shift, whereas Hamilton–Jacobi (HJ) reachability offers principled safety guarantees but is computationally expensive. We propose a prediction-conditioned reachability framework that bri...
I. Winata, Junghyun Oh· IEEE Robotics and Automation...· 0 citations
This paper presents a method for approximating occupancy distributions, a common probabilistic representation used in trajectory planning for autonomous vehicles operating in uncertain environments. The proposed method employs B-spline surfaces in conjunction with regularization techniques to ensure smoothness and diff...
Learned local navigation in crowded indoor environments is sensitive to how dynamic obstacle motion is represented, while collision-prone behaviour may persist after nominal policy training. We present a risk-aware reinforcement-learning framework that addresses these two issues through an uncertainty-aware Dynamic Unc...
Hao-Yun Feng, A. Rubio-Solis, Zhao-Dong Guo et al.· 0 citations
Diffusion models can represent complex, multimodal trajectory distributions, but extracting uncertainty from them typically requires costly Monte Carlo sampling. This limits their use in real-time control, where robots must rapidly assess risk and maintain safety margins. We introduce Score-Curvature for Online Precisi...
Zhi-Wei Xue, Jia-Yue Kam, Jin-Hang Qiu et al.· 0 citations
Data-calibrated stochastic MPC typically builds separate risk margins for many events along the horizon, such as times, facets, state/input components, or obstacles, and then combines them with a union bound. This approach is valid, but it does not match the key object used in the tube-MPC recursive-feasibility proof,...
Constrained Annealing-based Sampling MPC (CAS-MPC), which integrates inequality constraints via a primal–dual weight reshaping scheme that preserves sample diversity, and a hybrid refinement strategy that switches to Sequential Linear–Quadratic MPC for millimeter-level precision once near the goal is proposed.
Chenghao Wang, Diego Romeres, Alexander V. Schperberg et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.