|
gptkbp:instanceOf
|
gptkb:search_engine
graph traversal algorithm
pathfinding algorithm
|
|
gptkbp:advantage
|
finds optimal path
flexible with heuristics
widely applicable
|
|
gptkbp:category
|
gptkb:artificial_intelligence
computer science
operations research
|
|
gptkbp:complexity
|
O(V)
O(E)
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
A* search algorithm
|
|
gptkbp:influenced
|
gptkb:A*_Lite
gptkb:Anytime_Repairing_A*
gptkb:D*_Lite
gptkb:IDA*
gptkb:Jump_Point_Search
gptkb:Real-Time_A*
gptkb:Theta*
gptkb:Weighted_A*
|
|
gptkbp:introduced
|
gptkb:Bertram_Raphael
gptkb:Nils_Nilsson
gptkb:Peter_Hart
|
|
gptkbp:introducedIn
|
1968
|
|
gptkbp:limitation
|
memory usage
may be slow for large graphs
performance depends on heuristic
|
|
gptkbp:notation
|
f(n)
g(n)
h(n)
|
|
gptkbp:numberOfIssues
|
true
|
|
gptkbp:optimizedFor
|
true
|
|
gptkbp:property
|
guarantees optimality with admissible heuristic
uses f(n) = g(n) + h(n)
guarantees completeness with finite branching factor
|
|
gptkbp:publishedIn
|
gptkb:IEEE_Transactions_on_Systems_Science_and_Cybernetics
|
|
gptkbp:relatedTo
|
gptkb:Dijkstra's_algorithm
gptkb:Greedy_Best-First_Search
|
|
gptkbp:requires
|
admissible heuristic
graph or grid
|
|
gptkbp:step
|
closed set
open set
path reconstruction
node expansion
|
|
gptkbp:usedFor
|
gptkb:artificial_intelligence
robotics
game development
finding shortest path
|
|
gptkbp:uses
|
cost function
heuristic function
|
|
gptkbp:bfsParent
|
gptkb:Bertram_Raphael
gptkb:Dijkstra's_algorithm
|
|
gptkbp:bfsLayer
|
5
|