A Constraint-Aware Motion Planning Algorithm for Robotic Folding of Clothes

  • Lakshmanan K
  • Sachdev A
  • Xie Z
  • et al.
N/ACitations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Robotic manipulation of 2D deformable objects is a difficult problem largely because such objects typically have infinite-dimensional configuration spaces and are too computationally expensive to simulate in the inner-loop of a motion planner.The problem we address is as follows: Given a robot model, the shape of a piece of cloth in a spread-out configuration on a horizontal table, and a final folded configuration specified by a sequence of g-folds, output a sequence of robot motions that achieve the final folded configuration or report that none exists, taking into account the kinematics constraints. We make this optimal on execution time.

Cite

CITATION STYLE

APA

Lakshmanan, K., Sachdev, A., Xie, Z., Berenson, D., Goldberg, K., & Abbeel, P. (2013). A Constraint-Aware Motion Planning Algorithm for Robotic Folding of Clothes (pp. 547–562). https://doi.org/10.1007/978-3-319-00065-7_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free