Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:search_engine
gptkb:pathfinding_algorithm |
| gptkbp:complexity |
O(E)
O(b^d) |
| gptkbp:developedBy |
gptkb:Bertram_Raphael
gptkb:Nils_Nilsson gptkb:Peter_Hart |
| gptkbp:extendsTo |
gptkb:Dijkstra's_algorithm
|
| gptkbp:guarantees |
optimal path (if heuristic is admissible)
|
| gptkbp:introducedIn |
1968
|
| gptkbp:openSource |
gptkb:Java
gptkb:Python gptkb:C++ |
| gptkbp:publishedIn |
gptkb:Communications_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:Greedy_Best-First_Search
gptkb:IDA* gptkb:D*_algorithm Uniform Cost Search |
| gptkbp:requires |
admissible heuristic
graph or grid |
| gptkbp:usedFor |
gptkb:artificial_intelligence
robotics video games route planning |
| gptkbp:uses |
cost function
heuristic function |
| gptkbp:bfsParent |
gptkb:Greedy_Best-First_Search
|
| gptkbp:bfsLayer |
7
|
| http://www.w3.org/2000/01/rdf-schema#label |
A* Search
|