A NOVEL PATH FINDING TECHNIQUE AI IN 3D

The paper proposes a path finding algorithm for steer behavior for game and simulation project. The proposed algorithm uses features of existing well-known path finding algorithms: Breath First Search (BFS) and Dijkstra. It is like other graph-searching algorithms in that it can potentially search a huge area of the map. It's like Dijkstra's algorithm in that it can be used to find a shortest path. It's like BFS in that it can use a heuristic to guide itself. So it combines the pieces of information that Dijkstra's algorithm uses (favoring vertices that are close to the starting point) and information that BFS uses (favoring vertices that are close to the goal).