The paper proposes a method that allows agents in multi‑agent motion planning to compute with multiple prioritizations simultaneously, avoiding reliance on domain‑specific heuristics or costly iterative searches. This general approach is applied to receding‑horizon motion planning with system dynamics, and numerical experiments show near‑optimal prioritization and performance gains over state‑of‑the‑art methods with only a slight increase in computation time. Real‑time feasibility is demonstrated on a road network with ten vehicles in a Cyber‑Physical Mobility Lab.
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.
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.
arXiv:2607. 21488v1 Announce Type: cross Abstract: Coordinating autonomous vehicles at unsignalized intersections remains a critical challenge for multi-agent reinforcement learning (MARL) systems, which typically struggle with combinatorial action spaces, reliance on privileged information, or rigid agent designs.
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: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.
MAPF-World introduces an autoregressive action world model for multi‑agent path finding that predicts short‑horizon local observations and neighboring agents’ action intentions, enabling decisions beyond immediate local views. The model incorporates a spatio‑agent positional encoding within Transformer architectures to enhance spatial awareness and agent semantics, fostering coordinated behaviors. Experiments on diverse maps, including a new automated map generator based on real‑world urban layouts, show that MAPF‑World outperforms existing learned solvers, achieving strong performance, robust zero‑shot generalization, and high success rates even at high agent densities.
The paper introduces Belief-Aware Multi-Agent Path Finding under Map Uncertainty, addressing the challenge that real-world environments can change unexpectedly. It proposes MAGIC, a framework that uses a Gaussian Markov Random Field and Gaussian Belief Propagation to update a shared belief about traversability online, allowing agents to infer the state of nearby unobserved locations. Experiments on standard MAPF benchmarks show that MAGIC reduces the executed sum of costs on 96.3% of instances, outperforming existing approaches across various planner families and large agent teams.
arXiv:2608.29490v1 Announce Type: cross Abstract: Multi-agent systems in the real-world (e.g., drone swarms, autonomous cars, warehouse robots) must satisfy rich, temporal tasks while avoiding collis...
The paper introduces the concept of any-start-time planning, addressing scenarios where the set of feasible states or actions changes over time, such as path planning among moving obstacles or train boarding. It presents a new data structure, the compound arrival time function (cATF), which compactly encodes the optimal plan as a function of start time and can be assembled via heuristic graph search. Experiments on the SIPP problem demonstrate that any-start-time algorithms using cATFs outperform traditional replanning approaches on difficult instances.
Multi-agent path planning (MAPP) in continuous environments often relies on roadmaps to balance safety and search efficiency. However, traditional roadmap generation methods, such as lattice grids or...
arXiv:2609.35965v1 Announce Type: cross Abstract: Vision-and-Language Navigation (VLN) has largely focused on a single agent following a single instruction, yet many real-world applications require t...