A* search algorithm
0 sources
A* search algorithm
Summary
A* search algorithm is a pathfinding algorithm[1]. It has Wikipedia articles in 25 language editions, a strong signal of global cultural recognition.[2]
Key Facts
- A* search algorithm is credited with the discovery of Peter E. Hart[3].
- A* search algorithm is credited with the discovery of Nils John Nilsson[4].
- A* search algorithm is credited with the discovery of Bertram Raphael[5].
- A* search algorithm's instance of is recorded as pathfinding algorithm[6].
- A* search algorithm's instance of is recorded as graph algorithm[7].
- A* search algorithm's instance of is recorded as complete search algorithm[8].
- A* search algorithm's instance of is recorded as admissible search algorithm[9].
- A* search algorithm's based on is recorded as Dijkstra's algorithm[10].
- A* search algorithm is a type of best-first search[11].
- A search algorithm's Commons category is recorded as A search algorithm[12].
- A* search algorithm was released on 1968[13].
- A search algorithm's Commons gallery is recorded as A Algorithm[14].
- A* search algorithm's described by source is recorded as Artificial Intelligence: A Modern Approach[15].
- A* search algorithm's has characteristic is recorded as optimal[16].
- A* search algorithm's computes solution to is recorded as pathfinding[17].
- A* search algorithm's computes solution to is recorded as shortest path problem[18].
- A* search algorithm's uses is recorded as graph data structure[19].
- A* search algorithm's derivative work is recorded as jump point search[20].
Body
Designation and Status
Recorded instance of include pathfinding algorithm[6], graph algorithm[7], complete search algorithm[8], and admissible search algorithm[9].
Cultural Significance
Things named for A search algorithm include Memory-Bounded A[21], an informed search algorithm[22]; Simplified Memory-Bounded A[23], an informed search algorithm[24]; and iterative deepening A[25], a pathfinding algorithm[26].
Why It Matters
A* search algorithm has Wikipedia articles in 25 language editions, a strong signal of global cultural recognition.[2] It is known by 58 alternative names across languages and contexts.[27]
Entities named for it include Memory-Bounded A[21], an informed search algorithm[22]; Simplified Memory-Bounded A[23], an informed search algorithm[24]; and iterative deepening A*[25], a pathfinding algorithm[26].