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

Abstract

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 image size is large. 