The comparison of A* algorithm and steepest descent method for path planning

Hao Zhang; Hu Wang; Jian Yuan; Y. Meng Hu; W. Long Ren

doi:10.1117/12.2281907

21 July 2017 The comparison of A* algorithm and steepest descent method for path planning

Hao Zhang, Hu Wang, Jian Yuan, Y. Meng Hu, W. Long Ren

Proceedings Volume 10420, Ninth International Conference on Digital Image Processing (ICDIP 2017); 104204Q (2017) https://doi.org/10.1117/12.2281907
Event: Ninth International Conference on Digital Image Processing (ICDIP 2017), 2017, Hong Kong, China

Abstract

This study mainly introduces the advanced A* algorithm and steepest descent method for path planning based on grid form. A* algorithm is a node-searching strategy, namely uses the heuristic function to estimate the cost of the path from the start to the goal in the grid maps. The branching factor of A* algorithm describes the moving directions, which will be selected according to the path length in different grid maps. The steepest descent method adopts a heuristic-based gradient method with grid maps to search the shortest path. In this paper the appropriate path planning method will be selected by comparing the run time and the creation of complex maps of the two methods.

Citation Download Citation

Hao Zhang, Hu Wang, Jian Yuan, Y. Meng Hu, and W. Long Ren "The comparison of A* algorithm and steepest descent method for path planning", Proc. SPIE 10420, Ninth International Conference on Digital Image Processing (ICDIP 2017), 104204Q (21 July 2017); https://doi.org/10.1117/12.2281907

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available