arXiv:2608. 06702v1 Announce Type: cross Abstract: Lifelong Multi-Agent Path Finding (LMAPF) requires generating collision-free paths for large agent fleets under strict real-time constraints.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
arXiv:2603. 23405v2 Announce Type: replace-cross Abstract: Modern Multi-Agent Path Finding (MAPF) algorithms must plan for hundreds to thousands of agents in congested environments within a second, requiring highly efficient algorithms.
The paper presents a theoretical analysis of the Rolling‑Horizon Collision Resolution (RHCR) framework for Lifelong Multi‑Agent Path Finding (L‑MAPF), proving its near‑optimality in a discounted MDP setting. Building on this, the authors introduce Group Decentralized RHCR (GD‑RHCR), which partitions agents via a transitive communication scheme and plans each partition in parallel, achieving similar optimality guarantees while reducing per‑plan computational cost. Experiments across various maps demonstrate that GD‑RHCR scales to higher agent counts with high throughput and lower cost compared to vanilla RHCR.
arXiv:2609.39559v1 Announce Type: new Abstract: In this work we study the problem of MAPFC, a post-optimization step for Multi-Agent Path Finding (MAPF) plans where we are given a feasible plan produ...
arXiv:2510. 05592v2 Announce Type: replace Abstract: Outcome-driven reinforcement learning has advanced reasoning in large language models (LLMs), but prevailing tool-augmented approaches train a single, monolithic policy that interleaves thoughts and tool calls under full context; this scales poorly with long horizons and diverse tools and generalizes weakly to new scenarios.
arXiv:2607. 00444v1 Announce Type: cross Abstract: Spatiotemporal motion planning, especially in multi-robot settings, requires robots to reason about collision-free regions that change over time, which is challenging in continuous spaces when feasible regions are transient and geometrically constrained.
arXiv:2609.38108v1 Announce Type: new Abstract: Large language models (LLMs) enable agents to solve long-horizon tasks by generating a plan and then executing it in an environment. However, successfu...