Risk-Averse Trajectory Optimization via Sample Average Approximation

Author name not available (Why is that?)

Publication date: 6 July 2023

Abstract: Trajectory optimization under uncertainty underpins a wide range of applications in robotics. However, existing methods are limited in terms of reasoning about sources of epistemic and aleatoric uncertainty, space and time correlations, nonlinear dynamics, and non-convex constraints. In this work, we first introduce a continuous-time planning formulation with an average-value-at-risk constraint over the entire planning horizon. Then, we propose a sample-based approximation that unlocks an efficient, general-purpose, and time-consistent algorithm for risk-averse trajectory optimization. We prove that the method is asymptotically optimal and derive finite-sample error bounds. Simulations demonstrate the high speed and reliability of the approach on problems with stochasticity in nonlinear dynamics, obstacle fields, interactions, and terrain parameters.

Has companion code repository: https://github.com/stanfordasl/riskaversetrajopt

This page was built for publication: Risk-Averse Trajectory Optimization via Sample Average Approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6442877)