基于图模型的选择性拆卸序列规划研究

International Conference on Algorithm, Imaging Processing and Machine Vision (AIPMV 2023) Pub Date : 2024-01-09 DOI:10.1117/12.3014520

dongmei Liu, Binfeng D. Lin, Yongfeng Li, V. Tarelnyk

{"title":"基于图模型的选择性拆卸序列规划研究","authors":"dongmei Liu, Binfeng D. Lin, Yongfeng Li, V. Tarelnyk","doi":"10.1117/12.3014520","DOIUrl":null,"url":null,"abstract":"In order to solve the disassembly plan of the target parts in the product with high efficiency, a disassembly hybrid graph model of the target parts is proposed and established based on the disassembly connection relationship and disassembly priority constraint relationship between the parts in the product. The disassembly sequence planning problem of the target parts is transformed into a search and optimization problem for the path with the optimal value in the graph model. At the same time, the sorting algorithm is used to solve the mixed graph model of the target part disassembly, finally, an example is given the feasibility of this method has been verified.","PeriodicalId":516634,"journal":{"name":"International Conference on Algorithm, Imaging Processing and Machine Vision (AIPMV 2023)","volume":"186 1-2","pages":"129691W - 129691W-6"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on selective disassembly sequence planning based on graph model\",\"authors\":\"dongmei Liu, Binfeng D. Lin, Yongfeng Li, V. Tarelnyk\",\"doi\":\"10.1117/12.3014520\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to solve the disassembly plan of the target parts in the product with high efficiency, a disassembly hybrid graph model of the target parts is proposed and established based on the disassembly connection relationship and disassembly priority constraint relationship between the parts in the product. The disassembly sequence planning problem of the target parts is transformed into a search and optimization problem for the path with the optimal value in the graph model. At the same time, the sorting algorithm is used to solve the mixed graph model of the target part disassembly, finally, an example is given the feasibility of this method has been verified.\",\"PeriodicalId\":516634,\"journal\":{\"name\":\"International Conference on Algorithm, Imaging Processing and Machine Vision (AIPMV 2023)\",\"volume\":\"186 1-2\",\"pages\":\"129691W - 129691W-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Algorithm, Imaging Processing and Machine Vision (AIPMV 2023)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.3014520\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Algorithm, Imaging Processing and Machine Vision (AIPMV 2023)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.3014520","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

为了高效解决产品中目标零件的拆卸计划问题，根据产品中零件之间的拆卸连接关系和拆卸优先级约束关系，提出并建立了目标零件的拆卸混合图模型。将目标零件的拆卸顺序规划问题转化为图模型中最优值路径的搜索和优化问题。同时，利用排序算法求解目标零件拆卸的混合图模型，最后通过实例验证了该方法的可行性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Research on selective disassembly sequence planning based on graph model

In order to solve the disassembly plan of the target parts in the product with high efficiency, a disassembly hybrid graph model of the target parts is proposed and established based on the disassembly connection relationship and disassembly priority constraint relationship between the parts in the product. The disassembly sequence planning problem of the target parts is transformed into a search and optimization problem for the path with the optimal value in the graph model. At the same time, the sorting algorithm is used to solve the mixed graph model of the target part disassembly, finally, an example is given the feasibility of this method has been verified.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Conference on Algorithm, Imaging Processing and Machine Vision (AIPMV 2023)

自引率

0.00%

发文量