Fast-BIT∗: Modified heuristic for sampling-based optimal planning with a faster first solution and convergence in implicit random geometric graphs.
Alexander C. HolstonDeok-Hwa KimJong-Hwan KimPublished in: ROBIO (2017)
Keyphrases
- optimal planning
- optimal plans
- admissible heuristics
- state space search
- heuristic search
- optimal solution
- domain independent
- search algorithm
- heuristic functions
- planning problems
- planning domains
- general purpose
- solution space
- graph structure
- pattern databases
- heuristic search algorithms
- weighted graph
- machine learning
- genetic algorithm