A Fast and Shorter Path Finding Method for Maze Images by Image Processing Techniques and Graph Theory

Yoshitaka Murata, Yoshihiro Mitani
2014 Journal of Image and Graphics  
There are a lot of studies about shortest path algorithms. In the previous study, we showed that an A* search algorithm outperformed Dijkstra's to solve maze in terms of a search time. In this paper, to solve maze more quickly, we propose a fast and shorter path finding method based on the image processing techniques and graph theory. The experimental results show that the proposed method is superior to an A* search algorithm. In particular, the proposed method is more effective when the maze
more » ... age size is large.  Index Terms-image processing techniques, maze images, shortest path algorithms, A* search algorithm, graph theory, maze image size of Technology, Japan, in 2013. He is currently a graduate student at Kyushu Institute of Technology. His research interests include image processing techniques.
doi:10.12720/joig.2.1.89-93 fatcat:bsd4rsvwxzairmoqnvybrwmg7m