MARPF: Multi-Agent and Multi-Rack Path Finding (2403.12376v3)
Abstract: In environments where many automated guided vehicles (AGVs) operate, planning efficient, collision-free paths is essential. Related research has mainly focused on environments with pre-defined passages, resulting in space inefficiency. We attempt to relax this assumption. In this study, we define multi-agent and multi-rack path finding (MARPF) as the problem of planning paths for AGVs to convey target racks to their designated locations in environments without passages. In such environments, an AGV without a rack can pass under racks, whereas one with a rack cannot pass under racks to avoid collisions. MARPF entails conveying the target racks without collisions, while the obstacle racks are relocated to prevent any interference with the target racks. We formulated MARPF as an integer linear programming problem in a network flow. To distinguish situations in which an AGV is or is not loading a rack, the proposed method introduces two virtual layers into the network. We optimized the AGVs' movements to move obstacle racks and convey the target racks. The formulation and applicability of the algorithm were validated through numerical experiments. The results indicated that the proposed algorithm addressed issues in environments with dense racks.
- R. Stern, N. Sturtevant, A. Felner, S. Koenig, H. Ma, T. Walker, J. Li, D. Atzmon, L. Cohen, T. K. Kumar, R. Barták, and E. Boyarski, “Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks,” in Proceedings of the International Symposium on Combinatorial Search, vol. 10, 2019, pp. 151–158.
- P. R. Wurman, R. D’Andrea, and M. Mountz, “Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses.” AI Magazine, vol. 29, no. 1, pp. 9–20, 2008.
- W. Honig, S. Kiesel, A. Tinka, J. W. Durham, and N. Ayanian, “Persistent and Robust Execution of MAPF Schedules in Warehouses,” IEEE Robotics and Automation Letters, vol. 4, no. 2, pp. 1125–1131, 2019.
- J. Li, H. Zhang, M. Gong, Z. Liang, W. Liu, Z. Tong, L. Yi, R. Morris, C. Pasareanu, and S. Koenig, “Scheduling and Airport Taxiway Path Planning Under Uncertainty,” in Proceedings of the 2019 Aviation and Aeronautics Forum and Exposition, 2019, pp. 1–8.
- A. Okoso, K. Otaki, S. Koide, and T. Nishi, “High Density Automated Valet Parking via Multi-agent Path Finding,” in 2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC), 2022, pp. 2146–2153.
- B. Li and H. Ma, “Double-Deck Multi-Agent Pickup and Delivery: Multi-Robot Rearrangement in Large-Scale Warehouses,” IEEE Robotics and Automation Letters, pp. 1–8, 2023.
- P. Bachor, R.-D. Bergdoll, and B. Nebel, “The Multi-Agent Transportation Problem,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, 2023, pp. 11 525–11 532.
- W. W. Johnson and W. E. Story, “Notes on the “15” Puzzle,” American Journal of Mathematics, vol. 2, no. 4, pp. 397–404, 1879.
- G. Sharon, R. Stern, A. Felner, and N. R. Sturtevant, “Conflict-based search for optimal multi-agent pathfinding,” Artificial Intelligence, vol. 219, pp. 40–66, 2015.
- E. Boyarski, A. Felner, R. Stern, G. Sharon, O. Betzalel, D. Tolpin, and E. Shimony, “ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding,” in Proceedings of the International Symposium on Combinatorial Search, vol. 6, 2015, pp. 223–225.
- M. Barer, G. Sharon, R. Stern, and A. Felner, “Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem,” in Proceedings of the International Symposium on Combinatorial Search, vol. 5, 2014, pp. 19–27.
- D. Silver, “Cooperative Pathfinding,” in Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, vol. 1, 2005, pp. 117–122.
- F. Grenouilleau, W.-J. van Hoeve, and J. N. Hooker, “A Multi-Label A* Algorithm for Multi-Agent Pathfinding,” in Proceedings of the International Conference on Automated Planning and Scheduling, vol. 29, 2021, pp. 181–185.
- H. Ma, J. Li, T. K. S. Kumar, and S. Koenig, “Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks,” in Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, 2017, pp. 837–845.
- J. Yu and S. M. LaValle, “Planning Optimal Paths for Multiple Robots on Graphs,” in 2013 IEEE International Conference on Robotics and Automation, 2013, pp. 3612–3617.