Approximate Branch and Bound for Fast, Risk-Bound Stochastic Path Planning.
Daniel StrawserBrian WilliamsPublished in: ICRA (2018)
Keyphrases
- path planning
- branch and bound
- lower bound
- upper bound
- branch and bound algorithm
- mobile robot
- path planning algorithm
- search algorithm
- collision avoidance
- column generation
- dynamic environments
- worst case
- optimal solution
- multi robot
- optimal path
- obstacle avoidance
- degrees of freedom
- branch and bound method
- branch and bound procedure
- motion planning
- search space
- robot path planning
- aerial vehicles
- potential field
- objective function
- dynamic and uncertain environments
- tree search
- np hard
- linear programming relaxation
- network design problem
- autonomous vehicles
- path finding
- monte carlo
- combinatorial optimization
- configuration space
- particle swarm optimization
- metaheuristic
- lagrangian heuristic