The task assignment problem of robots in a smart warehouse environment （TARSWE） based on cargo-to-person is investigated. Firstly, the sites of warehouse robots and the order picking tasks are given and the task ass...The task assignment problem of robots in a smart warehouse environment （TARSWE） based on cargo-to-person is investigated. Firstly, the sites of warehouse robots and the order picking tasks are given and the task assignment problem for picking one order is formulated into a mathematical model to minimize the total operation cost. Then a heuristic algorithm is designed to solve the task assignment problem for picking multiple orders. Finally, simulations are done by using the orders data of online bookstore A. The results show that using the heuristic algorithm of this paper to assign robots, the cost was reduced by 2% and it can effectively avoid far route and unbalanced workload of robots. The feasibility and validity of the model and algorithm are verified. The model and algorithm in this paper provide a theoretical basis to solve the TARSWE.展开更多
In the smart warehousing system adopting cargo-to-person mode, all the items are stored in the movable shelves. There are some warehouse robots transporting the shelves to the working platforms for completing order pi...In the smart warehousing system adopting cargo-to-person mode, all the items are stored in the movable shelves. There are some warehouse robots transporting the shelves to the working platforms for completing order picking or items replenishment tasks. When the number of robots is insufficient, the task allocation problem of robots is an important issue in designing the warehousing system. In this paper, the task allocation problem of insufficient warehouse robots (TAPIR) is investigated. Firstly, the TAPIR problem is decomposed into three sub-problems: task grouping problem, task scheduling problem and task balanced allocation problem. Then three sub-problems are respectively formulated into integer programming models, and the corresponding heuristic algorithms for solving three sub-problems are designed. Finally, the simulation and analysis are done on the real data of online bookstore. Simulation results show that the mathematical models and algorithms of this paper can provide a theoretical basis for solving the TAPIR problem.展开更多
In this paper we provide a tutorial on the background of warehouse automation using robotic networks and survey relevant work in the literature.We present a new cyber-physical control method that achieves safe,deadloc...In this paper we provide a tutorial on the background of warehouse automation using robotic networks and survey relevant work in the literature.We present a new cyber-physical control method that achieves safe,deadlock-free,efficient,and adaptive behavior of multiple robots serving the goods-to-man logistic operations.A central piece of this method is the incremental supervisory control design algorithm,which is computationally scalable with respect to the number of robots.Finally,we provide a case study on 30 robots with changing conditions to demonstrate the effectiveness of the proposed method.展开更多
With the rapid development of warehouse robots in logistics and other industries,research on their path planning has become increasingly important.Based on the analysis of various conflicts that occur when the warehou...With the rapid development of warehouse robots in logistics and other industries,research on their path planning has become increasingly important.Based on the analysis of various conflicts that occur when the warehouse robot travels,this study proposes a two-level vehicle path planning model for multi-warehouse robots,which integrates static and dynamic planning to improve operational efficiency and reduce operating costs.In the static phase,the blockage factor is introduced to enhance the ant colony optimization(ACO)algorithm as a negative feedback mechanism to effectively avoid the blockage nodes during movement.In the dynamic stage,a dynamic priority mechanism is designed to adjust the routing strategy in real time and give the optimal path according to the real situation.To evaluate the model’s effectiveness,simulations were performed under different operating environments and application strategies based on an actual grid environment map.The simulation results confirm that the proposed model outperforms other methods in terms of average running distance,number of blocked nodes,percentage of replanned paths,and average running time,showing great potential in optimizing warehouse operations.展开更多
基金Project Supported： National Natural Science Foundation of China （11131009, 71540028, F012408）, Funding Project for Academic Human Resources Development in Institutions of Higher Learning Under the Jurisdiction of Beijing Municipality （CIT＆TCD20130327）, and major research project of Beijing Wuzi University.
文摘The task assignment problem of robots in a smart warehouse environment （TARSWE） based on cargo-to-person is investigated. Firstly, the sites of warehouse robots and the order picking tasks are given and the task assignment problem for picking one order is formulated into a mathematical model to minimize the total operation cost. Then a heuristic algorithm is designed to solve the task assignment problem for picking multiple orders. Finally, simulations are done by using the orders data of online bookstore A. The results show that using the heuristic algorithm of this paper to assign robots, the cost was reduced by 2% and it can effectively avoid far route and unbalanced workload of robots. The feasibility and validity of the model and algorithm are verified. The model and algorithm in this paper provide a theoretical basis to solve the TARSWE.
文摘In the smart warehousing system adopting cargo-to-person mode, all the items are stored in the movable shelves. There are some warehouse robots transporting the shelves to the working platforms for completing order picking or items replenishment tasks. When the number of robots is insufficient, the task allocation problem of robots is an important issue in designing the warehousing system. In this paper, the task allocation problem of insufficient warehouse robots (TAPIR) is investigated. Firstly, the TAPIR problem is decomposed into three sub-problems: task grouping problem, task scheduling problem and task balanced allocation problem. Then three sub-problems are respectively formulated into integer programming models, and the corresponding heuristic algorithms for solving three sub-problems are designed. Finally, the simulation and analysis are done on the real data of online bookstore. Simulation results show that the mathematical models and algorithms of this paper can provide a theoretical basis for solving the TAPIR problem.
基金Project supported by JSPS KAKENHI(No.JP16K18122)。
文摘In this paper we provide a tutorial on the background of warehouse automation using robotic networks and survey relevant work in the literature.We present a new cyber-physical control method that achieves safe,deadlock-free,efficient,and adaptive behavior of multiple robots serving the goods-to-man logistic operations.A central piece of this method is the incremental supervisory control design algorithm,which is computationally scalable with respect to the number of robots.Finally,we provide a case study on 30 robots with changing conditions to demonstrate the effectiveness of the proposed method.
基金funded by the Basic and Applied Research Foundation of Guangdong Province(2020A1515111024).
文摘With the rapid development of warehouse robots in logistics and other industries,research on their path planning has become increasingly important.Based on the analysis of various conflicts that occur when the warehouse robot travels,this study proposes a two-level vehicle path planning model for multi-warehouse robots,which integrates static and dynamic planning to improve operational efficiency and reduce operating costs.In the static phase,the blockage factor is introduced to enhance the ant colony optimization(ACO)algorithm as a negative feedback mechanism to effectively avoid the blockage nodes during movement.In the dynamic stage,a dynamic priority mechanism is designed to adjust the routing strategy in real time and give the optimal path according to the real situation.To evaluate the model’s effectiveness,simulations were performed under different operating environments and application strategies based on an actual grid environment map.The simulation results confirm that the proposed model outperforms other methods in terms of average running distance,number of blocked nodes,percentage of replanned paths,and average running time,showing great potential in optimizing warehouse operations.
