|
gptkbp:instanceOf
|
gptkb:algorithm
|
|
gptkbp:alsoKnownAs
|
A*
|
|
gptkbp:application
|
robotics
video games
route planning
network routing
AI planning
|
|
gptkbp:category
|
gptkb:search_engine
graph
pathfinding algorithm
|
|
gptkbp:closedList
|
nodes already evaluated
|
|
gptkbp:complete
|
true
|
|
gptkbp:expandsNodes
|
lowest estimated total cost first
|
|
gptkbp:f(n)
|
estimated total cost through n
|
|
gptkbp:field
|
gptkb:artificial_intelligence
computer science
graph traversal
pathfinding
|
|
gptkbp:firstPublished
|
gptkb:A_Formal_Basis_for_the_Heuristic_Determination_of_Minimum_Cost_Paths
gptkb:IEEE_Transactions_on_Systems_Science_and_Cybernetics
1968
|
|
gptkbp:g(n)
|
cost from start to node n
|
|
gptkbp:guaranteesOptimalityIfHeuristicAdmissible
|
true
|
|
gptkbp:guaranteesOptimalityIfHeuristicConsistent
|
true
|
|
gptkbp:h(n)
|
heuristic estimate from n to goal
|
|
gptkbp:heuristicFunction
|
estimates cost to goal
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
AStar
|
|
gptkbp:input
|
weighted graph
|
|
gptkbp:introducedIn
|
1968
|
|
gptkbp:inventedBy
|
gptkb:Bertram_Raphael
gptkb:Nils_Nilsson
gptkb:Peter_Hart
|
|
gptkbp:openList
|
nodes to be evaluated
|
|
gptkbp:openSource
|
gptkb:Java
gptkb:JavaScript
gptkb:Python
gptkb:C++
|
|
gptkbp:optimal
|
true
|
|
gptkbp:output
|
shortest path
|
|
gptkbp:relatedTo
|
gptkb:Dijkstra's_algorithm
gptkb:Greedy_Best-First_Search
|
|
gptkbp:searchStrategy
|
best-first search
|
|
gptkbp:usedIn
|
gptkb:Google_Maps
gptkb:game_AI
navigation systems
robot motion planning
|
|
gptkbp:usesEvaluationFunction
|
f(n) = g(n) + h(n)
|
|
gptkbp:usesHeuristic
|
true
|
|
gptkbp:usesPriorityQueue
|
true
|
|
gptkbp:worstCaseSpaceComplexity
|
O(b^d)
|
|
gptkbp:worstCaseTimeComplexity
|
O(b^d)
|
|
gptkbp:bfsParent
|
gptkb:Eurocopter_AS350
|
|
gptkbp:bfsLayer
|
6
|