|
gptkbp:instanceOf
|
gptkb:search_engine
|
|
gptkbp:abbreviation
|
gptkb:IDA*
|
|
gptkbp:application
|
robotics
puzzle solving
pathfinding
|
|
gptkbp:basedOn
|
gptkb:A*_search_algorithm
iterative deepening depth-first search
|
|
gptkbp:completeness
|
complete
|
|
gptkbp:complexity
|
O(b^d)
|
|
gptkbp:field
|
gptkb:artificial_intelligence
computer science
|
|
gptkbp:goal
|
find least-cost path
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Iterative Deepening A*
|
|
gptkbp:introducedIn
|
1985
|
|
gptkbp:inventedBy
|
gptkb:Richard_E._Korf
|
|
gptkbp:memoryUsage
|
linear in search depth
|
|
gptkbp:notablePublication
|
A* search: An optimal and complete algorithm (Korf, 1985)
|
|
gptkbp:optimizedFor
|
optimal (with admissible heuristic)
|
|
gptkbp:relatedTo
|
gptkb:breadth-first_search
gptkb:A*_search_algorithm
depth-first search
iterative deepening depth-first search
|
|
gptkbp:searchOrder
|
depth-first
|
|
gptkbp:searchStrategy
|
iterative deepening
cost threshold increment
|
|
gptkbp:spaceComplexity
|
O(d)
|
|
gptkbp:type
|
informed search algorithm
graph search algorithm
single-agent search algorithm
|
|
gptkbp:uses
|
heuristic function
|
|
gptkbp:usesHeuristic
|
yes
|
|
gptkbp:bfsParent
|
gptkb:IDA*
|
|
gptkbp:bfsLayer
|
7
|