This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Citing Articles via Scopus Google Scholar Articles by Li Han Articles by Valodzin, I. Search for Related Content Social Bookmarking                         What's this?

Convexly Stratified Deformation Spaces and Efficient Path Planning for Planar Closed Chains with Revolute Joints

Department of Mathematics and Computer Science, Clark University, Worcester, MA 01610, USA, lhan{at}clarku.edu

Lee Rudolph

Department of Mathematics and Computer Science, Clark University, Worcester, MA 01610, USA lrudolph{at}clarku.edu

Jonathon Blumenthal

Department of Mathematics and Computer Science, ClarkUniversity, Worcester, MA 01610, USA

Ihar Valodzin

Department of Mathematics and Computer Science, ClarkUniversity, Worcester, MA 01610, USA

Systems involving loops have been especially challenging in the study of robotics, partly because of the requirement to maintain loop closure constraints, conventionally formulated as highly nonlinear equations in joint parameters. In this paper, we present our novel triangle-tree-based approach and parameters for planar closed chains with revolute joints. For such a loop, the loop closure constraints are exactly, not approximately, a set of linear inequalities in our new parameters. Further, our new parameters provide explicit parametrization of the system deformation space (configuration space modulo the group of rigid motions of the system's ambient space respecting system specifications) and endow it with a nice geometry. More precisely, the deformation space of a generic planar loop with n revolute joints consists of 2^n-2 copies of one and the same convex polytope (which, when all of the link lengths are fixed, is bounded and of dimension n - 3), glued together into either one connected component or two (ignoring collision-free constraints), via proper boundary identification. Such a completely solved, stratified space of convex strata will have profound implications for these systems and lead to great simplifications in many kinematics related issues. For example, in essence, our approach makes path planning for planar loops with revolute joints no more difficult than for open chains. We also briefly point out the connection and extension of the work presented here to other systems such as spatial loops with spherical joints and systems involving multiple loops.

Key Words: configuration spaces • deformation spaces • convex stratification • motion planning • kinematics • loop closure constraints • triangle-based parameters • construction trees of triangles

The International Journal of Robotics Research, Vol. 27, No. 11-12, 1189-1212 (2008)
DOI: 10.1177/0278364908097211


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?

This article has been cited by other articles:

				S. Akella, N. M. Amato, W. Huang, and B. Mishra Special Issue on the Seventh International Workshop on Algorithmic Foundations of Robotics The International Journal of Robotics Research, November 1, 2008; 27(11-12): 1173 - 1174. [PDF]