GRAND: Guidance, Rebalancing, and Assignment for Networked Dispatch in Multi-Agent Path Finding
The paper proposes GRAND, a hybrid hierarchical algorithm that combines reinforcement learning-based graph guidance with minimum-cost flow rebalancing and local assignment to achieve up to 10% higher throughput than state-of-the-art schedulers for large-scale, lifelong multi-agent pickup-and-delivery tasks while maintaining real-time execution.