Multi-robot persistent coverage using branch and bound.
José Manuel Palacios-GasósEduardo MontijanoCarlos SagüésSergio LlorentePublished in: ACC (2016)
Keyphrases
- branch and bound
- multi robot
- lower bound
- branch and bound algorithm
- search algorithm
- path planning
- optimal solution
- upper bound
- multi robot systems
- column generation
- mobile robot
- search space
- combinatorial optimization
- multi robot exploration
- initially unknown
- branch and bound method
- network design problem
- multiple robots
- search and rescue
- uncertain environments
- branch and bound procedure
- tree search algorithm
- branch and bound search
- randomly generated problems
- tree search
- beam search
- lagrangian heuristic
- robotic systems
- multi robot coordination
- multi robot cooperative
- real time
- coalitional game theory
- search tree
- np hard
- genetic algorithm