Gorilla.Utils.Pathfinding.AStar

Unit Gorilla.Utils.Pathfinding.AStar.pas

Classes

Records

TGorillaPathfindingAStar

Custom A* pathfing algorithm implementation. This component is not threadsafe because of direct Control3D usage. Do not attempt to compute paths asynchronously in a thread!

Remarks

In computer science, A* (pronounced as "A star") is a computer algorithm that is widely used in pathfinding and graph traversal, which is the process of finding a path between multiple points, called "nodes". It enjoys widespread use due to its performance and accuracy. However, in practical travel-routing systems, it is generally outperformed by algorithms which can pre-process the graph to attain better performance, [1] although other work has found A* to be superior to other approaches. [2] Peter Hart, Nils Nilsson and Bertram Raphael of Stanford Research Institute (now SRI International) first published the algorithm in 1968. [3] It can be seen an extension of Edsger Dijkstra's 1959 algorithm. A* achieves better performance by using heuristics to guide its search. https://en.wikipedia.org/wiki/A*_search_algorithm

Ancestors

Members

Fields

Methods

Properties