智能仓库中多移动机器人的路径规划

Ali Bolu, Ömer Korçak
{"title":"智能仓库中多移动机器人的路径规划","authors":"Ali Bolu, Ömer Korçak","doi":"10.1109/ICCMA46720.2019.8988635","DOIUrl":null,"url":null,"abstract":"Warehouse operations need high labor force and physical space. Currently, companies with huge warehouses are investing on autonomous robots to save time and energy, and to prevent human-based errors. One of the most important challenges in a smart warehouse with multiple moving robots is path planning because of its dynamics. This paper provides a complete and error-free solution to the path-planning problem, and describes its performance in various warehouse scenarios with different number of robots and different design considerations.","PeriodicalId":377212,"journal":{"name":"2019 7th International Conference on Control, Mechatronics and Automation (ICCMA)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Path Planning for Multiple Mobile Robots in Smart Warehouse\",\"authors\":\"Ali Bolu, Ömer Korçak\",\"doi\":\"10.1109/ICCMA46720.2019.8988635\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Warehouse operations need high labor force and physical space. Currently, companies with huge warehouses are investing on autonomous robots to save time and energy, and to prevent human-based errors. One of the most important challenges in a smart warehouse with multiple moving robots is path planning because of its dynamics. This paper provides a complete and error-free solution to the path-planning problem, and describes its performance in various warehouse scenarios with different number of robots and different design considerations.\",\"PeriodicalId\":377212,\"journal\":{\"name\":\"2019 7th International Conference on Control, Mechatronics and Automation (ICCMA)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 7th International Conference on Control, Mechatronics and Automation (ICCMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCMA46720.2019.8988635\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 7th International Conference on Control, Mechatronics and Automation (ICCMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCMA46720.2019.8988635","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

仓库作业需要大量的劳动力和物理空间。目前,拥有大型仓库的公司正在投资自主机器人,以节省时间和精力,并防止人为错误。在多机器人移动的智能仓库中,由于其动态性,路径规划是最重要的挑战之一。本文为路径规划问题提供了一个完整且无错误的解决方案,并描述了其在不同机器人数量和不同设计考虑的各种仓库场景中的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Path Planning for Multiple Mobile Robots in Smart Warehouse
Warehouse operations need high labor force and physical space. Currently, companies with huge warehouses are investing on autonomous robots to save time and energy, and to prevent human-based errors. One of the most important challenges in a smart warehouse with multiple moving robots is path planning because of its dynamics. This paper provides a complete and error-free solution to the path-planning problem, and describes its performance in various warehouse scenarios with different number of robots and different design considerations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信