A* search algorithm
Facts
12 propertiesIdentity
- Instance of
- pathfinding algorithm, graph algorithm, complete search algorithm, admissible search algorithm[5][6][7]
More facts +11
- Publication date
- 1968[10]
- Based on
- Dijkstra's algorithm[8]
- Subclass of
- best-first search[9]
- Computes solution to
- pathfinding, shortest path problem[13][14]
- Derivative work
- jump point search[16]
- Described by source
- Artificial Intelligence: A Modern Approach[11]
- Discoverer or inventor
- Peter E. Hart, Nils John Nilsson, Bertram Raphael[2][3][4]
- Has characteristic
- optimal[12]
- Worst-case space complexity
- \mathcal{O}(|S|) = \mathcal{O}(b^d)
- Worst-case time complexity
- \mathcal{O}(|A|log(|S|)) = \mathcal{O}(b^d), \mathcal{O}(2^{|S|})
- OpenAlex ID
- C103578098
- Image (Wikimedia Commons)
- Pathfinding A Star.svg ↗
- Brilliant Wiki ID
- a-star-search
- Encyclopaedia Beliana ID
- algoritmus-1
- FOLDOC ID
- A*+search
- Freebase ID
- /m/0plrp
- Microsoft Academic ID (discontinued)
- 103578098
- Quora topic ID
- A*-Algorithm, A*-Search-Algorithm
- Rosetta Code page ID
- A*_search_algorithm
Subtypes 4
Discoverer or inventor 3
Named after 3
← Based on 3
Computes solution to 2
Based on 1
Derivative work 1
Described by source 1
Instance of 1
Subclass of 1
Uses 1
← Derivative work 1
0 sources
Summary
A* search algorithm is a pathfinding algorithm[1].
Body
Cultural Significance
Things named for A search algorithm include iterative deepening A[17], a pathfinding algorithm[18]; Simplified Memory-Bounded A[19], an informed search algorithm[20]; and Memory-Bounded A[21], an informed search algorithm[22].
Why It Matters
Entities named for it include iterative deepening A[17], a pathfinding algorithm[18]; Simplified Memory-Bounded A[19], an informed search algorithm[20]; and Memory-Bounded A*[21], an informed search algorithm[22].