AD*-Cut: A Search-Tree Cutting Anytime Dynamic A* Algorithm.
Maciej PrzybylskiPublished in: ICAPS (2018)
Keyphrases
- search tree
- bin packing
- dynamic programming
- cost function
- np hard
- search space
- objective function
- search algorithm
- particle swarm optimization
- computational complexity
- dynamic environments
- optimal solution
- similarity measure
- iterative deepening
- special case
- path planning
- branch and bound algorithm
- depth first search