21 July 2017 The comparison of A* algorithm and steepest descent method for path planning
Author Affiliations +
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.
© (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hao Zhang, Hao Zhang, Hu Wang, Hu Wang, Jian Yuan, Jian Yuan, Y. Meng Hu, Y. Meng Hu, W. Long Ren, 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); doi: 10.1117/12.2281907; https://doi.org/10.1117/12.2281907
PROCEEDINGS
5 PAGES


SHARE
Back to Top