Probabilistic Recursively Feasible Motion Planning Under Uncertain Environments

• URL: http://arxiv.org/abs/2605.19015v1
• Date: Mon, 18 May 2026 18:35:37 GMT
• Title: Probabilistic Recursively Feasible Motion Planning Under Uncertain Environments
• Abstract summary: 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.
• Score: 5.47494170074467
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Safe motion planning in uncertain, time-varying environments is challenging because the safe region can change unpredictably across planning steps, often causing a loss of recursive feasibility. In this work, we present a Probabilistic Recursively Feasible Model Predictive Control (PRF-MPC) framework that guarantees recursive feasibility with a specified probability. We introduce properties that an ideal predictor should satisfy to ensure distributional consistency, and use these properties to derive closed-form expressions for the means and covariances of trajectories predicted at future time steps. 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, thereby probabilistically guaranteeing recursive feasibility. Simulation results on a lane-change scenario demonstrate that the proposed method significantly improves recursive feasibility.

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)
• 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)
• Branch-Stochastic Model Predictive Control for Motion Planning under Multi-Modal Uncertainty with Scenario Clustering [4.456206353869196]
  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.
  arXiv  Detail & Related papers  (2026-05-21T15:15:16Z)
• Data-driven Reachable Set Estimation with Tunable Adversarial and Wasserstein Distributional Guarantees [0.0]
  We study finite horizon reachable set estimation for unknown discrete-time dynamical systems using only sampled state trajectories.<n>We show how it can be tailored to reachable set estimation, where one must learn a family of sets based on whole trajectories.
  arXiv  Detail & Related papers  (2026-04-14T12:23:14Z)
• 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)
• Conformal Prediction in The Loop: A Feedback-Based Uncertainty Model for Trajectory Optimization [3.761729592527251]
  Conformal Prediction (CP) is a powerful statistical machine learning tool to construct uncertainty sets with coverage guarantees.<n>We propose a novel Feedback-Based CP (Fb-CP) framework for shrinking-horizon TO with a joint risk constraint.
  arXiv  Detail & Related papers  (2025-10-18T07:11:23Z)
• 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)
• Calibrated Probabilistic Forecasts for Arbitrary Sequences [58.54729945445505]
  Real-world data streams can change unpredictably due to distribution shifts, feedback loops and adversarial actors.<n>We present a forecasting framework ensuring valid uncertainty estimates regardless of how data evolves.
  arXiv  Detail & Related papers  (2024-09-27T21:46:42Z)
• Probabilistic Conformal Prediction with Approximate Conditional Validity [81.30551968980143]
  We develop a new method for generating prediction sets that combines the flexibility of conformal methods with an estimate of the conditional distribution. Our method consistently outperforms existing approaches in terms of conditional coverage.
  arXiv  Detail & Related papers  (2024-07-01T20:44:48Z)
• Recursively Feasible Shrinking-Horizon MPC in Dynamic Environments with Conformal Prediction Guarantees [23.32696414512787]
  We consider controlling a deterministic autonomous system that interacts with uncontrollable agents during its mission. Existing works derive high-confidence prediction regions for the unknown agent, and integrate these regions in the design of suitable safety constraints for MPC. We propose a shrinking-horizon MPC that guarantees recursive feasibility via a gradual relaxation of the safety constraints as new prediction regions become available online.
  arXiv  Detail & Related papers  (2024-05-17T16:07:03Z)
• 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)
• Information-Theoretic Safe Bayesian Optimization [59.758009422067005]
  We consider a sequential decision making task, where the goal is to optimize an unknown function without evaluating parameters that violate an unknown (safety) constraint. Most current methods rely on a discretization of the domain and cannot be directly extended to the continuous case. We propose an information-theoretic safe exploration criterion that directly exploits the GP posterior to identify the most informative safe parameters to evaluate.
  arXiv  Detail & Related papers  (2024-02-23T14:31:10Z)
• Recursively Feasible Probabilistic Safe Online Learning with Control Barrier Functions [60.26921219698514]
  We introduce a model-uncertainty-aware reformulation of CBF-based safety-critical controllers. We then present the pointwise feasibility conditions of the resulting safety controller. We use these conditions to devise an event-triggered online data collection strategy.
  arXiv  Detail & Related papers  (2022-08-23T05:02:09Z)

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.