Target Importance-Based Obstacle Avoidance Path Planning for Autonomous Driving

Conventional path planning methods primarily rely on the perceived location and speed of target obstacles, the importance of these obstacles is rarely considered, e.g., the importance of large truck and small one for path planning is obviously different. To solve this problem, an autonomous driving path planning method based on target importance is proposed. Different from the traditional path planning method, the reward function is modified to be an combination of the vehicle type and distance from obstacles, the background vehicles are divided into large vehicles and small ones, and different reward function weights are set, based on which sampling dynamic planning is performed for path planning. The proposed algorithm is tested on NGSIM and its performance is compared with conventional path planning methods. The cumulative reward obtained by the proposed method is significantly higher than that obtained by the conventional method, indicating that our method is more reliable for obstacle avoidance of large vehicles.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icus61736.2024.10840092
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Target Importance-Based Obstacle Avoidance Path Planning for Autonomous Driving

Ruidong Yan, Shuai Chen, Chao Liu
Robotic Path Planning Algorithms
article

Target Importance-Based Obstacle Avoidance Path Planning for Autonomous Driving

Ruidong Yan, Shuai Chen, Chao Liu
article en

Abstract

Conventional path planning methods primarily rely on the perceived location and speed of target obstacles, the importance of these obstacles is rarely considered, e.g., the importance of large truck and small one for path planning is obviously different. To solve this problem, an autonomous driving path planning method based on target importance is proposed. Different from the traditional path planning method, the reward function is modified to be an combination of the vehicle type and distance from obstacles, the background vehicles are divided into large vehicles and small ones, and different reward function weights are set, based on which sampling dynamic planning is performed for path planning. The proposed algorithm is tested on NGSIM and its performance is compared with conventional path planning methods. The cumulative reward obtained by the proposed method is significantly higher than that obtained by the conventional method, indicating that our method is more reliable for obstacle avoidance of large vehicles.

Beijing Jiaotong University (CN), China Institute of Atomic Energy (CN)
National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 74%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Target Importance-Based Obstacle Avoidance Path Planning for Autonomous Driving — Ruidong Yan, Shuai Chen, et al. · (2024) | TGRS Research Map | TGRS