Heuristics: A*-algorithm 3
Aus Operations-Research-Wiki
Version vom 27. Juni 2013, 19:01 Uhr von Kolukisa (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „A*-Algorithm Algorithms search bidirectional and are used to search for a specific destination. One of these algorithms is the A*-Algorithm. The A*-Algorithm …“)
A*-Algorithm
Algorithms search bidirectional and are used to search for a specific destination. One of these algorithms is the A*-Algorithm. The A*-Algorithm is a heuristic search algorithm which was developed in the year 1968 by Peter Hart, Nils J. Nilsson and Bertram Raphael and is used to find the shortest path between two nodes in a complete graph. Today it represents an extension to the Dijkstra-Algorithm and is the most used heuristic algorithm.
