Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)

Parallel solution of maze optimal path based on ant colony algorithm

Authors
Yu Liu, Yi Xiao
Corresponding Author
Yu Liu
Available Online March 2013.
DOI
10.2991/iccsee.2013.458How to use a DOI?
Keywords
ant colony algorithm, Maze problem, optimal path, parallel process,
Abstract

In order to solve efficiency of maze optimal path problem based on ant colony algorithm, we proposed a CUDA platform parallel programming model, executing the algorithm with GPU that significantly improve the calculation efficiency. A parallel matrix design method was introduced and the ant colony searching process was changed into parallel matrix operations. To reduce the access overhead and increase algorithm running speed, data were rationally organized and stored. Experiments of different scale maze matrix test show that speedup will be increased with the expansion of the matrix size. In our experiments, the maximum speedup is about 11.5.

Copyright
© 2013, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

Volume Title
Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
Series
Advances in Intelligent Systems Research
Publication Date
March 2013
ISBN
978-90-78677-61-1
ISSN
1951-6851
DOI
10.2991/iccsee.2013.458How to use a DOI?
Copyright
© 2013, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - CONF
AU  - Yu Liu
AU  - Yi Xiao
PY  - 2013/03
DA  - 2013/03
TI  - Parallel solution of maze optimal path based on ant colony algorithm
BT  - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
PB  - Atlantis Press
SP  - 1826
EP  - 1829
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccsee.2013.458
DO  - 10.2991/iccsee.2013.458
ID  - Liu2013/03
ER  -