Statements (23)
Predicate | Object |
---|---|
gptkbp:instanceOf |
gptkb:search_engine
|
gptkbp:advantage |
uses less memory than A*
|
gptkbp:combines |
gptkb:A*_search
iterative deepening depth-first search |
gptkbp:completeness |
complete if branching factor is finite
|
gptkbp:expandsNodes |
in order of increasing f-cost
|
gptkbp:foundIn |
graph search
informed search tree search |
gptkbp:fullName |
gptkb:Iterative_Deepening_A*
|
https://www.w3.org/2000/01/rdf-schema#label |
IDA*
|
gptkbp:introduced |
gptkb:Richard_E._Korf
|
gptkbp:introducedIn |
1985
|
gptkbp:memoryUsage |
linear in search depth
|
gptkbp:optimizedFor |
optimal if heuristic is admissible
|
gptkbp:relatedTo |
A*
iterative deepening search |
gptkbp:usedIn |
gptkb:artificial_intelligence
graph traversal pathfinding |
gptkbp:usesHeuristic |
yes
|
gptkbp:bfsParent |
gptkb:A*_search_algorithm
|
gptkbp:bfsLayer |
6
|