Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function.
Jaël Champagne GareauÉric BeaudryVladimir MakarenkovPublished in: Future Internet (2022)
Keyphrases
- path planning
- branch and bound
- heuristic function
- search algorithm
- heuristic search
- search space
- optimal solution
- path planner
- dead ends
- optimal path
- state space
- path finding
- mobile robot
- lower bound
- branch and bound algorithm
- column generation
- search tree
- heuristic functions
- tree search
- dynamic environments
- upper bound
- initial state
- collision free
- dynamic programming
- heuristic search algorithms
- beam search
- solution space
- search methods
- optimal planning
- game tree
- objective function
- search strategies
- combinatorial optimization
- cost function
- search strategy
- evaluation function
- pattern databases
- domain independent
- hill climbing
- exhaustive search
- np hard
- linear program
- constraint satisfaction