Moment State Dynamical Systems for Nonlinear Chance-Constrained Motion Planning
Reviewed by Pithpith:SREI647Uopen to challenge →
read the original abstract
Chance-constrained motion planning requires uncertainty in dynamics to be propagated into uncertainty in state. When nonlinear models are used, Gaussian assumptions on the state distribution do not necessarily apply since almost all random variables propagated through nonlinear dynamics results in non-Gaussian state distributions. To address this, recent works have developed moment-based approaches for enforcing chance-constraints on non-Gaussian state distributions. However, there still lacks fast and accurate moment propagation methods to determine the necessary statistical moments of these state distributions. To address this gap, we present a framework that, given a stochastic dynamical system, can algorithmically search for a new dynamical system in terms of moment state that can be used to propagate moments of disturbance random variables into moments of the state distribution. The key algorithm, TreeRing, can be applied to a large class of nonlinear systems which we refer to as trigonometric polynomial systems. As an example application, we present a distributionally robust RRT (DR-RRT) algorithm that propagates uncertainty through the nonlinear Dubin's car model without linearization.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Embedding Hybrid Systems into Continuous Latent Vector Fields
An n-dimensional hybrid system embeds into a continuous vector field in m > 2n dimensions, enabling latent Neural ODEs with consistency losses to recover hybrid flows from time series.
-
LieIPM: Lie Group Interior Point Method for Direct Trajectory Optimization of Rigid Bodies
LieIPM applies a structure-preserving interior point optimizer to rigid-body trajectory planning on Lie groups using variational integrators and closed-form intrinsic derivatives.
-
CC-VPSTO: Chance-Constrained Via-Point-Based Stochastic Trajectory Optimisation for Online Robot Motion Planning under Uncertainty
CC-VPSTO formulates stochastic trajectory optimization as a chance-constrained problem, approximates it with Monte Carlo sampling and padding, and integrates it into MPC for online robot motion planning under uncertainty.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.