Statistical Contraction for Chance-Constrained Trajectory Optimization of Non-Gaussian Stochastic Systems
Rihan Aaron D'Silva, Hiroyasu Tsukamoto

TL;DR
This paper introduces a distribution-free, statistically guaranteed method for robust trajectory optimization of nonlinear, non-Gaussian stochastic systems using conformal inference, enabling safe motion planning without distributional assumptions.
Contribution
It develops a novel conformal inference-based framework for chance-constrained control that provides finite-sample guarantees and applies to learning-based motion planners.
Findings
Successfully applied to motion planning in simulations.
Validated approach with hardware experiments.
Achieved safe, dynamically feasible trajectories.
Abstract
This paper presents novel method for distribution-free robust trajectory optimization and control of discrete-time, nonlinear, and non-Gaussian stochastic systems, with closed-loop guarantees on chance constraint satisfaction. Our framework employs conformal inference to generate coverage-based confidence sets for the closed-loop dynamics around arbitrary reference trajectories, by constructing a joint nonconformity score to quantify both the validity of contraction (i.e., incremental stability) conditions and the impact of external stochastic disturbance on the closed-loop dynamics, without any distributional assumptions. Via appropriate constraint tightening, chance constraints can be reformulated into tractable, statistically valid deterministic constraints on the reference trajectories. This enables a formal pathway to leverage and validate learning-based motion planners and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks · Reinforcement Learning in Robotics · Adversarial Robustness in Machine Learning
