Skip to Main Content
There are a lot of studies about shortest path algorithms. They are usually applied to graphs. However, there is little study of maze images by image processing techniques. In this paper, the shortest path algorithms, Dijkstra's and A* search algorithms, have been examined in maze images in terms of a search time. Furthermore, we have proposed a method to apply a thinning technique to maze images in order to solve a maze more quickly.
SICE Annual Conference (SICE), 2011 Proceedings of
Date of Conference: 13-18 Sept. 2011