Path Planning Algorithm with Thinning Preprocess
- Wang Yang, He-Gen Xu
- Corresponding Author
- Wang Yang
Available Online November 2016.
- https://doi.org/10.2991/ceis-16.2016.6How to use a DOI?
- path planning; A*; Zhang's fast parallel thinning algorithm
- This paper proposes path planning algorithm with thinning preprocess to increase the efficiency of path planning as well as reserving the key points (the start point and the target point). A modified Zhang's fast parallel thinning algorithm is proposed with the key points (start point, the target point) reserved, and the A* algorithm is taken as an example for path planning on the grid map. Simulation results show that the algorithm in this paper greatly decreases the search time of A* algorithm while ensuring a reasonable path for mobile robots.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Wang Yang AU - He-Gen Xu PY - 2016/11 DA - 2016/11 TI - Path Planning Algorithm with Thinning Preprocess BT - 2016 International Conference on Computer Engineering and Information Systems PB - Atlantis Press SN - 2352-538X UR - https://doi.org/10.2991/ceis-16.2016.6 DO - https://doi.org/10.2991/ceis-16.2016.6 ID - Yang2016/11 ER -