Data-driven prediction and analysis of chaotic origami dynamics

Hiromi Yasuda; Koshiro Yamaguchi; Yasuhiro Miyazawa; Richard Wiebe; Jordan R. Raney; Jinkyu Yang

Home/Archive/arXiv

arXiv · 2002.12176

Data-driven prediction and analysis of chaotic origami dynamics

Hiromi Yasuda·Koshiro Yamaguchi·Yasuhiro Miyazawa·Richard Wiebe·Jordan R. Raney·Jinkyu Yang

View original source ↗Read source document ↗Export metadata ↓

Abstract

Advances in machine learning have revolutionized capabilities in applications ranging from natural language processing to marketing to health care. Here, we demonstrate the efficacy of machine learning in predicting chaotic behavior in complex nonlinear mechanical systems. Specifically, we use quasi-recurrent neural networks to predict extremely chaotic time series data obtained from multistable origami systems. Additionally, while machine learning is often viewed as a "black box", in this study we conduct hidden layer analysis to understand how the neural network can process not only periodic, but also chaotic data in an accurate manner. Also, our approach shows its effectiveness in characterizing and predicting chaotic dynamics in a noisy environment of vibrations without relying on a mathematical model of origami systems. Therefore, our method is fully data-driven and has the potential to be used for complex scenarios, such as the nonlinear dynamics of thin-walled structures and biological membrane systems.

Explore related subjects

cond-mat.soft cond-mat.dis-nn physics.class-ph

Keep this discovery

BibTeX RIS

Hiromi Yasuda, Koshiro Yamaguchi, Yasuhiro Miyazawa, Richard Wiebe, Jordan R. Raney, Jinkyu Yang. 2020-02-26. Data-driven prediction and analysis of chaotic origami dynamics. https://arxiv.org/abs/2002.12176

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Slow Dynamics and the Geometry of Jammed Packings

Saddle points in the energy landscape of granular packings dominate the discrete steepest descent dynamics and ultimately determine the path that an out of mechanical equilibrium packing will follow and the resulting stable minimum that it will find. The saddle points that ultimately determine the resulting minima tend to be low-index saddle points. For models with an analytic energy landscape, such as the $p$-spin model, the steepest descent minimization path is affected by higher-index saddle points, which pull the system towards saddle points of decreasing index before arriving at the minima. Here, we examine the steepest descent minimization path of granular packings and compare them to the $p$-spin model. We show that the granular packing steepest descent minimization paths act like their smooth energy landscape counterparts and get attracted by saddle points. The index versus time curves for all models follow a shifted, stretched exponential. We further show that the shape parameter for the granular packings is unchanged when the energy landscape is modified to become analytic (Gaussian potential in a harmonic well) or non-local (Mari-Krzakala-Kurchan). The $p$-spin, on the other hand, has a significantly larger shape parameter. The reason is not due to the dimensionality, packing fraction, nonanalyticity, or the locality of the Hamiltonian of the models. The exact reason for the discrepancy in the shape parameter is \st{still} an unsolved mystery.

cond-mat.soft↗

arXiv2026

A Phase-Field Study of Desiccation Crack Pattern Maturation under Drying-Wetting Cycles

The characteristic intersection angle of the desiccation crack relaxes from near \ang{90} toward \ang{120} under repeated drying--wetting cycles. However, the theoretical understanding of this relaxation is insufficient, especially the modeling of the drying--wetting cycles. Here we introduce a phase-field model of desiccation fracture, extending the model proposed in previous studies by adding crack healing and a scar effect left by past cracks. By repeating drying--wetting cycles in a finite element simulation, we find that the angle distribution develops a growing peak near \ang{120} as the cycle number increases, consistent with experiments. The standard deviation of the intersection angle from \ang{120} relaxes exponentially with a characteristic time of about 2.85 cycles. These results are consistent with experiments, except that the characteristic time is slightly smaller than the experimental value. Crack energy dominates the total energy and also relaxes exponentially with nearly the same characteristic cycle as the angle relaxation. This decay is driven mainly by a shortening of the effective crack length rather than a change in effective fracture toughness.

cond-mat.soft↗

arXiv2026

Kinetics of ferritin crystal formation and melting in acoustically levitated droplets

Understanding protein crystallization pathways is essential for controlling crystallization in structural biology, materials science, and pharmaceutical applications. Classical nucleation theory does not fully capture crystallization processes for several proteins, including ferritin. Here, we combine acoustic levitation with small- and wide-angle X-ray scattering (SAXS and WAXS) to monitor ferritin crystallization in evaporating aqueous polyethylene glycol (PEG) solutions. Acoustic levitation rapidly drives the droplets through a broad range of protein and polymer concentrations, enabling time-resolved measurements of crystallization during evaporation. The scattering data show that ferritin crystals form during evaporation and subsequently lose their crystalline order upon further dehydration. Varying the PEG molecular weight switches between distinct crystallization pathways: one dominated by attractive protein-protein interactions and another dominated by repulsive interactions and excluded-volume effects. Furthermore, we find that lower molecular weight PEG (1000 g/mol) suppresses the dehydration-induced loss of crystalline order observed for higher molecular weight PEG (6000 g/mol), providing a simple strategy for improving protein crystal stability.

cond-mat.soft↗