Planning with reachable distances: Fast enforcement of closure constraints

Xinyu Tang, Shawna Thomas, Nancy M. Amato

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Motion planning for closed-chain systems is particularly difficult due to additional closure constraints placed on the system. In fact, the probability of randomly selecting a set of joint angles that satisfy the closure constraints is zero. We propose Planning with Reachable Distance (PRD) to overcome this challenge by first precomputing the subspace satisfying the closure constraints, then directly sampling in it. To do so, we represent the chain as a hierarchy of subchains. Then we calculate the "closure" sub-space as appropriate reachable distance ranges of sub-chains satisfying the closure constraints. This provides two distinct advantages over traditional approaches: (1) configurations are quickly sampled and converted to joint angles using basic trigonometry functions instead of more expensive inverse kinematics solvers, and (2) configurations are guaranteed to be closed. In this paper, we describe this hierarchical chain representation and give a sampling algorithm with complexity linear in the number of links. We provide the necessary motion planning primitives for most sampling-based motion planners. Our experimental results show our method is fast, making sampling closed configurations comparable to sampling open chain configurations that ignore closure constraints. Our method is general, easy to implement, and also extends to other distance-related constraints besides the ones demonstrated here.

Original languageEnglish (US)
Title of host publication2007 IEEE International Conference on Robotics and Automation, ICRA'07
Pages2694-2699
Number of pages6
DOIs
StatePublished - 2007
Externally publishedYes
Event2007 IEEE International Conference on Robotics and Automation, ICRA'07 - Rome, Italy
Duration: Apr 10 2007Apr 14 2007

Publication series

NameProceedings - IEEE International Conference on Robotics and Automation
ISSN (Print)1050-4729

Conference

Conference2007 IEEE International Conference on Robotics and Automation, ICRA'07
CountryItaly
CityRome
Period4/10/074/14/07

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Planning with reachable distances: Fast enforcement of closure constraints'. Together they form a unique fingerprint.

Cite this