High-speed planning and reducing memory usage of a precomputed search tree using pruning.
Yumiko SuzukiSimon ThompsonSatoshi KagamiPublished in: IROS (2009)
Keyphrases
- memory usage
- search tree
- high speed
- search space
- heuristic search
- search algorithm
- depth first search
- sat solving
- memory requirements
- heuristic function
- memory footprint
- branch and bound algorithm
- root node
- sat solvers
- branch and bound
- search strategy
- b tree
- tree search
- planning problems
- constraint satisfaction problems
- path finding
- genetic algorithm
- constraint satisfaction
- iterative deepening
- binary search trees
- orders of magnitude
- high dimensional
- dead ends