A Heuristic Sequencing Method for Time Optimal Tracking of Open and Closed Paths

Christian Zauner, H. Gattringer, A. Müller, Matthias Jörgl
{"title":"A Heuristic Sequencing Method for Time Optimal Tracking of Open and Closed Paths","authors":"Christian Zauner, H. Gattringer, A. Müller, Matthias Jörgl","doi":"10.3311/eccomasmbd2021-138","DOIUrl":null,"url":null,"abstract":"Tracking sequences of predefined open and closed paths is of crucial interest for applications like laser cutting and similar production processes. These distinct paths are connected by non-productive, four times continuously differentiable trajectories, which also account for the overall process time. Heuristic methods are applied in order to find a proper sequencing of the open and closed path and thereby minimize the overall process time subject to constraints given by the system limits. To this end the exact traversing times of the non-productive linking trajectories are computed, which also have to be time optimal subject to the system limits. Finally two heuristic algorithms are presented and compared with respect to solution quality and calculation time using randomly generated problems.","PeriodicalId":431921,"journal":{"name":"Proceedings of the 10th ECCOMAS Thematic Conference on MULTIBODY DYNAMICS","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 10th ECCOMAS Thematic Conference on MULTIBODY DYNAMICS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3311/eccomasmbd2021-138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Tracking sequences of predefined open and closed paths is of crucial interest for applications like laser cutting and similar production processes. These distinct paths are connected by non-productive, four times continuously differentiable trajectories, which also account for the overall process time. Heuristic methods are applied in order to find a proper sequencing of the open and closed path and thereby minimize the overall process time subject to constraints given by the system limits. To this end the exact traversing times of the non-productive linking trajectories are computed, which also have to be time optimal subject to the system limits. Finally two heuristic algorithms are presented and compared with respect to solution quality and calculation time using randomly generated problems.
一种启发式排序的开闭路径时间最优跟踪方法
跟踪预定义的开放和封闭路径序列对于激光切割和类似生产过程等应用至关重要。这些不同的路径由非生产性的、四次连续可微分的轨迹连接起来,这也说明了整个过程时间。启发式方法的应用是为了找到一个适当的顺序的开放和封闭的路径,从而最大限度地减少总体过程时间受系统限制的约束。为此,计算非生产性连接轨迹的精确遍历时间,这也必须是受系统限制的时间最优。最后给出了两种启发式算法,并对随机生成问题的求解质量和计算时间进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信