Optimizations for sampling-based motion planning algorithms

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2014.Cataloged from PDF version of thesis.Includes bibliographical references (pages 141-150).Sampling-basedalgorithms solve the motion planning problem by successively solving several separate suproblems of reduced complexity. As a result, the efficiency of the sampling-based algorithm depends on the complexity of each of the algorithms used to solve the individual subproblems, namely the procedures GenerateSample, FindNearest, LocalPlan, CollisionFree, and AddToGraph. However, it is often the case that these subproblems are quite related, working on common components of the problem definition. Therefore, distinct algorithms and segregated data structures for solving these subproblems might be costing sampling-based algorithms more time than necessary. The thesis of this dissertation is the following: By taking advantage of the fact that these subproblems are solved repeatedly with similar inputs, and the relationships between data structures used to solve the subproblems, we may significantly reduce the practical complexity of sampling-based motion planning algorithms. Moreover, this reuse of information from components can be used to find a middle ground between exact motion planning algorithms which find an explicit representation ofthe collision-free space,and sampling-based algorithms which find no representation of the collision-free space, except for the zeromeasure paths between connected nodes in the roadmap.by Joshua John Bialkowski.Ph. D