A geometry-based framework for modeling the complexity of origami folding

被引:2
|
作者
Schulman, Samuel [1 ]
Ning, Xin [1 ]
机构
[1] Penn State Univ, Dept Aerosp Engn, University Pk, PA 16802 USA
基金
美国国家科学基金会;
关键词
Origami folding; Framework; Miura-ori; TASK VARIABLES;
D O I
10.1016/j.taml.2021.100241
中图分类号
O3 [力学];
学科分类号
08 ; 0801 ;
摘要
This paper presents a quantitative framework to analyze the complexity of folding origami structures from flat membranes. Extensive efforts have realized intricate origami patterns with desired functions such as mechanical properties, packaging efficiency, and deployment behavior. However, the complexity associated with the manufacturing or folding of origami patterns has not been explored. Understanding how difficult origami structures are to make, and how much time they require to form is crucial information to determining the practical feasibility of origami designs and future applications such as robotic origami assembly in space. In this work, we develop this origami complexity metric by modeling the geometric properties and crease formation of the origami structure, from which it outputs crease and pattern complexity values and a prediction of the time to complete the pattern assembly, based on the characteristics of the operator. The framework is experimentally validated by fabricating various Miura-ori origami paper models. (C) 2021 The Authors. Published by Elsevier Ltd on behalf of The Chinese Society of Theoretical and Applied Mechanics.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] A geometry-based framework for modeling the complexity of origami folding
    Samuel Schulman
    Xin Ning
    Theoretical & Applied Mechanics Letters, 2021, 11 (03) : 115 - 124
  • [2] Geometry-Based Thick Origami Simulation
    Kwok, Tsz-Ho
    JOURNAL OF MECHANICAL DESIGN, 2021, 143 (06)
  • [3] Low-Complexity Geometry-Based Modeling of Diffuse Scattering
    Czink, N.
    Kaltenberger, F.
    Zhou, Y.
    Bernado, L.
    Zemen, T.
    Yin, X.
    PROCEEDINGS OF THE FOURTH EUROPEAN CONFERENCE ON ANTENNAS AND PROPAGATION, 2010,
  • [4] The Complexity of Folding Self-Folding Origami
    Stern, Menachem
    Pinson, Matthew B.
    Murugan, Arvind
    PHYSICAL REVIEW X, 2017, 7 (04):
  • [5] Low-Complexity Geometry-Based MIMO Channel Simulation
    Florian Kaltenberger
    Thomas Zemen
    Christoph W. Ueberhuber
    EURASIP Journal on Advances in Signal Processing, 2007
  • [6] Low-complexity geometry-based MIMO channel simulation
    Kaltenberger, Florian
    Zemen, Thomas
    Ueberhuber, Christoph W.
    EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2007, 2007 (1)
  • [7] Geometry-based Computational Modeling of Calcium Signaling in an Astrocyte
    Khalid, Muhammad Uzair
    Tervonen, Aapo
    Korkka, Iina
    Hyttinen, Jari
    Lenk, Kerstin
    EMBEC & NBC 2017, 2018, 65 : 157 - 160
  • [8] Modeling of Spatially Correlated Geometry-Based Stochastic Channels
    Ademaj, Fjolla
    Mueller, Martin K.
    Schwarz, Stefan
    Rupp, Markus
    2017 IEEE 86TH VEHICULAR TECHNOLOGY CONFERENCE (VTC-FALL), 2017,
  • [9] Complexity of convex optimization using geometry-based measures and a reference point
    Robert M. Freund
    Mathematical Programming, 2004, 99 : 197 - 221
  • [10] Coding Efficiency and Complexity Analysis of the Geometry-based Point Cloud Encoder
    Santos, Cristiano
    Tavares, Leandro
    Costa, Eduardo
    Rehbein, Gustavo
    Correa, Guilherme
    Porto, Marcelo
    15TH IEEE LATIN AMERICAN SYMPOSIUM ON CIRCUITS AND SYSTEMS, LASCAS 2024, 2024, : 246 - 250