Omniveyor:一个由强化学习驱动的组装物流分拣系统

IF 6.4 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Mingrui Yin;Hao Zhang;Chenxin Cai;Meiyan Liang;Jie Liu
{"title":"Omniveyor:一个由强化学习驱动的组装物流分拣系统","authors":"Mingrui Yin;Hao Zhang;Chenxin Cai;Meiyan Liang;Jie Liu","doi":"10.1109/TASE.2025.3540511","DOIUrl":null,"url":null,"abstract":"To improve logistics efficiency, smart logistics sorting is an inevitable trend in logistics development. Existing smart logistics sorting systems suffer from high construction costs or limited scalability. To solve these problems, we design a brand-new two-dimensional conveyor system called Omniveyor, which transports and sorts high-density packages within a limited space. It is assembled from multiple repetitive square conveyor modules, achieving the goal of cost-effectiveness and easy maintenance. To realize automatic sorting, we model the planning problem on Omniveyor and propose a scheduling strategy named MMPPO by reinforcement learning. Unlike traditional path planning, MMPPO assigns actions to modules rather than packages, which reduces scheduling overhead in high-throughput scenarios. Furthermore, we develop a simulation environment to inspect the effectiveness of our method, which solves an intractable package-following problem that has plagued simulation implementation in this field. Experimental results show that MMPPO outperforms baselines in terms of throughput and overall consumption at high densities. Besides, we implement a physical prototype of Omniveyor to validate its feasibility. Note to Practitioners—The motivation of the paper is to solve the sorting problems in the logistics system. Existing logistics sorting systems often have problems such as low sorting efficiency and high costs, making them unsuitable for small-sized warehouses. In this paper, we present a modular 2D desktop logistics system that is both scalable and efficient for sorting. We mathematically describe the platform package transportation process and propose an algorithm that addresses scheduling and planning problems, capable of continuous planning under pipeline input. Preliminary simulation tests indicate that our approach is feasible, and we have also built a small-scale prototype. In future research, we will further expand the scale of the platform and conduct research.","PeriodicalId":51060,"journal":{"name":"IEEE Transactions on Automation Science and Engineering","volume":"22 ","pages":"11982-11995"},"PeriodicalIF":6.4000,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Omniveyor: An Assembled Logistics Sorting System Powered by Reinforcement Learning\",\"authors\":\"Mingrui Yin;Hao Zhang;Chenxin Cai;Meiyan Liang;Jie Liu\",\"doi\":\"10.1109/TASE.2025.3540511\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To improve logistics efficiency, smart logistics sorting is an inevitable trend in logistics development. Existing smart logistics sorting systems suffer from high construction costs or limited scalability. To solve these problems, we design a brand-new two-dimensional conveyor system called Omniveyor, which transports and sorts high-density packages within a limited space. It is assembled from multiple repetitive square conveyor modules, achieving the goal of cost-effectiveness and easy maintenance. To realize automatic sorting, we model the planning problem on Omniveyor and propose a scheduling strategy named MMPPO by reinforcement learning. Unlike traditional path planning, MMPPO assigns actions to modules rather than packages, which reduces scheduling overhead in high-throughput scenarios. Furthermore, we develop a simulation environment to inspect the effectiveness of our method, which solves an intractable package-following problem that has plagued simulation implementation in this field. Experimental results show that MMPPO outperforms baselines in terms of throughput and overall consumption at high densities. Besides, we implement a physical prototype of Omniveyor to validate its feasibility. Note to Practitioners—The motivation of the paper is to solve the sorting problems in the logistics system. Existing logistics sorting systems often have problems such as low sorting efficiency and high costs, making them unsuitable for small-sized warehouses. In this paper, we present a modular 2D desktop logistics system that is both scalable and efficient for sorting. We mathematically describe the platform package transportation process and propose an algorithm that addresses scheduling and planning problems, capable of continuous planning under pipeline input. Preliminary simulation tests indicate that our approach is feasible, and we have also built a small-scale prototype. In future research, we will further expand the scale of the platform and conduct research.\",\"PeriodicalId\":51060,\"journal\":{\"name\":\"IEEE Transactions on Automation Science and Engineering\",\"volume\":\"22 \",\"pages\":\"11982-11995\"},\"PeriodicalIF\":6.4000,\"publicationDate\":\"2025-02-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Automation Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10879269/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Automation Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10879269/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

为了提高物流效率,智能物流分拣是物流发展的必然趋势。现有的智能物流分拣系统存在建设成本高或可扩展性有限的问题。为了解决这些问题,我们设计了一种全新的二维输送系统Omniveyor,它可以在有限的空间内输送和分拣高密度的包裹。它由多个重复的方形输送机模块组装而成,达到了成本效益高、维护方便的目的。为了实现自动排序,我们在Omniveyor上对规划问题进行建模,并提出了一种基于强化学习的MMPPO调度策略。与传统的路径规划不同,MMPPO将操作分配给模块而不是包,这减少了高吞吐量场景中的调度开销。此外,我们开发了一个仿真环境来检验我们的方法的有效性,解决了困扰该领域仿真实现的棘手的包跟踪问题。实验结果表明,在高密度情况下,MMPPO在吞吐量和总体消耗方面优于基线。此外,我们还实现了Omniveyor的物理原型,以验证其可行性。给从业者的说明——本文的动机是为了解决物流系统中的分拣问题。现有的物流分拣系统往往存在分拣效率低、成本高等问题,不适合小型仓库。在本文中,我们提出了一个模块化的二维桌面物流系统,既可扩展又高效的分拣。我们用数学方法描述了平台包裹运输过程,并提出了一种解决调度和规划问题的算法,能够在管道输入下进行连续规划。初步的模拟试验表明,我们的方法是可行的,我们也建立了一个小规模的原型。在未来的研究中,我们将进一步扩大平台规模,开展研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Omniveyor: An Assembled Logistics Sorting System Powered by Reinforcement Learning
To improve logistics efficiency, smart logistics sorting is an inevitable trend in logistics development. Existing smart logistics sorting systems suffer from high construction costs or limited scalability. To solve these problems, we design a brand-new two-dimensional conveyor system called Omniveyor, which transports and sorts high-density packages within a limited space. It is assembled from multiple repetitive square conveyor modules, achieving the goal of cost-effectiveness and easy maintenance. To realize automatic sorting, we model the planning problem on Omniveyor and propose a scheduling strategy named MMPPO by reinforcement learning. Unlike traditional path planning, MMPPO assigns actions to modules rather than packages, which reduces scheduling overhead in high-throughput scenarios. Furthermore, we develop a simulation environment to inspect the effectiveness of our method, which solves an intractable package-following problem that has plagued simulation implementation in this field. Experimental results show that MMPPO outperforms baselines in terms of throughput and overall consumption at high densities. Besides, we implement a physical prototype of Omniveyor to validate its feasibility. Note to Practitioners—The motivation of the paper is to solve the sorting problems in the logistics system. Existing logistics sorting systems often have problems such as low sorting efficiency and high costs, making them unsuitable for small-sized warehouses. In this paper, we present a modular 2D desktop logistics system that is both scalable and efficient for sorting. We mathematically describe the platform package transportation process and propose an algorithm that addresses scheduling and planning problems, capable of continuous planning under pipeline input. Preliminary simulation tests indicate that our approach is feasible, and we have also built a small-scale prototype. In future research, we will further expand the scale of the platform and conduct research.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Automation Science and Engineering
IEEE Transactions on Automation Science and Engineering 工程技术-自动化与控制系统
CiteScore
12.50
自引率
14.30%
发文量
404
审稿时长
3.0 months
期刊介绍: The IEEE Transactions on Automation Science and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. T-ASE welcomes results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, security, service, supply chains, and transportation. T-ASE addresses a research community willing to integrate knowledge across disciplines and industries. For this purpose, each paper includes a Note to Practitioners that summarizes how its results can be applied or how they might be extended to apply in practice.
×
引用
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学术官方微信