Receding Horizon Planning with Rule Hierarchies for Autonomous Vehicles

被引:5
作者
Veer, Sushant [1 ]
Leung, Karen [1 ,2 ]
Cosner, Ryan K. [1 ,3 ]
Chen, Yuxiao [1 ]
Karkus, Peter [1 ]
Pavone, Marco [1 ,4 ]
机构
[1] NVIDIA Res, Santa Clara, CA 95050 USA
[2] Univ Washington, Seattle, WA USA
[3] CALTECH, Pasadena, CA 91125 USA
[4] Stanford Univ, Stanford, CA 94305 USA
来源
2023 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, ICRA | 2023年
关键词
D O I
10.1109/ICRA48891.2023.10160622
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Autonomous vehicles must often contend with conflicting planning requirements, e.g., safety and comfort could be at odds with each other if avoiding a collision calls for slamming the brakes. To resolve such conflicts, assigning importance ranking to rules (i.e., imposing a rule hierarchy) has been proposed, which, in turn, induces rankings on trajectories based on the importance of the rules they satisfy. On one hand, imposing rule hierarchies can enhance interpretability, but introduce combinatorial complexity to planning; while on the other hand, differentiable reward structures can be leveraged by modern gradient-based optimization tools, but are less interpretable and unintuitive to tune. In this paper, we present an approach to equivalently express rule hierarchies as differentiable reward structures amenable to modern gradient-based optimizers, thereby, achieving the best of both worlds. We achieve this by formulating rank-preserving reward functions that are monotonic in the rank of the trajectories induced by the rule hierarchy; i.e., higher ranked trajectories receive higher reward. Equipped with a rule hierarchy and its corresponding rank-preserving reward function, we develop a two-stage planner that can efficiently resolve conflicting planning requirements. We demonstrate that our approach can generate motion plans in similar to 7-10 Hz for various challenging road navigation and intersection negotiation scenarios.
引用
收藏
页码:1507 / 1513
页数:7
相关论文
共 36 条
[1]  
Barrett C., 2018, Handbook of model checking, P305, DOI DOI 10.1007/978-3-319-10575-8_11
[2]  
Cao Z., 2020, ARXIV200700178
[3]  
Censi A, 2019, IEEE INT CONF ROBOT, P8536, DOI [10.1109/icra.2019.8794364, 10.1109/ICRA.2019.8794364]
[4]  
Collin A, 2020, IEEE INT VEH SYM, P136, DOI 10.1109/IV47402.2020.9304588
[5]   Maximum Realizability for Linear Temporal Logic Specifications [J].
Dimitrova, Rayna ;
Ghasemi, Mahsa ;
Topcu, Ufuk .
AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS (ATVA 2018), 2018, 11138 :458-475
[6]   The Reasonable Crowd: Towards evidence-based and interpretable models of driving behavior [J].
Helou, Bassam ;
Dusi, Aditya ;
Collin, Anne ;
Mehdipour, Noushin ;
Chen, Zhiliang ;
Lizarazo, Cristhian ;
Belta, Calin ;
Wongpiromsarn, Tichakorn ;
Tebbens, Radboud Duintjer ;
Beijbom, Oscar .
2021 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2021, :6708-6715
[7]   PredictionNet: Real-Time Joint Probabilistic Traffic Prediction for Planning, Control, and Simulation [J].
Kamenev, Alexey ;
Wang, Lirui ;
Bohan, Ollin Boer ;
Kulkarni, Ishwar ;
Kartal, Bilal ;
Molchanov, Artem ;
Birchfield, Stan ;
Nister, David ;
Smolyanskiy, Nikolai .
2022 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, ICRA 2022, 2022, :8936-8942
[8]  
Katz S. M., 2021, ARXIV210302727
[9]  
King DB, 2015, ACS SYM SER, V1214, P1, DOI 10.1021/bk-2015-1214.ch001
[10]  
Kong J, 2015, IEEE INT VEH SYM, P1094, DOI 10.1109/IVS.2015.7225830