A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning.
Tatsuya ImaiAkihiro KishimotoPublished in: AAAI (2011)
Keyphrases
- hill climbing
- heuristic search
- search algorithm
- optimal planning
- heuristic function
- search space
- path finding
- search strategy
- classical planning
- simulated annealing
- planning problems
- search procedure
- evaluation function
- greedy algorithm
- stochastic domains
- beam search
- greedy search
- branch and bound
- genetic algorithm ga
- locally optimal
- upper bound
- forward selection
- branch and bound search
- dynamic programming
- iterative deepening
- heuristic search algorithms
- decision support
- goal oriented
- search problems
- objective function
- motion planning
- search tree