Automated conceptual design of mechanisms based on Thompson Sampling and Monte Carlo Tree Search

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Applied Soft Computing Pub Date : 2025-02-01 DOI:10.1016/j.asoc.2024.112659
Jiangmin Mao , Yingdan Zhu , Gang Chen , Chun Yan , Wuxiang Zhang
{"title":"Automated conceptual design of mechanisms based on Thompson Sampling and Monte Carlo Tree Search","authors":"Jiangmin Mao ,&nbsp;Yingdan Zhu ,&nbsp;Gang Chen ,&nbsp;Chun Yan ,&nbsp;Wuxiang Zhang","doi":"10.1016/j.asoc.2024.112659","DOIUrl":null,"url":null,"abstract":"<div><div>Conceptual design of mechanisms is a crucial part of achieving product innovation as mechanisms perform the transmission and transformation of specific motions in the machine. However, existing approaches for automated synthesis of mechanisms are either inefficient or prone to a loss of optimal solutions. To fill this gap, a systematic online decision-making method using Thompson Sampling (TS) based Monte Carlo Tree Search (MCTS) for automated conceptual design of mechanisms is proposed. The functional transformation relationships between inputs and outputs of the intended mechanism system are used to determine combinatorial patterns. Then, a functional representation model is constructed based on the combination rules of motion features and the inference relationships of function elements to represent a range of primitive mechanisms as fundamental building blocks. Finally, the optimal action selection strategy based on TS is applied into MCTS to develop Dirichlet based Monte Carlo Tree Search (D-MCTS) algorithm for searching mechanism building blocks. In addition, the conceptual design of the beat-up mechanism as well as the stitching and feeding mechanism are conducted to validate the feasibility of the proposed approach. Compared with specialized heuristics, D-MCTS achieves higher efficiency in finding the best combination of mechanism building blocks. Compared with other common algorithms, D-MCTS can always avoid the local optima trap to find the global optimal solution without any necessary hyper-parameter tuning. The proposed method exhibits a more balanced performance in exploration and exploitation, which provides better solutions for mechanism synthesis of given requirements.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"170 ","pages":"Article 112659"},"PeriodicalIF":7.2000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494624014339","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Conceptual design of mechanisms is a crucial part of achieving product innovation as mechanisms perform the transmission and transformation of specific motions in the machine. However, existing approaches for automated synthesis of mechanisms are either inefficient or prone to a loss of optimal solutions. To fill this gap, a systematic online decision-making method using Thompson Sampling (TS) based Monte Carlo Tree Search (MCTS) for automated conceptual design of mechanisms is proposed. The functional transformation relationships between inputs and outputs of the intended mechanism system are used to determine combinatorial patterns. Then, a functional representation model is constructed based on the combination rules of motion features and the inference relationships of function elements to represent a range of primitive mechanisms as fundamental building blocks. Finally, the optimal action selection strategy based on TS is applied into MCTS to develop Dirichlet based Monte Carlo Tree Search (D-MCTS) algorithm for searching mechanism building blocks. In addition, the conceptual design of the beat-up mechanism as well as the stitching and feeding mechanism are conducted to validate the feasibility of the proposed approach. Compared with specialized heuristics, D-MCTS achieves higher efficiency in finding the best combination of mechanism building blocks. Compared with other common algorithms, D-MCTS can always avoid the local optima trap to find the global optimal solution without any necessary hyper-parameter tuning. The proposed method exhibits a more balanced performance in exploration and exploitation, which provides better solutions for mechanism synthesis of given requirements.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
期刊最新文献
Cross-lingual entity alignment based on complex relationships and fine-grained attributes An innovative aggregation operator for enhanced decision-making: A study on interval-valued Pythagorean fuzzy soft sets in material selection A deep-based Gaussian mixture model algorithm for large-scale many objective optimization Applications of Hofstede’s cultural dimensions in 50 countries using TFN-generalized Choquet integrals A Constraint Priority Decision framework for constrained multi-objective optimization with complex feasible regions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1