Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning.
Maximilian FickertJörg HoffmannPublished in: J. Artif. Intell. Res. (2022)
Keyphrases
- hill climbing
- search space
- simulated annealing
- probabilistic relaxation
- iterative algorithms
- search algorithm
- path finding
- genetic algorithm ga
- heuristic search
- objective function
- hill climbing algorithm
- systematic search
- convex relaxation
- search strategy
- online learning
- max min
- optimal planning
- direct search
- domain independent
- mathematical model
- cost function
- multi objective
- evolutionary algorithm
- partial plans
- neural network
- steepest ascent