Efficient asymptotically-optimal path planning on manifolds

• We describe an efficient method for asymptotically-optimal path planning on constrained configuration spaces.
• The search for a first feasible path is speeded up using a bidirectional search tree.
• The convergence to the optimal solution is accelerated using tools taken from Lifelong Planing A*.
• To deal with manifold configuration spaces we resort to higher-dimensional continuation techniques.

This paper presents an efficient approach for asymptotically-optimal path planning on implicitly-defined configuration spaces. Recently, several asymptotically-optimal path planners have been introduced, but they typically exhibit slow convergence rates. Moreover, these planners cannot operate on the configuration spaces that appear in the presence of kinematic or contact constraints, such as when manipulating an object with two arms or with a multifingered hand. In these cases, the configuration space usually becomes an implicit manifold embedded in a higher-dimensional joint ambient space. Existing sampling-based path planners on manifolds focus on finding a feasible solution, but they do not optimize the quality of the path in any sense and, thus, the returned solution is usually not adequate for direct execution. In this paper, we adapt several techniques to accelerate the convergence of the asymptotically-optimal planners and we use higher-dimensional continuation tools to deal with the case of implicitly-defined configuration spaces. The performance of the proposed approach is evaluated through various experiments.