Multi-Agent Path Finding with Real Robot Dynamics and Interdependent Tasks for Automated Warehouses
Abstract: Multi-Agent Path Finding (MAPF) is an important optimization problem underlying the deployment of robots in automated warehouses and factories. Despite the large body of work on this topic, most approaches make heavy simplifications, both on the environment and the agents, which make the resulting algorithms impractical for real-life scenarios. In this paper, we consider a realistic problem of online order delivery in a warehouse, where a fleet of robots bring the products belonging to each order from shelves to workstations. This creates a stream of inter-dependent pickup and delivery tasks and the associated MAPF problem consists of computing realistic collision-free robot trajectories fulfilling these tasks. To solve this MAPF problem, we propose an extension of the standard Prioritized Planning algorithm to deal with the inter-dependent tasks (Interleaved Prioritized Planning) and a novel Via-Point Star (VP*) algorithm to compute an optimal dynamics-compliant robot trajectory to visit a sequence of goal locations while avoiding moving obstacles. We prove the completeness of our approach and evaluate it in simulation as well as in a real warehouse.
- Improved Anonymous Multi-Agent Path Finding Algorithm. Proceedings of the AAAI Conference on Artificial Intelligence, 38(16):17291–17298, 2024.
- Solution Algorithms for the Bounded Acceleration Shortest Path Problem. IEEE Transactions on Automatic Control, 68(3):1910–1917, 2023.
- Robust Multi-Agent Path Finding. Proceedings of the International Symposium on Combinatorial Search, 9(1):2–9, 2018.
- Predictive Control for Linear and Hybrid Systems. Higher Education from Cambridge University Press, 2017.
- A Multiagent Approach to Autonomous Intersection Management. Journal of Artificial Intelligence Research, 31:591–656, 2008.
- Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. Proceedings of the International Symposium on Combinatorial Search, 8(1):29–37, 2017.
- Collision Detection between Geometric Models: A Survey. In Proceedings of IMA conference on mathematics of surfaces, 1998.
- A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100–107, 1968.
- R. Haupt. A survey of priority rule-based scheduling. Operations-Research-Spektrum, 11(1):3–16, 1989.
- Multi-Agent Path Finding for UAV Traffic Management. In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pages 131–139, Richland, SC, 2019. International Foundation for Autonomous Agents and Multiagent Systems.
- Multi-Agent Path Finding with Kinematic Constraints. Proceedings of the International Conference on Automated Planning and Scheduling, 26:477–485, 2016.
- Persistent and Robust Execution of MAPF Schedules in Warehouses. IEEE Robotics and Automation Letters, 4(2):1125–1131, 2019.
- Multi-Agent Path Finding for Large Agents. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01):7627–7634, 2019.
- Moving Agents in Formation in Congested Environments. Proceedings of the International Symposium on Combinatorial Search, 11(1):131–132, 2020.
- Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. In Proceedings of the AAAI Conference on Artificial Intelligence, 35, pages 11272–11281, 2021.
- Intersection Coordination with Priority-Based Search for Autonomous Vehicles. Proceedings of the AAAI Conference on Artificial Intelligence, 37(10):11578–11585, 2023.
- Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS’17, page 837–845, Richland, SC, 2017. International Foundation for Autonomous Agents and Multiagent Systems.
- Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery. In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence. AAAI Press, 2019.
- Solving simultaneous target assignment and path planning efficiently with time-independent execution. Artificial Intelligence, 321:103946, 2023.
- David Silver. Cooperative Pathfinding. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 1(1):117–122, 2005.
- Trevor Standley. Finding Optimal Solutions to Cooperative Pathfinding Problems. Proceedings of the AAAI Conference on Artificial Intelligence, 24(1):173–178, 2010.
- Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. Proceedings of the International Symposium on Combinatorial Search, 10:151–158, 2021.
- Which MAPF Model Works Best for Automated Warehousing? Proceedings of the International Symposium on Combinatorial Search, 15(1):190–198, 2022.
- Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses. AI Magazine, 29(1):9–9, 2008.
- Planning Optimal Paths for Multiple Robots on Graphs. In Proceedings - 2013 IEEE International Conference on Robotics and Automation, pages 3612–3617, 2012.
- Efficient Multi Agent Path Finding with Turn Actions. Proceedings of the International Symposium on Combinatorial Search, 16(1):119–127, 2023.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.