A Job-Assignment Heuristic for Lifelong Multi-Agent Path Finding Problem with Multiple Delivery Locations
arXiv:2003.07108v2
AI Analysis
This work addresses job assignment in multi-agent systems for delivery tasks, but it appears incremental as it compares existing heuristics without introducing a fundamentally new approach.
The paper tackled the problem of assigning jobs to agents in lifelong multi-agent path finding with multiple delivery locations, and the result was the identification of the best performing heuristic among several proposed methods for generating low-total-cost solutions.
In this paper we proposed multiple job-assignment heuristics to generate low-total-cost solutions and determine the best performing method amongst them.