Proceedings of the 2016 International Conference on Computer Engineering and Information Systems

Path Planning Algorithm with Thinning Preprocess

Authors
Wang Yang, He-Gen Xu
Corresponding Author
Wang Yang
Available Online November 2016.
DOI
https://doi.org/10.2991/ceis-16.2016.6How to use a DOI?
Keywords
path planning; A*; Zhang's fast parallel thinning algorithm
Abstract
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.

Download article (PDF)

Proceedings
2016 International Conference on Computer Engineering and Information Systems
Part of series
Advances in Computer Science Research
Publication Date
November 2016
ISBN
978-94-6252-283-1
DOI
https://doi.org/10.2991/ceis-16.2016.6How to use a DOI?
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
UR  - https://doi.org/10.2991/ceis-16.2016.6
DO  - https://doi.org/10.2991/ceis-16.2016.6
ID  - Yang2016/11
ER  -