Anytime Dynamic A*: An Anytime, Replanning Algorithm.
Maxim LikhachevDavid I. FergusonGeoffrey J. GordonAnthony StentzSebastian ThrunPublished in: ICAPS (2005)
Keyphrases
- learning algorithm
- optimal solution
- computational complexity
- computational cost
- experimental evaluation
- detection algorithm
- high accuracy
- matching algorithm
- simulated annealing
- dynamic programming
- np hard
- preprocessing
- cost function
- linear programming
- particle swarm optimization
- expectation maximization
- search algorithm
- times faster
- classification algorithm
- video sequences
- improved algorithm
- selection algorithm
- recognition algorithm
- convex hull
- clustering method
- optimization algorithm
- data sets
- worst case
- k means