Rapid updating for path-planning using nonlinear branch-and-bound.
Alison Jennifer EeleArthur RichardsPublished in: ICRA (2010)
Keyphrases
- path planning
- branch and bound
- branch and bound algorithm
- search algorithm
- lower bound
- mobile robot
- upper bound
- collision avoidance
- column generation
- optimal solution
- path planning algorithm
- dynamic environments
- obstacle avoidance
- combinatorial optimization
- search space
- multi robot
- branch and bound procedure
- motion planning
- lagrangian heuristic
- optimal path
- dynamic and uncertain environments
- robot path planning
- branch and bound search
- tree search
- path planner
- potential field
- network design problem
- autonomous vehicles
- multiple robots
- degrees of freedom
- aerial vehicles
- path finding
- branch and bound method
- objective function
- unmanned aerial vehicles
- search strategy
- reinforcement learning
- neural network