As advantages of foldable or deployable structures have been established, origami artists and engineers have started to study the engineering applications of origami structures. Methods of computational origami design that serve different types of origami have already been developed. However, most of the existing design methods focus on automatically deriving the crease pattern to realize a given folded finished shape, without actually designing the finished shape itself. To include final shape design into the computational origami design and optimization process, this paper presents a genetic algorithm that aims to develop origami structures featuring optimal geometric, functional, and foldability properties. In accordance with origami, the genetic algorithm is adapted both in the aspects the individual encoding method and the evolutionary operators. To compliment the Genetic algorithms (GA), a new origami crease pattern representation scheme is created. The crease pattern is analogous to the ice-cracks on a frozen lake surface, where each crack is equivalent to a crease and each forking point to a vertex. Thus to form the creases and vertices in an “ice-cracking”-like origami crease pattern, we pick one vertex as the starting location, and let the rest of the creases and vertices grow in the same manner that cracks extend and fork form in ice. In this research, the GA encodes the geometric information of forming the creases and vertices according to the development sequence through the ice-cracking process. Meanwhile, we adapt the evolutionary operators and introduce auxiliary mechanisms for the GA, so as to balance the preservation of both elitism and diversity and accelerate the emergence of optimal design outcomes through the evolutionary design process.

References

References
1.
Harbin
,
R.
,
1997
,
Secrets of Origami: The Japanese Art of Paper Folding
,
3rd ed.
,
Dover Publications
,
Mineola, NY
.
2.
Gantes
,
C. J.
,
2001
,
Deployable Structures: Analysis and Design
,
WIT Press
,
Billerica, MA
.
3.
Demaine
,
E. D.
,
Demaine
,
M. L.
, and
Ku
,
J.
,
2011
, “
Folding Any Orthogonal Maze
,”
Fifth International Meeting of Origami Science, Mathematics, and Education
.
4.
Demaine
,
E. D.
, and
O'Rourke
,
J.
,
2007
,
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
,
Cambridge University Press
,
Cambridge, UK
.
5.
Hull
,
T.
,
2006
,
Project Origami: Activities for Exploring Mathematics
,
A.K. Peters
,
Natick, MA
.
6.
Lang
,
R. J.
,
1996
, “
A Computational Algorithm for Origami Design
,”
12th Annual ACM Symposium on Computational Geometry
, Philadelphia, PA, p.
8
.
7.
Lang
,
R. J.
,
2003
,
Origami Design Secrets: Mathematical Methods for an Ancient Art
,
A.K. Peters
,
Natick, MA
.
8.
Tachi
,
T.
,
2006
, “
3D Origami Design Based on Tucking Molecule
,”
Fourth International Meeting of Origami Science, Mathematics, and Education
, Pasadena, CA, pp.
259
272
.
9.
Tachi
,
T.
,
2010
, “
Origamizing Polyhedral Surfaces
,”
IEEE Trans. Visualization Comput. Graphics
,
16
, pp.
298
311
.10.1109/TVCG.2009.67
10.
Mitchell
,
M.
,
1996
,
An Introduction to Genetic Algorithms
.
MIT Press
,
Cambridge, MA
.
11.
Gallagher
,
K.
, and
Sambridge
,
M.
,
1994
, “
Genetic Algorithms: A Powerful Tool for Large-Scale Nonlinear Optimization Problems
,”
Comput. Geosci.
,
20
, pp.
1229
1236
.10.1016/0098-3004(94)90072-8
12.
Mitani
,
J.
,
2011
, “
A Method for Designing Crease Patterns for Flat-Foldable Origami With Numerical Optimization
,”
J. Geom. Graphics
,
15
, pp.
195
201
.
13.
O'Rourke
,
J.
,
2011
,
How to Fold It: The Mathematics of Linkages, Origami, and Polyhedra
,
Cambridge University Press
,
Cambridge, UK
.
14.
Li
,
W.
, and
McAdams
,
D. A.
,
2013
, “
A Novel Pixelated Multicellular Representation for Origami Structures That Innovates Computational Design and Control
,”
ASME 2013 International Design Engineering Technical Conferences (IDETC) and Computers and Information in Engineering Conference (CIE)
, Portland, OR, Aug. 4–7,
ASME
Paper No. DETC2013-13231, p. V06BT07A041.10.1115/DETC2013-13231
15.
Poma
,
F.
,
2009
,
On The Flat-Foldability Of A Crease Pattern
. Available online at: http://poisson.phc.unipi.it/~poma/Ffcp.pdf.
16.
Schneider
,
J.
,
2004
,
Flat-Foldability of Origami Crease Patterns
, Available online at: http://www.organicorigami.com/thrackle/class/hon394/papers/SchneiderFlatFoldability.pdf.
17.
MathWorks, Digital Modulation.
18.
Jensenm
,
M. T.
,
2003
, “
Reducing the Run-Time Complexity of Multiobjective EAs: The NSGA-II and Other Algorithms
,”
IEEE Trans. Evol. Comput.
,
7
, pp.
503
515
.10.1109/TEVC.2003.817234
19.
Zitzler
,
E.
, and
Thiele
,
L.
,
1999
, “
Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach
,”
IEEE Trans. Evol. Comput.
,
3
, pp.
257
271
.10.1109/4235.797969
20.
Knowles
,
J.
, and
Corne
,
D.
,
1999
, “
The Pareto Archived Evolution Strategy: A New Baseline Algorithm for Pareto Multiobjective Optimisation
,”
CEC 99. Proceedings of the 1999 Congress on Evolutionary Computation
, Washington, DC, pp.
98
105
.
21.
Konak
,
A.
,
Coit
,
D. W.
, and
Smith
,
A. E.
,
2006
, “
Multi-Objective Optimization Using Genetic Algorithms: A Tutorial
,”
Reliab. Eng. Syst. Saf.
,
91
, pp.
992
1007
.10.1016/j.ress.2005.11.018
22.
Goldberg
,
D. E.
,
1989
,
Genetic Algorithms in Search, Optimization, and Machine Learning
,
Addison-Wesley Professional
,
Upper Saddle River, NJ
.
You do not currently have access to this content.