We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/An improved A-Star based path planning algorithm for autonomous land vehicles
PeriodicalsMathematics

An improved A-Star based path planning algorithm for autonomous land vehicles

Checking your access to this record.

Abstract & Overview

This article presents a novel path planning algorithm for autonomous land vehicles. There are four main contributions: Firstly, an evaluation standard is introduced to measure the performance of different algorithms and to select appropriate parameters for the proposed algorithm. Secondly, a guideline generated by human or global planning is employed to develop the heuristic function to overcome the shortcoming of traditional A-Star algorithms. Thirdly, for improving the obstacle avoidance performance, key points around the obstacle are employed, which would guide the planning path to avoid the obstacle much earlier than the traditional one. Fourth, a novel variable-step based A-Star algorithm is also introduced to reduce the computing time of the proposed algorithm. Compared with the state-of-the-art techniques, experimental results show that the performance of the proposed algorithm is robust and stable.

Cite this record

Erke Shang, Dai Bin, Yiming Nie, Zhu Qi, Xiao LIANG, Zhao Dawei (2020). An improved A-Star based path planning algorithm for autonomous land vehicles. International Journal of Advanced Robotic Systems, 17(5). https://doi.org/10.1177/1729881420962263

Copy in another style

Shang, E., Bin, D., Nie, Y., Qi, Z., LIANG, X., & Dawei, Z. (2020). An improved A-Star based path planning algorithm for autonomous land vehicles. International Journal of Advanced Robotic Systems, 17(5). https://doi.org/10.1177/1729881420962263
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.