Heuristics approach for robot path minimization for lamination assembly

A. Patil, D. Sachan
{"title":"Heuristics approach for robot path minimization for lamination assembly","authors":"A. Patil, D. Sachan","doi":"10.1109/RACE.2015.7097235","DOIUrl":null,"url":null,"abstract":"In many industries, the use of robots is constantly increasing due to creation of new applications and also due to increasing level of robot technology. In energy industry, the use of robots is limited due to heavy and large parts. One of the key applications in energy industry where robots can be deployed is the process of stacking stator core laminations for generators and large motors. To eliminate the need of huge investment of time and money to build an actual prototype for such a process, cycle time needs to be estimated through the simulation with suitable layout of equipment. The layout having multiple pick tables and multiple place positions for the assembly of laminations creates a problem of analysis of cycle time as there are many choices of heuristic that can be used while optimizing the robot path and program. This paper describes and analyses six heuristic methods with dual objectives of minimizing robot path and achieving uniform unloading of the pick stations. An actual example is used to demonstrate the heuristic methods which can also be used for any pick and place applications for an automated or manual device. The results revealed that the some heuristics have an advantage over others making them viable to use in actual applications.","PeriodicalId":161131,"journal":{"name":"2015 International Conference on Robotics, Automation, Control and Embedded Systems (RACE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Robotics, Automation, Control and Embedded Systems (RACE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RACE.2015.7097235","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In many industries, the use of robots is constantly increasing due to creation of new applications and also due to increasing level of robot technology. In energy industry, the use of robots is limited due to heavy and large parts. One of the key applications in energy industry where robots can be deployed is the process of stacking stator core laminations for generators and large motors. To eliminate the need of huge investment of time and money to build an actual prototype for such a process, cycle time needs to be estimated through the simulation with suitable layout of equipment. The layout having multiple pick tables and multiple place positions for the assembly of laminations creates a problem of analysis of cycle time as there are many choices of heuristic that can be used while optimizing the robot path and program. This paper describes and analyses six heuristic methods with dual objectives of minimizing robot path and achieving uniform unloading of the pick stations. An actual example is used to demonstrate the heuristic methods which can also be used for any pick and place applications for an automated or manual device. The results revealed that the some heuristics have an advantage over others making them viable to use in actual applications.
分层装配机器人路径最小化的启发式方法
在许多行业中,由于新应用的创造以及机器人技术水平的提高,机器人的使用不断增加。在能源工业中,由于零件笨重,机器人的使用受到限制。在能源工业中,机器人可以部署的关键应用之一是发电机和大型电机定子铁芯片的堆叠过程。为了不需要投入大量的时间和金钱来构建这样一个过程的实际原型,需要通过模拟来估计周期时间,并适当地布置设备。由于在对机器人路径和程序进行优化时存在多种启发式选择,因此具有多个取片台和多个放置位置的分层装配布局产生了周期时间分析问题。本文描述并分析了具有最小化机器人路径和实现取货工位均匀卸载双重目标的六种启发式方法。用一个实际的例子来演示启发式方法,该方法也可用于任何自动或手动设备的取放应用。结果表明,一些启发式方法比其他启发式方法具有优势,使它们能够在实际应用中使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信