A minimum cost path search algorithm through tile obstacles
Zhaoyun Xing, Russell Kao · 2001
In this paper, based on tile connection graph, we propose an efficient minimum cost path search algorithm through tile obstacles. This search algorithm is faster than previous graph based algorithm and unlike previous tile based algorithms, this algorithm finds the minimum cost path.