Designing Optimal Origami Structures by Computational Evolutionary Embryogeny

As the advantages of foldable or deployable structures are being discovered, research into origami engineering has attracted more focus from both artists and engineers. With the aid of modern computer techniques, some computational origami design methods have been developed. Most of these methods focus on the problem of origami crease pattern design — the problem of determining a crease pattern to realize a specified origami final shape, but don’t provide computational solutions to actually developing a shape that meets some design performance criteria. This paper presents a design method that includes the computational design of the finished shape as well as the crease pattern. The origami shape will be designed to satisfy geometric, functional, and foldability requirements. This design method is named computational evolutionary embryogeny for optimal origami design (CEEFOOD), which is an extension of the genetic algorithm (GA) and an original computational evolutionary embryogeny (CEE). Unlike existing origami crease pattern design methods that adopt deductive logic, CEEFOOD implements an abductive approach to progressively evolve an optimal design. This paper presents how CEEFOOD — as a member of the GA family — determines the genetic representation (genotype) of candidate solutions, the formulation of the objective function, and the design of evolutionary operators. This paper gives an origami design problem, which has requirements on the folded-state profile, position of center of mass, and number of creases. Several solutions derived by CEEFOOD are listed and compared to highlight the effectiveness of this abductive design method.© 2014 ASME

[1]  Richard J Trudeau,et al.  Introduction to Graph Theory , 1994 .

[2]  Nancy M. Amato,et al.  Using Motion Planning to Study Protein Folding Pathways , 2002, J. Comput. Biol..

[3]  Tomohiro Tachi,et al.  3D Origami Design based on Tucking Molecule , 2008 .

[4]  Mohamed A. Ismail,et al.  An efficient density based clustering algorithm for large databases , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

[5]  Robert Harbin Secrets of Origami: The Japanese Art of Paper Folding , 1968 .

[6]  Tomohiro Tachi,et al.  Origamizing Polyhedral Surfaces , 2010, IEEE Transactions on Visualization and Computer Graphics.

[7]  Jun Mitani,et al.  A Method for Designing Crease Patterns for Flat-Foldable Origami with Numerical Optimization , 2011 .

[8]  Erik D. Demaine,et al.  Folding Any Orthogonal Maze , 2009 .

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Andrew A. Shapiro,et al.  Computational Evolutionary Embryogeny , 2010, IEEE Transactions on Evolutionary Computation.

[11]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[12]  Singiresu S. Rao Engineering Optimization : Theory and Practice , 2010 .

[13]  Chris P. Bowers Modularity in a Computational Model of Embryogeny , 2008 .

[14]  Wei Li,et al.  Novel Pixelated Multicellular Representation for Origami Structures That Innovates Computational Design and Control , 2013 .

[15]  Robert J. Lang,et al.  A computational algorithm for origami design , 1996, SCG '96.

[16]  Aviv Ovadya Origami transformers : folding orthogonal structures from universal hinge patterns , 2010 .

[17]  Nancy M. Amato,et al.  Using Motion Planning to Map Protein Folding Landscapes and Analyze Folding Kinetics of Known Native Structures , 2003, J. Comput. Biol..

[18]  Chris P. Bowers Simulating Evolution with a Computational Model of Embryogeny: Obtaining Robustness from Evolved Individuals , 2005, ECAL.

[19]  Devin J. Balkcom,et al.  Folding Paper Shopping Bags , 2006 .

[20]  Charis J. Gantes,et al.  Deployable Structures : Analysis and Design , 2001 .