Hierarchical framework integrating rapidly-exploring random tree with deep reinforcement learning for autonomous vehicle

被引:0
|
作者
Jiaxing Yu
Aliasghar Arab
Jingang Yi
Xiaofei Pei
Xuexun Guo
机构
[1] Wuhan University of Technology,The Hubei Key Laboratory of Advanced Technology of Automotive Components
[2] Rutgers University,The Department of Mechanical and Aerospace Engineering
来源
Applied Intelligence | 2023年 / 53卷
关键词
Autonomous vehicle; Reinforcement learning; Rapidly-exploring random tree (RRT); Machine learning;
D O I
暂无
中图分类号
学科分类号
摘要
This paper proposes a systematic driving framework where the decision making module of reinforcement learning (RL) is integrated with rapidly-exploring random tree (RRT) as motion planning. RL is used to generate local goals and semantic speed commands to control the longitudinal speed of a vehicle while rewards are designed for the driving safety and the traffic efficiency. Guaranteeing the driving comfort, RRT returns a feasible path to be followed by the vehicle with the speed commands. The scene decomposition approach is implemented to scale the deep neural network (DNN) to environments with multiple traffic participants and double deep Q-networks (DDQN) with prioritized experience replay (PER) is utilized to accelerate the training process. To handle the disturbance of the perception of the agent, we use an ensemble of neural networks to evaluate the uncertainty of decisions. It has shown that the proposed framework can tackle unexpected actions of traffic participants at an intersection yielding safe, comfort and efficient driving behaviors. Also, the ensemble of DDQN with PER is proved to be superior over standard DDQN in terms of learning efficiency and disturbance vulnerability.
引用
收藏
页码:16473 / 16486
页数:13
相关论文
共 50 条
  • [21] Rapidly-Exploring Random Tree Based Memory Efficient Motion Planning
    Adiyatov, Olzhas
    Varol, Huseyin Atakan
    2013 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION (ICMA), 2013, : 354 - 359
  • [22] Multi-agent Rapidly-exploring Pseudo-random Tree
    Armando Alves Neto
    Douglas G. Macharet
    Mario F. M. Campos
    Journal of Intelligent & Robotic Systems, 2018, 89 : 69 - 85
  • [23] Multi-agent Rapidly-exploring Pseudo-random Tree
    Alves Neto, Armando
    Macharet, Douglas G.
    Campos, Mario F. M.
    JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 2018, 89 (1-2) : 69 - 85
  • [24] An Automated Statistical Evaluation Framework of Rapidly-Exploring Random Tree Frontier Detector for Indoor Space Exploration
    Cheng, Wen-Chung
    Cheng, Wen-Yu
    Ni, Zhen
    Zhong, Xiangnan
    2022 4TH INTERNATIONAL CONFERENCE ON CONTROL AND ROBOTICS, ICCR, 2022, : 65 - 71
  • [25] Information-Driven Rapidly-Exploring Random Tree for Efficient Environment Exploration
    Jhielson M. Pimentel
    Mário S. Alvim
    Mario F. M. Campos
    Douglas G. Macharet
    Journal of Intelligent & Robotic Systems, 2018, 91 : 313 - 331
  • [26] Global optimization of manipulator base placement by means of rapidly-exploring random tree
    赵京
    Hu Weijian
    Shang Hong
    Du Bin
    High Technology Letters, 2016, 22 (01) : 24 - 29
  • [27] Global optimization of manipulator base placement by means of rapidly-exploring random tree
    Zhao J.
    Hu W.
    Shang H.
    Du B.
    High Technology Letters, 2016, 22 (01) : 24 - 29
  • [28] Simplified and Smoothed Rapidly-Exploring Random Tree Algorithm for Robot Path Planning
    Gultekin, Ayhan
    Diri, Samet
    Becerikli, Yasar
    TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2023, 30 (03): : 891 - 898
  • [29] A membrane parallel rapidly-exploring random tree algorithm for robotic motion planning
    Perez-Hurtado, Ignacio
    Martinez-del-Amor, Miguel A.
    Zhang, Gexiang
    Neri, Ferrante
    Perez-Jimenez, Mario J.
    INTEGRATED COMPUTER-AIDED ENGINEERING, 2020, 27 (02) : 121 - 138
  • [30] Information-Driven Rapidly-Exploring Random Tree for Efficient Environment Exploration
    Pimentel, Jhielson M.
    Alvim, Mario S.
    Campos, Mario F. M.
    Macharet, Douglas G.
    JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 2018, 91 (02) : 313 - 331