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: Frontiers Robotics AI (2022)
Keyphrases
- path planning
- branch and bound
- heuristic function
- search algorithm
- search space
- heuristic search
- optimal solution
- dead ends
- path planner
- optimal path
- state space
- path finding
- branch and bound algorithm
- mobile robot
- lower bound
- dynamic environments
- beam search
- column generation
- heuristic functions
- initial state
- upper bound
- solution space
- search tree
- hill climbing
- search strategies
- evaluation function
- tree search
- dynamic programming
- collision free
- combinatorial optimization
- optimal planning
- search methods
- constraint satisfaction
- domain independent
- constraint satisfaction problems
- heuristic search algorithms
- metaheuristic
- pattern databases
- orders of magnitude
- cost function
- search strategy