|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/15478
|
| タイトル: | Origami Folding Sequence Generation Using Discrete Particle Swarm Optimization |
| 著者: | Bui, Ha-Duong
Jeong, Sungmoon
Chong, Nak Young
Mason, Matthew |
| キーワード: | mathematical origami
folding sequence
combinatorial optimization
particle swarm optimization |
| 発行日: | 2017-10-24 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 10637 |
| 開始ページ: | 484 |
| 終了ページ: | 493 |
| DOI: | 10.1007/978-3-319-70093-9_51 |
| 抄録: | This paper proposes a novel approach to automating origamior 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. |
| Rights: | This is the author-created version of Springer, Ha-Duong Bui, Sungmoon Jeong, Nak Young Chong, Matthew Mason, Lecture Notes in Computer Science, 10637, 2017, 484-493. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-319-70093-9_51 |
| URI: | http://hdl.handle.net/10119/15478 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 23995.pdf | | 2781Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
