Location of Repository

Probabilistically complete planning with end-effector pose constraints

By Dmitry Berenson and Siddhartha S. Srinivasa

Abstract

Abstract — We present a proof for the probabilistic completeness of RRT-based algorithms when planning with constraints on end-effector pose. Pose constraints can induce lowerdimensional constraint manifolds in the configuration space of the robot, making rejection sampling techniques infeasible. RRT-based algorithms can overcome this problem by using the sample-project method: sampling coupled with a projection operator to move configuration space samples onto the constraint manifold. Until now it was not known whether the sampleproject method produces adequate coverage of the constraint manifold to guarantee probabilistic completeness. The proof presented in this paper guarantees probabilistic completeness for a class of RRT-based algorithms given an appropriate projection operator. This proof is valid for constraint manifolds of any fixed dimensionality. I

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.188.175
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ri.cmu.edu/pub_file... (external link)
  • http://www.ri.cmu.edu/pub_file... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.