Implementing A* path finding algorithm in Unity3D
Designing and implementation of:
- A-star path finding algorithm in Unity3D
A-star
- Github repo A* (pronounced as “A star”) is a computer algorithm that is widely used in pathfinding and graph traversal. The algorithm efficiently plots a walkable path between multiple nodes, or points, on the graph. Pathfinding from points AA to BB on a map with many obstacles can be difficult. A robot, for instance, without getting in much other direction, will continue until it encounters an obstacle, as in the pathfinding example to the left below. However, the A* algorithm introduces a heuristic into a regular graph-searching algorithm, essentially planning ahead at each step, making a more optimal decision. A* is an extension of Dijkstra’s algorithm with some characteristics of breadth-first search (BFS). [1]