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: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.
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.
The paper introduces Pivot-and-Station Multi-Agent Path Finding (PS‑MAPF), a variant of MAPF where a subset of agents must visit interchangeable pivots before all agents occupy anonymous stations. It provides a full solvability characterization: every instance on a 2‑edge‑connected graph is solvable, and for arbitrary connected graphs a structural effective‑distance measure relative to unoccupied vertices gives a necessary and sufficient condition. The authors prove that minimizing station‑makespan or station‑flowtime is NP‑hard even with a single pivot, and present three algorithms—a complete baseline, a SAT‑based optimal solver, and Pivot‑Prioritized Planning (PPP), which solves 74‑89% of benchmark instances with significantly lower makespan and flowtime than the baseline.
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:2606. 15797v1 Announce Type: new Abstract: Compilation-based techniques represent an important stream of solvers for multi-agent path finding (MAPF) due to their modularity and adaptability for non-standard variants of the problem.
arXiv:2608. 15175v1 Announce Type: cross Abstract: Uncrewed aerial vehicles (UAVs) are increasingly deployed for autonomous navigation in complex outdoor environments, where dynamic conditions and mission requirements require intelligent adaptive decision-making.
The paper presents an active inference route‑planning method for autonomous agents tasked with reconnaissance missions. It builds an evidence map that integrates both positive and negative sensor observations over time, using Dempster‑Shafer theory and a Gaussian sensor model to update a posterior probability distribution. By computing variational free energy across positions, the agent moves incrementally toward locations that minimize free energy, balancing exploration of large areas with exploitation of identified targets.
arXiv:2608. 19964v1 Announce Type: new Abstract: Autonomous driving systems must operate under partial observability, where safety-critical objects may be occluded or visible only to neighboring connected vehicles.
Mobile robots that operate in side by side with humans and critical facilities must reach their goals at low cost, despite often unknown true traversal costs of the map apriori and imperfect actuation...
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...
arXiv:2606. 18888v1 Announce Type: new Abstract: Navigation in partially observable environments presents a significant challenge for autonomous agents, requiring effective decision-making with limited sensory information in unknown environments.