Abstract

Optimal path finding algorithm is a very important research direction in computer science. It is a node search method based on graph theory. This paper focus on the fundamental researches of the optimal path finding algorithm. By comparing various path finding algorithms, this paper implement the A* algorithm and present a variant strategy of A* which is named Turning Point A*(TPA*). The experiment shows that searching with TPA* can speed up A* by an order of magnitude and more and report significant improvement.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call