Coordinating Large-Scale Robot Networks with Motion and Communication Uncertainties for Logistics Applications

In this paper, we focus on the problem of task allocation, cooperative path planning and motion coordination of the large-scale system with thousands of robots, aiming for practical applications in robotic warehouses and automated logistics systems. Particularly, we solve the life-long planning problem and guarantee the coordination performance of large-scale robot network in the presence of robot motion uncertainties and communication failures. A hierarchical planning and coordination structure is presented. The environment is divided into several sectors and a dynamic traffic heat-map is generated to describe the current sector-level traffic flow. In task planning level, a greedy task allocation method is implemented to assign the current task to the nearest free robot and the sector-level path is generated by comprehensively considering the traveling distance, the traffic heat-value distribution and the current robot/communication failures. In motion coordination level, local cooperative A* algorithm is implemented in each sector to generate the collision-free road-level path of each robot in the sector and the rolling planning structure is introduced to solve problems caused by motion and communication uncertainties. The effectiveness and practical applicability of the proposed approach are validated by large-scale simulations with more than one thousand robots and real laboratory experiments.

[1]  Zdenko Kovacic,et al.  Time Windows Based Dynamic Routing in Multi-AGV Systems , 2010, IEEE Transactions on Automation Science and Engineering.

[2]  Zhe Liu,et al.  An Incidental Delivery Based Method for Resolving Multirobot Pairwised Transportation Problems , 2016, IEEE Transactions on Intelligent Transportation Systems.

[3]  Manuela M. Veloso,et al.  Online pickup and delivery planning with transfers for mobile robots , 2013, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[4]  Nathan R. Sturtevant,et al.  Conflict-based search for optimal multi-agent pathfinding , 2012, Artif. Intell..

[5]  Sven Koenig,et al.  Multi-Agent Path Finding with Delay Probabilities , 2016, AAAI.

[6]  Raffaello D'Andrea,et al.  Adaptive Highways on a Grid , 2009, ISRR.

[7]  Sven Koenig,et al.  Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks , 2017, AAMAS.

[8]  Lorenzo Sabattini,et al.  Ensemble Coordination Approach in Multi-AGV Systems Applied to Industrial Warehouses , 2015, IEEE Transactions on Automation Science and Engineering.

[9]  Yi Shen,et al.  A Self-Repairing Algorithm With Optimal Repair Path for Maintaining Motion Synchronization of Mobile Robot Network , 2020, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[10]  Steven M. LaValle,et al.  Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics , 2015, IEEE Transactions on Robotics.

[11]  Dinesh Manocha,et al.  Reciprocal n-Body Collision Avoidance , 2011, ISRR.

[12]  Raffaello D'Andrea,et al.  Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses , 2007, AI Mag..

[13]  Eric Guizzo,et al.  Three Engineers, Hundreds of Robots, One Warehouse , 2008, IEEE Spectrum.

[14]  Paul Levi,et al.  Cooperative Multi-Robot Path Planning by Heuristic Priority Adjustment , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[15]  Michal Cáp,et al.  Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots , 2014, IEEE Transactions on Automation Science and Engineering.

[16]  Ariel Felner,et al.  Conflict-Oriented Windowed Hierarchical Cooperative A∗ , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[17]  Sven Koenig,et al.  Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem , 2016, AAAI.