Towards Arranging and Tightening Knots and Unknots With Fixtures

This paper presents a controlled tying approach for knots using fixtures and simple pulling motions applied to the ends of string. Each fixture is specific to a particular knot; the paper gives a design process that allows a suitable fixture to be designed for an input knot. Knot tying is separated into two phases. In the first phase, a fixture is used to loosely arrange the string around a set of rods, with the required topology of the given knot. In the second phase, the string is pulled taut around the tightening fixtures. Two tightening fixture designs are presented. The first design is a fixture with no moving parts; tilted rods whose cross-sections get closer near the tips, guiding string in a controlled fashion as string slides up the rods during tightening. The second design is a collection of straight rods that can move passively along predefined paths during tightening. Successful tying is shown for three interesting cases: a “cloverleaf knot” design, a “double coin” knot design, and the top of a shoelace knot.

[1]  Ronald C. Read,et al.  The knot book: An elementary introduction to the mathematical theory of knots , 1997, Complex..

[2]  Andrew Blake,et al.  Caging Planar Bodies by One-Parameter Two-Fingered Gripping Systems , 1999, Int. J. Robotics Res..

[3]  Nancy M. Amato,et al.  Planning motion in completely deformable environments , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[4]  Louis H. Kauffman,et al.  Unknotting Unknots , 2010, Am. Math. Mon..

[5]  Sergei N. Bespamyatnikh.  Computing homotopic shortest paths in the plane , 2003, SODA '03.

[6]  宮内 隆旨,et al.  Knot tying device , 1997 .

[7]  Pieter Abbeel,et al.  Planning Curvature and Torsion Constrained Ribbons in 3D With Application to Intracavitary Brachytherapy , 2015, IEEE Transactions on Automation Science and Engineering.

[8]  J. W. Alexander.  Topological invariants of knots and links , 1928 .

[9]  Masayuki INABA,et al.  Hand Eye Coordination in Rope Handling , 1985 .

[10]  Jeffrey C. Trinkle,et al.  Contact modes and complementary cones , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[11]  Matthew T. Mason,et al.  Mechanics of Robotic Manipulation , 2001 .

[12]  C. Hayashi,et al.  Unknotting number and number of Reidemeister moves needed for unlinking , 2010, 1012.4131.

[13]  Lydia E. Kavraki,et al.  Path planning for minimal energy curves of constant length , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[14]  Joel Hass,et al.  Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle , 2007, Discret. Comput. Geom..

[15]  John Hershberger,et al.  Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) , 1991, WADS.

[16]  Timothy Bretl,et al.  Quasi-static manipulation of a Kirchhoff elastic rod based on a geometric analysis of equilibrium configurations , 2014, Int. J. Robotics Res..

[17]  Matthew P. Bell,et al.  Flexible Object Manipulation , 2010 .

[18]  Jian S. Dai,et al.  Geometry and kinematic analysis of an origami-evolved mechanism based on artmimetics , 2009, 2009 ASME/IFToMM International Conference on Reconfigurable Mechanisms and Robots.

[19]  Gregory S. Chirikjian,et al.  Steering flexible needles under Markov motion uncertainty , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[20]  Vijay Kumar,et al.  Identification and Representation of Homotopy Classes of Trajectories for Search-based Path Planning in 3D , 2011, Robotics: Science and Systems.

[21]  Eric J. Rawdon,et al.  Approximating the Thickness of a Knot , 1998 .

[22]  Liang Lu,et al.  Folding cartons with fixtures: a motion planning approach , 1999, IEEE Trans. Robotics Autom..

[23]  P. Pierański,et al.  Curvature and torsion of the tight closed trefoil knot , 2008 .

[24]  L. Kauffman.  An Introduction to Knot Theory , 2001 .

[25]  Jean Ponce,et al.  Manipulating Parts with an Array of Pins: A Method and a Machine , 2001 .

[26]  Kenneth Y. Goldberg,et al.  Sensorless planning for medical needle insertion procedures , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[27]  Joel Langer,et al.  Lagrangian Aspects of the Kirchhoff Elastic Rod , 1996, SIAM Rev..

[28]  C. Aneziris.  The mystery of knots : computer programming for knot tabulation , 1999 .

[29]  Dima Grigoriev,et al.  Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane , 1998, ISSAC '98.

[30]  Kazuhisa Mitobe,et al.  Multi-arm robot control system for manipulation of flexible materials in sewing operation , 2000 .

[31]  Stephen G. Kobourov,et al.  Computing homotopic shortest paths efficiently , 2002, Comput. Geom..

[32]  Eric J. Rawdon,et al.  Knot Tightening by Constrained Gradient Descent , 2010, Exp. Math..

[33]  Dima Grigoriev,et al.  Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane , 1997, AAECC.

[34]  Roberto Tamassia,et al.  A New Minimum Cost Flow Algorithm with Applications to Graph Drawing , 1996, GD.

[35]  Devin J. Balkcom,et al.  Robotic origami folding , 2008, Int. J. Robotics Res..

[36]  Matthew P. Bell,et al.  Towards Arranging and Tightening Knots and Unknots with Fixtures , 2014, WAFR.

[37]  Matthew P. Bell,et al.  Knot-tying with four-piece fixtures , 2014, Int. J. Robotics Res..

[38]  Devin J. Balkcom,et al.  Computing wrench cones for planar contact tasks , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[39]  John H. Maddocks,et al.  BIARCS, GLOBAL RADIUS OF CURVATURE, AND THE COMPUTATION OF IDEAL KNOT SHAPES , 2005 .

[40]  Michael A. Erdmann,et al.  Protein Similarity from Knot Theory: Geometric Convolution and Line Weavings , 2005, J. Comput. Biol..

[41]  Jean Ponce,et al.  Manipulating Parts with an Array of Pins: A Method and a Machine , 2001, Int. J. Robotics Res..

[42]  J. Lagarias,et al.  The number of Reidemeister moves needed for unknotting , 1998, math/9807012.

[43]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..