Risk-Predictive Planning for Off-Road Autonomy

被引:0
作者
Beyer, Lukas Lao [1 ]
Ryou, Gilhyun [1 ]
Spieler, Patrick [2 ]
Karaman, Sertac [1 ]
机构
[1] MIT, Lab Informat & Decis Syst, 77 Massachusetts Ave, Cambridge, MA 02139 USA
[2] CALTECH, Jet Prop Lab, NASA, Pasadena, CA 91125 USA
来源
2024 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA 2024) | 2024年
基金
美国国家航空航天局;
关键词
D O I
10.1109/ICRA57147.2024.10611509
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Efficiently navigating off-road environments presents a number of challenges arising from their unstructured nature. In the absence of high-fidelity maps, occlusions from obstacles and terrain lead to limited information available to inform planning decisions. Furthermore, resolution and latency limitations of real-world perception systems lead to potentially of degraded perception performance when traversing such environments at high speeds. We address these problems by proposing an algorithm which plans trajectories while anticipating future observations. In particular, we introduce a model which learns to predict the evolution of future riskmaps conditioned on the future path and speed profile of the vehicle. The model is trained in a self-supervised fashion using recordings of vehicle trajectories. We then present an algorithm which leverages a way to efficiently query the model along candidate paths and speed profiles to produce time-optimal trajectories while maintaining a bound on the future expected risk. We assess the predictive performance of our risk model through a comparison with real vehicle driving logs. Furthermore, our closed-loop simulations of several benchmark scenarios demonstrate how the behavior of our planner leads to qualitatively distinct trajectories, leading to improvements in both success rate and speed by up to 60%.
引用
收藏
页码:16452 / 16458
页数:7
相关论文
共 22 条
[1]  
Freeman CD, 2019, ADV NEUR IN, V32
[2]  
Gardner JR, 2018, ADV NEUR IN, V31
[3]  
Ha D, 2018, ADV NEUR IN, V31
[4]  
Hafner D., 2020, INT CONFER ENCE LE
[5]   A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS [J].
HART, PE ;
NILSSON, NJ ;
RAPHAEL, B .
IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02) :100-+
[6]  
Hensman J, 2013, P 20 9 C UNC ART INT, P282
[7]  
Hensman J, 2015, JMLR WORKSH CONF PRO, V38, P351
[8]  
Jankowiak M., 2020, PMLR, P4702
[9]  
Janson L, 2018, ROBOTICS: SCIENCE AND SYSTEMS XIV
[10]  
Kingma D., 2014, INT C LEARNING REP, V12