Tangent Space RRT with Lazy Projection: An Efficient Planning Algorithm for Constrained Motions

  • Terry Taewoong Um
  • Beobkyoon Kim
  • Chansoo Suh
  • Frank Chongwoo Park
Conference paper

Abstract

Rapidly-Exploring Random Trees (RRT) have been successfully used in motion planning problems involving a wide range of constraints. In this paper we develop a more robust and efficient version of the constrained RRT planning algorithm of [1]. The key idea is based on first constructing RRTs on tangent space approximations of constraint manifold, and performing lazy projections to the constraint manifold when the deviation exceeds a prescribed threshold. Our algorithm maintains the Voronoi bias property characteristic of RRT-based algorithms, while also reducing the number of projections. Preliminary results of a numerical study, together with a discussion of the potential strengths and weaknesses of our algorithm, are presented.

Key words

Rapidly-exploring random tree constrained motion planning lazy projection 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berson, D., Srinivasa, S., Ferguson, D., and Kuffner, J., Manipulation planning on constraint manifolds, in Proc. IEEE Int. Conf. Robotics and Automation (2009).Google Scholar
  2. 2.
    Sentis, S. and Khatib, O., Synthesis of whole-body behaviors through hierarchical control of behavioral primitives, Int. J. Humanoid Robots (2005).Google Scholar
  3. 3.
    Koga, Y., Kondo, K., Kuffner, J., and Latombe, J., Planning motions with intentions. In SIG-GRAPH (1994).Google Scholar
  4. 4.
    Yamane, K., Kuffner, J., and Hodgins, J., Synthesizing animations of human manipulation tasks. In ACM Transactions on Graphics (2004).Google Scholar
  5. 5.
    LaValle, S., Rapidly-exploring random trees: a new tool for path planning, TR 98-11, Computer Science Department, Iowa State University (1998).Google Scholar
  6. 6.
    LaValle, S. and Kuffner, J., Rapidly exploring random trees: progress and prospects. In Workshop on Algorithmic Foundations of Robotics (2000).Google Scholar
  7. 7.
    Kavraki, L., Svestka, P., Latombe, J., and Overmars, M., Probabilistic roadmaps for path planning in high-dimensional configuration spaces. In Proc. IEEE Int. Conf. Robotics Automation (2002).Google Scholar
  8. 8.
    LaValle, S., Yakey, J., and Kavraki, L., A probabilistic roadmap approach for systems with closed kinematic chains. In Proc. IEEE Int. Conf. Robotics and Automation (1999).Google Scholar
  9. 9.
    Yao, Z. and Gupta, K., Path planning with general end-effector constraints: Using task space to guide configuration space search. In Proc. IEEE/RSJ Int. Conf. Intelligent Robots and Systems (2005).Google Scholar
  10. 10.
    Stilman, M., Task constrained motion planning in robot joint space. In Proc. IEEE/RSJ Int. Conf. Intelligent Robots and Systems (2007).Google Scholar
  11. 11.
    Lindermann, S. and LaValle, S., Incrementally reducing dispersion by increasing Voronoi bias in RRTs. In Proc. IEEE Int. Conf. Robotics and Automation (2004).Google Scholar
  12. 12.
    Sanchez, G. and Latombe, J., A single query bi-directional probabilistic roadmap planner with lazy collision checking. In Int. Symp. Robotics Research, Lorne, Victoria, Australia (2001).Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  • Terry Taewoong Um
    • 1
  • Beobkyoon Kim
    • 1
  • Chansoo Suh
    • 1
  • Frank Chongwoo Park
    • 1
  1. 1.School of Mechanical and Aerospace EngineeringSeoul National UniversitySeoulKorea

Personalised recommendations