A branch-and-bound approach for path planning of vehicles under navigation relayed by multiple stations.
Mingfeng QiLihua DouBin XinJie ChenPublished in: ASCC (2017)
Keyphrases
- path planning
- branch and bound
- autonomous vehicles
- obstacle avoidance
- potential field
- mobile robot
- indoor environments
- lower bound
- branch and bound algorithm
- search algorithm
- path planning algorithm
- column generation
- autonomous navigation
- aerial vehicles
- search space
- navigation tasks
- collision avoidance
- optimal solution
- dynamic environments
- unmanned aerial vehicles
- tree search
- collision free
- multi robot
- upper bound
- branch and bound method
- motion planning
- combinatorial optimization
- dynamic and uncertain environments
- optimal path
- branch and bound search
- path finding
- branch and bound procedure
- robot path planning
- multiple robots
- degrees of freedom
- lagrangian heuristic
- route planning
- approximation algorithms
- ground vehicles
- heuristic search