Branch and bound for informative path planning.
Jonathan BinneyGaurav S. SukhatmePublished in: ICRA (2012)
Keyphrases
- multi objective
- branch and bound
- path planning
- search algorithm
- lower bound
- branch and bound algorithm
- mobile robot
- upper bound
- optimal solution
- search space
- column generation
- objective function
- path planning algorithm
- collision avoidance
- obstacle avoidance
- dynamic environments
- branch and bound procedure
- multi robot
- combinatorial optimization
- branch and bound method
- optimal path
- randomly generated problems
- path planner
- dynamic and uncertain environments
- motion planning
- search strategies
- multiple robots
- potential field
- collision free
- degrees of freedom
- robot path planning
- autonomous vehicles
- tree search
- unmanned aerial vehicles
- path finding
- search tree
- branch and bound search
- linear programming
- lagrangian heuristic