Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics.
Eshed ShahamAriel FelnerNathan R. SturtevantJeffrey S. RosenscheinPublished in: SOCS (2018)
Keyphrases
- np hard
- bidirectional search
- heuristic search
- search algorithm
- greedy heuristic
- lower bound
- special case
- search space
- state space
- planning problems
- tree structure
- admissible heuristics
- globally optimal
- path planning
- search strategies
- database
- mobile robot
- heuristic methods
- machine learning
- databases
- greedy heuristics
- real time