A Polynomial Planning Algorithm that Beats LAMA and FF.
Nir LipovetzkyHector GeffnerPublished in: ICAPS (2017)
Keyphrases
- learning algorithm
- preprocessing
- improved algorithm
- matching algorithm
- experimental evaluation
- np hard
- high accuracy
- neural network
- dynamic programming
- search space
- clustering method
- polynomially bounded
- convergence rate
- path planning
- tree structure
- cost function
- optimization algorithm
- theoretical analysis
- probabilistic model
- k means
- expectation maximization
- input data
- orders of magnitude
- classification algorithm
- computational complexity
- heuristic search
- computational cost
- similarity measure
- significant improvement