Reinforcement Learning for Large-Scale Lifelong Multi-Agent Path Finding with Shared Spatial Fields
The authors propose an end-to-end average-reward RL policy for lifelong multi-agent path finding that computes a shared spatial field over the map once per timestep, then uses a goal-conditioned route operator and a destination allocation (Sinkhorn) step to decide agent movements. Trained without planner demonstrations or an online planner, it transfers to larger unseen layouts and populations, matching or exceeding best baselines across six 10,000-agent layouts while running in under 10 ms per step.
