Conformal Constraint Tightening for Chance-Constrained Motion Planning with Unknown Dynamics

• URL: http://arxiv.org/abs/2607.22409v1
• Date: Fri, 24 Jul 2026 15:27:07 GMT
• Title: Conformal Constraint Tightening for Chance-Constrained Motion Planning with Unknown Dynamics
• Abstract summary: Motion planning algorithms compute control sequences that drive autonomous robots to goal regions while avoiding unsafe states.<n>Existing methods, from sampling-based planning to deep reinforcement learning, typically provide task-completion guarantees only with respect to a nominal model or simulator.<n>This letter addresses this limitation for systems with unknown dynamics and an available approximate nominal model.<n>We leverage conformal prediction to provide a probabilistic bound on the nominal-to-true trajectory deviation over a distribution of planning problems.
• Score: 5.583011507848018
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Motion planning algorithms compute control sequences that drive autonomous robots to goal regions while avoiding unsafe states. Existing methods, from sampling-based planning to deep reinforcement learning, typically provide task-completion guarantees only with respect to a nominal model or simulator, which may be invalidated when the true dynamics are unknown or difficult to model accurately. This letter addresses this limitation for systems with unknown dynamics and an available approximate nominal model, contributing a planner-agnostic constraint-tightening procedure that equips existing planners with a probabilistic task-completion guarantee on the true system. We leverage conformal prediction to provide a probabilistic bound on the nominal-to-true trajectory deviation over a distribution of planning problems. We tighten the planning constraints using that bound, and show that solving the tightened problem under the nominal model is a sufficient condition for solving the original problem on the true system with a prescribed probability. We validate the theoretical guarantees empirically and demonstrate substantially improved task completion relative to nominal-model planning.

Related papers

• Occluding the Solution Space: Planner-Agnostic Adversarial Attacks on Tolerance-Aware Manipulation [57.9825059129472]
  We propose a planner-agnostic attack framework for tolerance-aware manipulation.<n>Our approach shifts the evaluation paradigm to task-level feasibility over goal regions.<n>Online, we formulate the attack as a budgeted maximum-coverage optimization.
  arXiv  Detail & Related papers  (2026-07-04T08:14:44Z)
• Provably Safe Motion Planning Under Unknown Disturbances [14.551794453957404]
  We present a sampling-based motion planning algorithm for robotic systems affected by random disturbances of unknown distribution.<n>Safety requirements are formulated as chance-constraints.<n>Case studies show our algorithm finds valid plans in cluttered environments under strict safety thresholds, outperforming state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-05-26T07:02:27Z)
• CorrectionPlanner: Self-Correction Planner with Reinforcement Learning in Autonomous Driving [55.88697462014118]
  CorrectionPlanner is an autoregressive planner with self-correction.<n>It reduces collision rate by over 20% on Waymax and achieves state-of-the-art planning scores on nuPlan.
  arXiv  Detail & Related papers  (2026-03-16T18:03:21Z)
• 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)
• Diffusion Predictive Control with Constraints [51.91057765703533]
  Diffusion predictive control with constraints (DPCC) is an algorithm for diffusion-based control with explicit state and action constraints.<n>We show through simulations of a robot manipulator that DPCC outperforms existing methods in satisfying novel test-time constraints.
  arXiv  Detail & Related papers  (2024-12-12T15:10:22Z)
• Know Where You're Uncertain When Planning with Multimodal Foundation Models: A Formal Framework [54.40508478482667]
  We present a comprehensive framework to disentangle, quantify, and mitigate uncertainty in perception and plan generation.<n>We propose methods tailored to the unique properties of perception and decision-making.<n>We show that our uncertainty disentanglement framework reduces variability by up to 40% and enhances task success rates by 5% compared to baselines.
  arXiv  Detail & Related papers  (2024-11-03T17:32:00Z)
• LaPlaSS: Latent Space Planning for Stochastic Systems [8.529245639496274]
  We propose a "generate-and-test" approach to risk-bounded planning for autonomous mobile agents. We use a variational autoencoder to learn a latent linear dynamics model and encode the planning problem into the latent space to generate the candidate trajectory. We demonstrate that our algorithm, LaPlaSS, is able to generate trajectory plans with bounded risk for a real-world agent with learned dynamics.
  arXiv  Detail & Related papers  (2024-04-10T14:52:35Z)
• Planning as In-Painting: A Diffusion-Based Embodied Task Planning Framework for Environments under Uncertainty [56.30846158280031]
  Task planning for embodied AI has been one of the most challenging problems. We propose a task-agnostic method named 'planning as in-painting' The proposed framework achieves promising performances in various embodied AI tasks.
  arXiv  Detail & Related papers  (2023-12-02T10:07:17Z)
• Statistical Safety and Robustness Guarantees for Feedback Motion Planning of Unknown Underactuated Stochastic Systems [1.0323063834827415]
  We propose a sampling-based planner that uses the mean dynamics model and simultaneously bounds the closed-loop tracking error via a learned disturbance bound. We validate that our guarantees translate to empirical safety in simulation on a 10D quadrotor, and in the real world on a physical CrazyFlie quadrotor and Clearpath Jackal robot.
  arXiv  Detail & Related papers  (2022-12-13T19:38:39Z)
• Probabilistic robust linear quadratic regulators with Gaussian processes [73.0364959221845]
  Probabilistic models such as Gaussian processes (GPs) are powerful tools to learn unknown dynamical systems from data for subsequent use in control design. We present a novel controller synthesis for linearized GP dynamics that yields robust controllers with respect to a probabilistic stability margin.
  arXiv  Detail & Related papers  (2021-05-17T08:36:18Z)
• Planning with Learned Dynamics: Probabilistic Guarantees on Safety and Reachability via Lipschitz Constants [7.216586291939535]
  We present a method for feedback motion planning of systems with unknown dynamics. We provide guarantees on safety, reachability, and goal stability. We demonstrate our approach by planning using learned models of a 6D quadrotor and a 7DOF Kuka arm.
  arXiv  Detail & Related papers  (2020-10-18T14:17:53Z)

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.