Analyzing Tie-Breaking Strategies for the A* Algorithm.
Augusto B. CorrêaAndré Grahl PereiraMarcus RittPublished in: IJCAI (2018)
Keyphrases
- learning algorithm
- times faster
- detection algorithm
- preprocessing
- experimental evaluation
- computational complexity
- worst case
- k means
- clustering method
- dynamic programming
- particle swarm optimization
- significant improvement
- search space
- high accuracy
- linear programming
- tree structure
- improved algorithm
- computationally efficient
- input data
- cost function
- search algorithm
- data structure
- decision trees