Algorithm Based on Deep Reinforcement Learning for Irregular Shape Nesting Problem

Tomoyuki Taniguchi, M. Hirakata, Junichi Man
{"title":"Algorithm Based on Deep Reinforcement Learning for Irregular Shape Nesting Problem","authors":"Tomoyuki Taniguchi, M. Hirakata, Junichi Man","doi":"10.2534/jjasnaoe.33.209","DOIUrl":null,"url":null,"abstract":"An automatic nesting algorithm based on deep reinforcement learning for shipbuilding is proposed. Automatic nesting method is desired because of the large number of parts to be placed. The nesting problem in shipbuilding is very difficult because of the relatively small area where they can be placed and the variety of shapes that can rotate freely. Since it is very difficult to manually create effective placement rules, this paper proposes an algorithm to generate rules autonomously based on reinforcement learning. To apply reinforcement learning to the nesting problem, we organized the problem as a Markov chain process. Based on deep q network, a type of reinforcement learning, we used the components of a real ship's block to learn the network parameters. The parts are represented in pixel format. It is confirmed that the present method was superior to the conventional method, and the results were comparable to those of a skilled person. However, for unlearned members, the results are inferior to those of the conventional method. This problem can be solved by relearning including unlearned components.","PeriodicalId":192323,"journal":{"name":"Journal of the Japan Society of Naval Architects and Ocean Engineers","volume":"135 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Japan Society of Naval Architects and Ocean Engineers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2534/jjasnaoe.33.209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

An automatic nesting algorithm based on deep reinforcement learning for shipbuilding is proposed. Automatic nesting method is desired because of the large number of parts to be placed. The nesting problem in shipbuilding is very difficult because of the relatively small area where they can be placed and the variety of shapes that can rotate freely. Since it is very difficult to manually create effective placement rules, this paper proposes an algorithm to generate rules autonomously based on reinforcement learning. To apply reinforcement learning to the nesting problem, we organized the problem as a Markov chain process. Based on deep q network, a type of reinforcement learning, we used the components of a real ship's block to learn the network parameters. The parts are represented in pixel format. It is confirmed that the present method was superior to the conventional method, and the results were comparable to those of a skilled person. However, for unlearned members, the results are inferior to those of the conventional method. This problem can be solved by relearning including unlearned components.
基于深度强化学习的不规则形状嵌套算法
提出了一种基于深度强化学习的船舶自动嵌套算法。由于需要放置大量零件,因此需要采用自动嵌套方法。造船中的嵌套问题是非常困难的,因为它们可以放置的面积相对较小,而且形状各异,可以自由旋转。由于人工创建有效的放置规则非常困难,本文提出了一种基于强化学习的自动生成规则的算法。为了将强化学习应用于嵌套问题,我们将问题组织为马尔可夫链过程。基于强化学习的一种深度q网络,我们使用一个真实的船块组件来学习网络参数。这些部分以像素格式表示。结果表明,该方法优于传统方法,其结果与技术人员的结果相当。然而,对于不熟悉的成员,其结果不如传统方法。这个问题可以通过重新学习包括未学习的组件来解决。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信