On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
Jana KoehlerJörg HoffmannPublished in: CoRR (2011)
Keyphrases
- dynamic programming
- times faster
- objective function
- computational complexity
- computational cost
- detection algorithm
- learning algorithm
- convergence rate
- preprocessing
- k means
- matching algorithm
- cost function
- improved algorithm
- clustering method
- theoretical analysis
- input data
- high accuracy
- optimization algorithm
- worst case
- np hard
- classification algorithm
- optimal solution
- recognition algorithm
- selection algorithm
- ant colony optimization
- multi objective
- bayesian networks
- data sets