Matching Algorithm for Automated Resource Selection within Assembly Line Design

Daniella Brovkina, O. Riedel
{"title":"Matching Algorithm for Automated Resource Selection within Assembly Line Design","authors":"Daniella Brovkina, O. Riedel","doi":"10.1109/ECICE52819.2021.9645668","DOIUrl":null,"url":null,"abstract":"Despite all the technological progress and digitalization of manufacturing processes, assembly lines and their design are still far from the ideas of the fourth industrial revolution. The assembly planning process has high complexity and is still done manually or only partially automated. One of the biggest challenges is resource selection to automatically identify all the machines that can perform the required assembly process. Based on previous works, this paper presents a matching algorithm for an automated resource selection within a fully automated assembly design platform. This platform uses a set of graph-based models at its core: an assembly feature model for product structure representation, a standardized skill model, and a highly abstract process model. The resulting matching algorithm uses concepts of graph isomorphism and homomorphism for graph analysis to universally identify matches between skill definitions and processes.","PeriodicalId":176225,"journal":{"name":"2021 IEEE 3rd Eurasia Conference on IOT, Communication and Engineering (ECICE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 3rd Eurasia Conference on IOT, Communication and Engineering (ECICE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECICE52819.2021.9645668","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Despite all the technological progress and digitalization of manufacturing processes, assembly lines and their design are still far from the ideas of the fourth industrial revolution. The assembly planning process has high complexity and is still done manually or only partially automated. One of the biggest challenges is resource selection to automatically identify all the machines that can perform the required assembly process. Based on previous works, this paper presents a matching algorithm for an automated resource selection within a fully automated assembly design platform. This platform uses a set of graph-based models at its core: an assembly feature model for product structure representation, a standardized skill model, and a highly abstract process model. The resulting matching algorithm uses concepts of graph isomorphism and homomorphism for graph analysis to universally identify matches between skill definitions and processes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
装配线设计中自动化资源选择的匹配算法
尽管制造过程取得了技术进步和数字化,但装配线及其设计仍与第四次工业革命的理念相去甚远。装配规划过程具有很高的复杂性,并且仍然是手动完成或仅部分自动化。最大的挑战之一是资源选择,以自动识别所有可以执行所需装配过程的机器。在前人研究的基础上,提出了一种自动化装配设计平台中自动化资源选择的匹配算法。该平台以一组基于图的模型为核心:用于产品结构表示的装配特征模型、标准化的技能模型和高度抽象的过程模型。所得到的匹配算法使用图同构和同态的概念进行图分析,以普遍识别技能定义和过程之间的匹配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Experimental Demonstration of 128QAM-OFDM Encoded Terahertz Signals over 20-km SMF Evaluation of Learning Effectiveness Using Mobile Communication and Reality Technology to Assist Teaching: A Case of Island Ecological Teaching [ECICE 2021 Front matter] Application of Time-series Smoothed Excitation CNN Model Study on Humidity Status Fuzzy Estimation of Low-power PEMFC Stack Based on the Softsensing Technology
×
引用
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