Share Email Print
cover

Proceedings Paper

The comparison of A* algorithm and steepest descent method for path planning
Author(s): Hao Zhang; Hu Wang; Jian Yuan; Y. Meng Hu; W. Long Ren
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 21 July 2017
PDF: 5 pages
Proc. SPIE 10420, Ninth International Conference on Digital Image Processing (ICDIP 2017), 104204Q (21 July 2017); doi: 10.1117/12.2281907
Show Author Affiliations
Hao Zhang, Shandong Academy of Sciences (China)
Shandong Scientific and Technological Ctr. of Oceanographic Instrumentation (China)
Hu Wang, Shandong Academy of Sciences (China)
Jian Yuan, Shandong Academy of Sciences (China)
Y. Meng Hu, Shandong Academy of Sciences (China)
Shandong Scientific and Technological Ctr. of Oceanographic Instrumentation (China)
W. Long Ren, Shandong Academy of Sciences (China)
Shandong Scientific and Technological Ctr. of Oceanographic Instrumentation (China)


Published in SPIE Proceedings Vol. 10420:
Ninth International Conference on Digital Image Processing (ICDIP 2017)
Charles M. Falco; Xudong Jiang, Editor(s)

© SPIE. Terms of Use
Back to Top