Risk-Aware Motion Planning and Control Using CVaR-Constrained Optimization

被引:71
作者
Hakobyan, Astghik [1 ]
Kim, Gyeong Chan [1 ]
Yang, Insoon [1 ]
机构
[1] Seoul Natl Univ, Automat & Syst Res Inst, Dept Elect & Comp Engn, Seoul 08826, South Korea
基金
新加坡国家研究基金会;
关键词
Optimization and optimal control; probability and statistical methods; robot safety; collision avoidance; motion and path planning; VALUE-AT-RISK; APPROXIMATION; FRAMEWORK; ALGORITHMS;
D O I
10.1109/LRA.2019.2929980
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
We propose a risk-aware motion planning and decision-making method that systematically adjusts the safety and conservativeness in an environment with randomly moving obstacles. The key component of this method is the conditional value-at-risk (CVaR) used to measure the safety risk that a robot faces. Unlike chance constraints, CVaR constraints are coherent, convex, and distinguish between tail events. We propose a two-stage method for safe motion planning and control: A reference trajectory is generated by using RRT* in the first stage, and then a receding horizon controller is employed to limit the safety risk by using CVaR constraints in the second stage. However, the second stage problem is nontrivial to solve, as it is a triple-level stochastic program. We develop a computationally tractable approach through 1) a reformulation of the CVaR constraints; 2) a sample average approximation; and 3) a linearly constrained mixed integer convex program formulation. The performance and utility of this risk-aware method are demonstrated via simulation using a 12-dimensional model of quadrotors.
引用
收藏
页码:3924 / 3931
页数:8
相关论文
共 38 条
[1]   SCIP: solving constraint integer programs [J].
Achterberg, Tobias .
MATHEMATICAL PROGRAMMING COMPUTATION, 2009, 1 (01) :1-41
[2]  
[Anonymous], 1998, 9811 IOW STAT U DEP
[3]   Coherent measures of risk [J].
Artzner, P ;
Delbaen, F ;
Eber, JM ;
Heath, D .
MATHEMATICAL FINANCE, 1999, 9 (03) :203-228
[4]   Robust sample average approximation [J].
Bertsimas, Dimitris ;
Gupta, Vishal ;
Kallus, Nathan .
MATHEMATICAL PROGRAMMING, 2018, 171 (1-2) :217-282
[5]  
Blackmore L., 2006, P AIAA GUID NAV CONT
[6]   Chance-Constrained Optimal Path Planning With Obstacles [J].
Blackmore, Lars ;
Ono, Masahiro ;
Williams, Brian C. .
IEEE TRANSACTIONS ON ROBOTICS, 2011, 27 (06) :1080-1094
[7]   A Probabilistic Particle-Control Approximation of Chance-Constrained Stochastic Predictive Control [J].
Blackmore, Lars ;
Ono, Masahiro ;
Bektassov, Askar ;
Williams, Brian C. .
IEEE TRANSACTIONS ON ROBOTICS, 2010, 26 (03) :502-517
[8]  
Bonami P., 2013, J EXP ALGORITHMICS, V18, P2
[9]   An algorithmic framework for convex mixed integer nonlinear programs [J].
Bonami, Pierre ;
Biegler, Lorenz T. ;
Conna, Andrew R. ;
Cornuejols, Gerard ;
Grossmann, Ignacio E. ;
Laird, Carl D. ;
Lee, Jon ;
Lodi, Andrea ;
Margot, Francois ;
Sawaya, Nicolas ;
Wachter, Andreas .
DISCRETE OPTIMIZATION, 2008, 5 (02) :186-204
[10]  
Bry Adam, 2011, IEEE International Conference on Robotics and Automation, P723