Thursday 13 September 2007

Demonstration: Branch and Bound Path Optimisation

The movie illustrates the branch-and-bound search process, finding the shortest route from the start (left) to the goal (green star, right) avoiding the obstacles (red circles). The vehicle has speed and turn rate limits. The result is globally optimal, but it is not necessary to search all combinations of "left and right".