Optimal Trajectory Planning for a Robotic Manipulator Palletizing Tasks *

F. Parisi, A. M. Mangini, M. P. Fanti
{"title":"Optimal Trajectory Planning for a Robotic Manipulator Palletizing Tasks *","authors":"F. Parisi, A. M. Mangini, M. P. Fanti","doi":"10.1109/SMC42975.2020.9282868","DOIUrl":null,"url":null,"abstract":"In recent years, the employment of robots has become a value-added entity in the industries in gaining their competitive advantages. Moreover, thanks to Industry 4.0 paradigm, many production tasks have grown in terms of dimensionality, complexity and higher precision and need to be performed by robots. Among them, the palletizing task is still highly dependent on the particular problem to solve, and its optimization needs to be performed basing on the ground condition. In this paper a palletizing task problem performed by a robotic manipulator is studied. More in detail, some objects have to be transported from a pre-determined storage area to a delivery area. In the storage area the objects are stacked one on the other in columns, while in the delivery area the robotic manipulator poses the objects in horizontal levels, one over another. The process is optimized by minimizing the total distance travelled by the robotic manipulator to transport all the objects from the storage area to the delivery area. An Integer Linear Programming (ILP) problem is formalized and tested by simulations and experimental results.","PeriodicalId":6718,"journal":{"name":"2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","volume":"7 1","pages":"2901-2906"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMC42975.2020.9282868","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In recent years, the employment of robots has become a value-added entity in the industries in gaining their competitive advantages. Moreover, thanks to Industry 4.0 paradigm, many production tasks have grown in terms of dimensionality, complexity and higher precision and need to be performed by robots. Among them, the palletizing task is still highly dependent on the particular problem to solve, and its optimization needs to be performed basing on the ground condition. In this paper a palletizing task problem performed by a robotic manipulator is studied. More in detail, some objects have to be transported from a pre-determined storage area to a delivery area. In the storage area the objects are stacked one on the other in columns, while in the delivery area the robotic manipulator poses the objects in horizontal levels, one over another. The process is optimized by minimizing the total distance travelled by the robotic manipulator to transport all the objects from the storage area to the delivery area. An Integer Linear Programming (ILP) problem is formalized and tested by simulations and experimental results.
机器人码垛作业的最优轨迹规划[j]
近年来,机器人的使用已经成为各行业获得竞争优势的增值实体。此外,由于工业4.0范式,许多生产任务在维度,复杂性和更高精度方面都有所增长,需要由机器人执行。其中,码垛任务仍然高度依赖于要解决的具体问题,需要根据地面情况进行优化。本文研究了一个由机器人机械手执行的码垛任务问题。更详细地说,一些对象必须从预定的存储区域运输到交付区域。在储存区,物品以列的形式一个接一个地堆叠在一起,而在配送区,机器人机械手将物品放置在水平水平上,一个接一个。通过最小化机器人将所有物体从存储区运输到交付区所走的总距离来优化该过程。对整数线性规划(ILP)问题进行形式化,并通过仿真和实验结果进行了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信