A Conflict-Aware Optimal Goal Assignment Algorithm for Multi-Robot Systems (2402.13292v1)
Abstract: The fundamental goal assignment problem for a multi-robot application aims to assign a unique goal to each robot while ensuring collision-free paths, minimizing the total movement cost. A plausible algorithmic solution to this NP-hard problem involves an iterative process that integrates a task planner to compute the goal assignment while ignoring the collision possibilities among the robots and a multi-agent path-finding algorithm to find the collision-free trajectories for a given assignment. This procedure involves a method for computing the next best assignment given the current best assignment. A naive way of computing the next best assignment, as done in the state-of-the-art solutions, becomes a roadblock to achieving scalability in solving the overall problem. To obviate this bottleneck, we propose an efficient conflict-guided method to compute the next best assignment. Additionally, we introduce two more optimizations to the algorithm -- first for avoiding the unconstrained path computations between robot-goal pairs wherever possible, and the second to prevent duplicate constrained path computations for multiple robot-goal pairs. We extensively evaluate our algorithm for up to a hundred robots on several benchmark workspaces. The results demonstrate that the proposed algorithm achieves nearly an order of magnitude speedup over the state-of-the-art algorithm, showcasing its efficacy in real-world scenarios.
- It Costs to Get Costs! A Heuristic-Based Scalable Goal Assignment Algorithm for Multi-Robot Systems. In ICAPS, 2–10. AAAI Press.
- Algorithms for Finding k-Best Perfect Matchings. Discrete applied mathematics, 18(2): 155–165.
- Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery. IEEE Robotics and Automation Letters, 6(3): 5816–5823.
- OMCoRP: An Online Mechanism for Competitive Robot Prioritization. In ICAPS, 112–121.
- Eppstein, D. 2016. Encyclopedia of Algorithms, Chapter k-Best Enumeration. Springer, 680: 1003–1006.
- A Production-Line Assignment Problem. Santa Monica, California: The Rand Corporation.
- Fleets of robots for environmentally-safe pest control in agriculture. Precision Agriculture, 18: 574–614.
- Drone delivery systems: job assignment and dimensioning. Auton. Robots, 43(2): 261–274.
- Gross, O. 1959. The Bottleneck Assignment Problem. Technical Report P-1620, The Rand Corporation, Santa Monica, California.
- Conflict-Based Search with Optimal Task Assignment. In AAMAS, 757–765.
- Kuhn, H. W. 1955. The Hungarian Method for the Assignment Problem. Naval research logistics quarterly, 2(1-2): 83–97.
- Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. In AAAI, 11272–11281.
- Optimal Target Assignment and Path Finding for Teams of Agents. In AAMAS, 1144–1152.
- Murty, K. G. 1968. An Algorithm for Ranking all the Assignments in Order of Increasing Cost. Operations Research, 16(3): 682–687.
- Conflict-Based Search For Optimal Multi-Agent Path Finding. In AAAI, 563–569. AAAI Press.
- Conflict-Based Search for Optimal Multi-Agent Pathfinding. Artificial Intelligence, 219: 40–66.
- Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. SoCS, 151–158.
- Sturtevant, N. 2012. Benchmarks for Grid-Based Pathfinding. Transactions on Computational Intelligence and AI in Games, 4(2): 144 – 148.
- Multi-robot task allocation for fire-disaster response based on reinforcement learning. In 2009 International Conference on Machine Learning and Cybernetics, volume 4, 2312–2317.
- Concurrent assignment and planning of trajectories for large teams of interchangeable robots. In ICRA, 842–848.
- Goal Assignment and Trajectory Planning for Large Teams of Aerial Robots. In RSS. Berlin, Germany.
- Goal assignment and trajectory planning for large teams of interchangeable robots. Auton. Robots, 37(4): 401–415.
- Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs. Proceedings of the AAAI Conference on Artificial Intelligence, 27(1): 1443–1449.