Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:search_engine
graph traversal algorithm |
| gptkbp:category |
best-first search
informed search algorithm |
| gptkbp:complexity |
O(E)
O(b^d) |
| gptkbp:developedBy |
gptkb:Bertram_Raphael
gptkb:Nils_Nilsson gptkb:Peter_Hart |
| gptkbp:foundIn |
shortest path
|
| https://www.w3.org/2000/01/rdf-schema#label |
A* search
|
| gptkbp:introducedIn |
1968
|
| gptkbp:numberOfIssues |
true
|
| gptkbp:optimizedFor |
true
|
| gptkbp:publishedIn |
gptkb:A_Formal_Basis_for_the_Heuristic_Determination_of_Minimum_Cost_Paths
|
| gptkbp:relatedTo |
gptkb:Dijkstra's_algorithm
gptkb:Greedy_Best-First_Search |
| gptkbp:requires |
admissible heuristic
consistent heuristic |
| gptkbp:usedIn |
gptkb:artificial_intelligence
robotics game development pathfinding |
| gptkbp:uses |
cost function
heuristic function |
| gptkbp:bfsParent |
gptkb:cave
|
| gptkbp:bfsLayer |
5
|