Sampling-Based Motion Planning on Sequenced Manifolds

Peter Englert (University of Southern California),
Isabel M Rayas Fernández (University of Southern California),
Ragesh Kumar Ramachandran (University of Southern California),
Gaurav Sukhatme (University of Southern California)
Paper Website
Paper #039
Interactive Poster Session II Interactive Poster Session VII

0d 00h 00m

0d 00h 00m


We address the problem of planning robot motions in constrained configuration spaces where the constraints change throughout the motion. The problem is formulated as a fixed sequence of intersecting manifolds, which the robot needs to traverse in order to solve the task. We specify a class of sequential motion planning problems that fulfill a particular property of the change in the free configuration space when transitioning between manifolds. For this problem class, the algorithm Planning on Sequenced Manifolds (PSM) is developed which searches for optimal intersection points between manifolds by using RRT in an inner loop with a novel steering strategy. We provide a theoretical analysis regarding PSM*s probabilistic completeness and asymptotic optimality. Further, we evaluate its planning performance on multi-robot object transportation tasks.

Spotlight Presentation

Previous Paper Paper Website Next Paper