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 do not 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 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.

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
,
Ashurst, UK
.
3.
Lang
,
R. J.
,
1996
, “
A Computational Algorithm for Origami Design
,” 12th Annual
ACM
Symposium on Computational Geometry, Philadelphia, PA, p.
8
.10.1145/237218.237249
4.
Lang
,
R. J.
,
2005
, “
Origami Design Secrets: Mathematical Methods for an Ancient Art
,”
Mathematics and Statistics, The Mathematical Intelligencer
, Vol.
27
, Springer, New York, p.
4
.
5.
Tachi
,
T.
,
2010
, “
Origamizing Polyhedral Surfaces
,”
IEEE Trans. Visual. Comput. Graphics
,
16
(
2
), pp.
298
311
.10.1109/TVCG.2009.67
6.
Demaine
,
E. D.
,
Demaine
,
M. L.
, and
Ku
,
J.
,
2011
, “
Folding Any Orthogonal Maze
,”
Fifth International Meeting of Origami Science, Mathematics, and Education
, pp.
449
455
.10.1201/b10971-39
7.
Amato
,
N. M.
,
Dill
,
K. A.
, and
Song
,
G.
,
2003
, “
Using Motion Planning to Map Protein Folding Landscapes and Analyze Folding Kinetics of Known Native Structures
,”
J. Comput. Biol.
,
10
(
3–4
), pp.
239
255
.10.1089/10665270360688002
8.
Amato
,
N. M.
, and
Song
,
G.
,
2002
, “
Using Motion Planning to Study Protein Folding Pathways
,”
J. Comput. Biol.
,
9
(
2
), pp.
149
168
.10.1089/10665270252935395
9.
Balkcom
,
D. J.
,
Demaine
,
E. D.
, and
Demaine
,
M. L.
,
2004
, “
Folding Paper Shopping Bags
,”
14th Annual Fall Workshop on Computational Geometry
, MIT, Boston, MA.10.1201/b10653-32
10.
Tachi
,
T.
,
2006
, “
3D Origami Design Based on Tucking Molecule
,”
Fourth International Meeting of Origami Science, Mathematics, and Education, Pasadena, CA
, pp.
259
272
.10.1201/b10653-27
11.
Ovadya
,
A.
,
2010
, “
Origami Transformers: Folding Orthogonal Structures From Universal Hinge Patterns
,” M. Eng. thesis,
Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA
.
12.
Trudeau
,
R. J.
,
1994
,
Introduction to Graph Theory
,
Dover Publications
. Mineola, NY.
13.
Garey
,
M. R.
, and
Johnson
,
D. S.
,
1979
,
Computers and Intractability: A Guide to the Theory of NP-Completeness
,
W. H. Freeman
,
San Francisco, CA
.
14.
Rao
,
S. S.
,
2009
,
Engineering Optimization: Theory and Practice
,
John Wiley & Son, Hoboken, NJ
.
15.
Yogev
,
O.
,
Shapiro
,
A. A.
, and
Antonsson
,
E. K.
,
2010
, “
Computational Evolutionary Embryogeny
,”
IEEE Trans. Evol. Comput.
,
14
(
2
), pp.
301
325
.10.1109/TEVC.2009.2030438
16.
Bentley
,
P.
, and
Kumar
,
S.
,
1999
, “
Three Ways to Grow Designs: A Comparison of Evolved Embryogenies for a Design Problem
,”
Genetic and Evolutionary Computation Conference, Orlando, FL
, p.
9
.
17.
Bowers
,
C. P.
,
2005
, “
Simulating Evolution With a Computational Model of Embryogeny: Obtaining Robustness From Evolved Individuals
,”
Advances in Artificial Life, 8th European Conference on Artificial Life
, pp.
149
158
.
18.
Bowers
,
C. P.
,
2008
, “
Modularity in a Computational Model of Embryogeny
,”
Design by Evolution
, Springer, New York, pp.
243
263
.10.1007/978-3-540-74111-4_14
19.
Li
,
W.
, and
McAdams
,
D. A.
,
2013
, “
A Novel Pixelated Multicellular Representation for Origami Structures That Innovates Computational Design and Control
,”
ASME
Paper No. DETC2013-13231.10.1115/DETC2013-13231
20.
Mitani
,
J.
,
2011
, “
A Method for Designing Crease Patterns for Flat-Foldable Origami with Numerical Optimization
,”
J. Geom. Graphics
,
15
(
2
), pp.
195
201
.
21.
El-Sonbaty
,
Y.
,
Ismail
,
M.
, and
Farouk
,
M.
,
2004
, “
An Efficient Density Based Clustering Algorithm for Large Databases
,”
16th IEEE International Conference on Tools With Artificial Intelligence
, Nov. 15–17, pp.
673
677
.
22.
Ester
,
M.
,
Kriegel
,
H.
,
Sander
,
J.
, and
Xu
,
X.
,
1996
, “
A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases With Noise
,”
Second International Conference on Knowledge Discovery and Data Mining, Portland, OR
.
23.
Dréo
,
J.
,
Pétrowski
,
A.
,
Siarry
,
P.
, and
Taillard
,
E.
,
2003
,
Metaheuristics for Hard Optimization
,
Springer
,
Paris
.
You do not currently have access to this content.