Statements (26)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:Search_Algorithm
|
| gptkbp:alsoKnownAs |
gptkb:GBFS
|
| gptkbp:bay |
Branching Factor
|
| gptkbp:canFailOn |
Infinite Graphs
|
| gptkbp:canGetStuckIn |
Loops
|
| gptkbp:complexity |
O(b^m)
|
| gptkbp:expandsNodes |
Based on Heuristic Estimate
|
| gptkbp:expandsNodeWithLowest |
Heuristic Value
|
| gptkbp:firstDescribed |
gptkb:Dechter_and_Pearl
1985 |
| gptkbp:m |
Maximum Depth of Search Space
|
| gptkbp:numberOfIssues |
No
|
| gptkbp:openListDataStructure |
Priority Queue
|
| gptkbp:optimizedFor |
No
|
| gptkbp:relatedTo |
gptkb:Breadth-First_Search
gptkb:Depth-First_Search gptkb:A*_Search gptkb:Best-First_Search |
| gptkbp:searchStrategy |
Informed
|
| gptkbp:spaceComplexity |
O(b^m)
|
| gptkbp:usedIn |
gptkb:artificial_intelligence
Pathfinding |
| gptkbp:usesHeuristic |
Yes
|
| gptkbp:bfsParent |
gptkb:A*_search_algorithm
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Greedy Best-First Search
|