A* Search Algorithm

A* Search Algorithm

In computer science, A* (pronounced "A star") is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable path between points, called nodes. Noted for its performance and accuracy, it enjoys widespread use.

Peter Hart, Nils Nilsson and Bertram Raphael of Stanford Research Institute (now SRI International) first described the algorithm in 1968. It is an extension of Edsger Dijkstra's 1959 algorithm. A* achieves better performance (with respect to time) by using heuristics.

Read more about A* Search Algorithm:  Description, History, Process, Pseudocode, Properties, Admissibility and Optimality, Complexity, Variants of A*

Other articles related to " search algorithm":

A* Search Algorithm - Variants of A*
... D* Field D* IDA* Fringe Fringe Saving A* (FSA*) Generalized Adaptive A* (GAA*) Lifelong Planning A* (LPA*) Simplified Memory bounded A* (SMA*) Theta* A* can be adapted to a bidirectional search algorithm ... Special care needs to be taken for the stopping criterion ...

Famous quotes containing the word search:

    Let the maiden, with erect soul, walk serenely on her way, accept the hint of each new experience, search in turn all the objects that solicit her eye, that she may learn the power and charm of her new-born being, which is the kindling of a new dawn in the recesses of space.
    Ralph Waldo Emerson (1803–1882)