Motion planning of fork lift group in warehouse management - dynamical scheduling of arrangement work

T. Hara, T. Higashi, J. Ota, H. Tamura
{"title":"Motion planning of fork lift group in warehouse management - dynamical scheduling of arrangement work","authors":"T. Hara, T. Higashi, J. Ota, H. Tamura","doi":"10.1109/RISSP.2003.1285593","DOIUrl":null,"url":null,"abstract":"In this paper, as the first step of managing both storagability and operatability in the floor warehouse, we deal with a scheduling for assignment of forklifts on an arrangement work. We propose an algorithm that calculates a semi-optimal solution in practical time for this problem. This algorithm bases on simulated annealing and consists of three layers with a different search domain. We also propose methods of online re-planning against the model error in offline plan stage, and the uncertainty of human work. The validity of our method is verified in simulation.","PeriodicalId":205610,"journal":{"name":"IEEE International Conference on Robotics, Intelligent Systems and Signal Processing, 2003. Proceedings. 2003","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Robotics, Intelligent Systems and Signal Processing, 2003. Proceedings. 2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RISSP.2003.1285593","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In this paper, as the first step of managing both storagability and operatability in the floor warehouse, we deal with a scheduling for assignment of forklifts on an arrangement work. We propose an algorithm that calculates a semi-optimal solution in practical time for this problem. This algorithm bases on simulated annealing and consists of three layers with a different search domain. We also propose methods of online re-planning against the model error in offline plan stage, and the uncertainty of human work. The validity of our method is verified in simulation.
仓库管理中叉车群的运动规划——布置工作的动态调度
本文首先对布置作业中叉车的调度问题进行了研究,并将其作为管理地面仓库可储存性和可操作性的第一步。我们提出了一种算法,在实际时间内计算出该问题的半最优解。该算法以模拟退火为基础,由三层结构组成,各层结构具有不同的搜索域。针对离线规划阶段的模型误差和人工工作的不确定性,提出了在线重新规划的方法。仿真结果验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书