Continuous unfolding of polyhedra - a motion planning approach

Cut along the surface of a polyhedron and unfold it to a planar structure without overlapping is known as Unfolding Polyhedra problem which has been extensively studied in the mathematics literature for centuries. However, whether there exists a continuous unfolding motion such that the polyhedron can be continuously transformed to its unfolding has not been well studied. Recently, researchers started to recognize continuous unfolding as a key step in designing and implementation of self-folding robots. In this paper, we model the unfolding of a polyhedron as multi-link tree-structure articulated robot, and address this problem using motion planning techniques. Instead of sampling in continuous domain which traditional motion planners do, we propose to sample only in the discrete domain. Our experimental results show that sampling in discrete domain is efficient and effective for finding feasible unfolding paths.

[1]  Mary Frecker,et al.  Multi-Field Responsive Origami Structures: Preliminary Modeling and Experiments , 2013 .

[2]  Samuel M. Felton,et al.  A method for building self-folding machines , 2014, Science.

[3]  Nancy M. Amato,et al.  A motion planning approach to folding: from paper craft to protein folding , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[4]  Erik D. Demaine,et al.  Continuous Blooming of Convex Polyhedra , 2011, Graphs Comb..

[5]  Hartmut Prautzsch,et al.  Creating Optimized Cut-Out Sheets for Paper Models from Meshes , 2011 .

[6]  Tomohiro Tachi,et al.  Simulation of Rigid Origami , 2006 .

[7]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[8]  Boris Aronov,et al.  Nonoverlap of the star unfolding , 1992, Discret. Comput. Geom..

[9]  Zhonghua Xi,et al.  Folding Rigid Origami With Closure Constraints , 2014 .

[10]  M. Dunn,et al.  Photo-origami—Bending and folding polymers with light , 2012 .

[11]  Jyh-Ming Lien Plan Folding Motion for Rigid Origami via Discrete Domain Sampling , 2015 .

[12]  Zhonghua Xi,et al.  Folding and unfolding origami tessellation by reusing folding path , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[13]  Ezra Miller,et al.  Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings , 2003, Discret. Comput. Geom..

[14]  Zhonghua Xi,et al.  Plan folding motion for rigid self-folding machine via discrete domain sampling , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[15]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[16]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[17]  Hsu-Chun Yen,et al.  Optimized Topological Surgery for Unfolding 3D Meshes , 2011, Comput. Graph. Forum.