D* Extra Lite: A Dynamic A* With Search-Tree Cutting and Frontier-Gap Repairing.

Maciej Przybylski Barbara Putz

Published in: Int. J. Appl. Math. Comput. Sci. (2017)

Keyphrases

search tree
search algorithm
search space
depth first search
branch and bound algorithm
branching factor
sat solvers
tree search
root node
sat solving
cost function
similarity search
b tree
iterative deepening
backtracking algorithm