Cooperative Path Planning Using Responsibility-Sensitive Safety (RSS)-based Potential Field with Sigmoid Curve

被引:1
|
作者
Lin, Pengfei [1 ]
Tsukada, Manabu [1 ]
机构
[1] Univ Tokyo, Grad Sch Informat Sci & Technol, Tokyo, Japan
关键词
cooperative driving; potential field; sigmoid curve; collision avoidance; model predictive control;
D O I
10.1109/VTC2022-Spring54318.2022.9860508
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Potential field (PF)-based path planning is reported to be highly efficient for autonomous vehicles because it performs risk-aware computation and has a simple structure. However, the inherent limitations of the PF make it vulnerable in some specific traffic scenarios, such as local minima and oscillations in close obstacles. Therefore, a hybrid path planning with the sigmoid curve has recently been presented to generate better trajectories than those generated by the PF for collision avoidance. However, it is time-consuming and less applicable in complex dynamic environments, especially in traffic emergencies. To address these limitations, we propose a cooperative hybrid path planning (CHPP) approach that involves collaboration with adjacent vehicles for emergency collision avoidance via V2V communication. Moreover, the responsibility-sensitive safety (RSS) model is introduced to enhance the PF and sigmoid curve for safe-critical and time-saving requirements. The effectiveness of the proposed CHPP method compared with the state-of-the-art methods is studied through simulation of both static and dynamic traffic emergency scenarios. The simulation results prove that the CHPP approach performs better in terms of computation time (0.02 s faster) and driving safety (avoiding collision) than other methods, which are more supportive for emergency cooperative driving.
引用
收藏
页数:7
相关论文
共 50 条
  • [41] Dynamic path planning for mobile robots using fractional potential field
    Poty, A
    Melchior, P
    Oustaloup, A
    ISCCSP : 2004 FIRST INTERNATIONAL SYMPOSIUM ON CONTROL, COMMUNICATIONS AND SIGNAL PROCESSING, 2004, : 557 - 561
  • [42] An Efficient Path Planning Algorithm Using a Potential Field for Ground Forces
    Sung, Nakyeong
    Kim, Suhwan
    Cho, Namsuk
    COMPUTATION, 2023, 11 (01)
  • [43] PATH PLANNING FOR TWO MOBILE ROBOTS BY USING ARTIFICIAL POTENTIAL FIELD
    Nooraliei, Amir
    Altun, Adem Alpaslan
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER THEORY AND ENGINEERING (ICACTE 2009), VOLS 1 AND 2, 2009, : 381 - 389
  • [44] Artificial Potential Field Based Receding Horizon Control for Path Planning
    Luo, Guan-chen
    Yu, Jian-qiao
    Zhang, Si-yu
    Zhang, Wei
    PROCEEDINGS OF THE 2012 24TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2012, : 3665 - 3669
  • [45] Local Path Planning of Mobile Robot Based on Artificial Potential Field
    Wang Di
    Li Caihong
    Guo Na
    Song Yong
    Gao Tengteng
    Liu Guoming
    PROCEEDINGS OF THE 39TH CHINESE CONTROL CONFERENCE, 2020, : 3677 - 3682
  • [46] Robot path planning based on artificial potential field with deterministic annealing
    Wu, Zhengtian
    Dai, Jinyu
    Jiang, Baoping
    Karimi, Hamid Reza
    ISA TRANSACTIONS, 2023, 138 : 74 - 87
  • [47] A Path Planning Algorithm of Raster Maps Based on Artificial Potential Field
    Wang, Xitong
    Jin, Yilun
    Ding, Zhaohong
    2015 CHINESE AUTOMATION CONGRESS (CAC), 2015, : 627 - 632
  • [48] Path planning of PRM based on artificial potential field in radiation environments
    Zheng, Xiaochang
    Cao, Jinjia
    Zhang, Biao
    Zhang, Yulong
    Chen, Wei
    Dai, Yongzhi
    Zhao, Jiawei
    ANNALS OF NUCLEAR ENERGY, 2024, 208
  • [49] Path Planning for Robot based on Chaotic Artificial Potential Field Method
    Zhang, Cheng
    4TH INTERNATIONAL CONFERENCE ON ADVANCED ENGINEERING AND TECHNOLOGY (4TH ICAET), 2018, 317
  • [50] Improved potential field method path planning based on genetic algorithm
    Liu, Feng
    He, Hualing
    Li, Zhihua
    Guan, Zhi-Hong
    Wang, Hua O.
    PROCEEDINGS OF THE 39TH CHINESE CONTROL CONFERENCE, 2020, : 3725 - 3729