A* search algorithm
algorithm used for pathfinding and graph traversal
enghraifft o'r canlynol
search algorithm
pathfinding algorithm
graph algorithm
isddosbarth o'r canlynol
best-first search
fideo
testun y ddelwedd: Illustration d'une recherche A* pour trouver le chemin le plus court entre 2 nœuds, Illustration of an A* search to find the shortest path between 2 nodes
yn seiliedig ar
gwaith deilliadol
jump point search[3]
dyddiad cyhoeddi
1968
darganfyddwr neu ddyfeisiwr
Peter E. Hart
Nils John Nilsson
Bertram Raphael
computes solution to
pathfinding
shortest path problem
worst-case time complexity
worst-case space complexity
disgrifiwyd gan y ffynhonnell
Artificial Intelligence: A Modern Approach
tudalen: 93
mae'n defnyddio
graph data structure
oriel Comin
A* Algorithm
categori Comin
A* search algorithm
Cyfeiriadau
- ↑ OpenAlex, 26 Ionawr 2022, https://docs.openalex.org/download-snapshot/snapshot-data-format
- ↑ Freebase Data Dumps, 28 Hydref 2013
- ↑ jump point search
- ↑ Wicipedia Saesneg