Reactive Navigation Under Non-Parametric Uncertainty Through Hilbert Space Embedding of Probabilistic Velocity Obstacles

被引:22
作者
Poonganam, SriSai Naga Jyotish [1 ]
Gopalakrishnan, Bharath [1 ]
Avula, Venkata Seetharama Sai Bhargav Kumar [1 ]
Singh, Arun Kumar [2 ]
Krishna, K. Madhava [1 ]
Manocha, Dinesh [3 ]
机构
[1] IIIT Hyderabad, Robot Res Ctr, Hyderabad 500032, India
[2] Univ Tartu, EE-50090 Tartu, Estonia
[3] Univ Maryland, Comp Sci & Elect & Comp Engn, College Pk, MD 20742 USA
来源
IEEE ROBOTICS AND AUTOMATION LETTERS | 2020年 / 5卷 / 02期
关键词
Collision avoidance; motion and path planning;
D O I
10.1109/LRA.2020.2972840
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
The probabilistic velocity obstacle (PVO) extends the concept of velocity obstacle (VO) to work in uncertain dynamic environments. In this paper, we show how a robust model predictive control (MPC) with PVO constraints under non-parametric uncertainty can be made computationally tractable. At the core of our formulation is a novel yet simple interpretation of our robust MPC as a problem of matching the distribution of PVO with a certain desired distribution. To this end, we propose two methods. Our first baseline method is based on approximating the distribution of PVO with a Gaussian Mixture Model (GMM) and subsequently performing distribution matching using Kullback Leibler (KL) divergence metric. Our second formulation is based on the possibility of representing arbitrary distributions as functions in Reproducing Kernel Hilbert Space (RKHS). We use this foundation to interpret our robust MPC as a problem of minimizing the distance between the desired distribution and the distribution of the PVO in the RKHS. Both the RKHS and GMM based formulation can work with any uncertainty distribution and thus allowing us to relax the prevalent Gaussian assumption in the existing works. We validate our formulation by taking an example of 2D navigation of quadrotors with a realistic noise model for perception and ego-motion uncertainty. In particular, we present a systematic comparison between the GMM and the RKHS approach and show that while both approaches can produce safe trajectories, the former is highly conservative and leads to poor tracking and control costs. Furthermore, RKHS based approach gives better computational times that are up to one order of magnitude lesser than the computation time of the GMM based approach.
引用
收藏
页码:2690 / 2697
页数:8
相关论文
共 19 条
[1]  
[Anonymous], 2008, LECT NOTES
[2]  
[Anonymous], ARXIV200109007
[3]  
Dhawale A, 2018, IEEE INT C INT ROBOT, P3545, DOI 10.1109/IROS.2018.8593723
[4]   Motion planning in dynamic environments using velocity obstacles [J].
Fiorini, P ;
Shiller, Z .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1998, 17 (07) :760-772
[5]  
Gopalakrishnan B, 2017, IEEE INT C INT ROBOT, P1089, DOI 10.1109/IROS.2017.8202279
[6]   Tight Bounds for Learning a Mixture of Two Gaussians [J].
Hardt, Moritz ;
Price, Eric .
STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, :753-760
[7]  
Hennes D., 2012, AAMAS, P147, DOI 10.5555/2343576.2343597
[8]  
Kluge B., 2007, Autonomous Naviga-tion in Dynamic Environments, P121
[9]   A Probabilistically Robust Path Planning Algorithm for UAVs Using Rapidly-Exploring Random Trees [J].
Kothari, Mangal ;
Postlethwaite, Ian .
JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 2013, 71 (02) :231-253
[10]  
Lenz D, 2015, IEEE INT VEH SYM, P292, DOI 10.1109/IVS.2015.7225701