Origami Folding Sequence Generation Using Discrete Particle Swarm Optimization

November 2017

Origami Folding Sequence Generation Using Discrete Particle Swarm Optimization

Authors:

Ha-Duong Bui, Sungmoon Jeong, Nak Young Chong, and Matthew T. Mason
Conference Paper
Proceedings of (NeurIPS) Neural Information Processing Systems

Abstract:

This paper proposes a novel approach to automating origami or paper folding. The folding problem is formulated as a combinatorial optimization problem to automatically find feasible folding sequences toward the desired shape from a generic crease pattern, minimizing the dissimilarity between the current and desired origami shapes. Specifically, we present a discrete particle swarm optimization algorithm, which can take advantage of the classical particle swarm optimization algorithm in a discrete folding action space. Through extensive numerical experiments, we have shown that the proposed approach can generate an optimum origami folding sequence by iteratively minimizing the Hausdorff distance, a dissimilarity metric between two geometric shapes. Moreover, an in-house origami simulator is newly developed to visualize the sequence of origami folding.
@conference{Bui-2017-121288,
author = {Ha-Duong Bui And Sungmoon Jeong And Nak Young Chong And Matthew T. Mason},
title = {Origami Folding Sequence Generation Using Discrete Particle Swarm Optimization},
booktitle = {Proceedings of (NeurIPS) Neural Information Processing Systems},
year = {2017},
month = {November},
pages = {484 - 493},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.