Browse State-of-the-Art › Multi-Agent Path Finding
Multi-Agent Path Finding
38 papers with code · 0 benchmarks · 2 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
2 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
30 shown of 38 papers with code (140 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
2 Feb 2024 2 repositories listedIn this work, we introduce the guidance graph as a versatile representation of guidance for lifelong MAPF, framing Guidance Graph Optimization as the task of optimizing its edge weights.
-
24 Feb 2021 2 repositories listedSolving the Multi-Agent Path Finding (MAPF) problem optimally is known to be NP-Hard for both make-span and total arrival time minimization.
-
2 Feb 2021 2 repositories listedOne example of subdimensional expansion, when applied to A*, is called M* and M* was limited to a single objective function.
-
24 Jan 2021 2 repositories listedConflict-Based Search (CBS) is a powerful algorithmic framework for optimally solving classical multi-agent path finding (MAPF) problems, where time is discretized into the time steps.
-
11 Jan 2021 2 repositories listedNaively applying existing multi-objective search algorithms, such as multi-objective A* (MOA*), to multi-agent path finding may prove to be inefficient as the dimensionality of the search space grows exponentially with…
-
4 Mar 2025 1 repository listedWhile effective, traditional focal search faces a limitation: the lower bound (LB) value determining which nodes enter the FOCAL list often increases slowly in early search stages, resulting in a constrained search…
-
10 Feb 2025 1 repository listedTo tackle this challenge, we introduce a new framework that applies sheaf theory to decentralized deep reinforcement learning, enabling agents to learn geometric cross-dependencies between each other through local…
-
18 Jan 2025 1 repository listedThis article presents an approach for prioritization in PP to reduce the longest path length in the coupling DAG and thus the computation time for MAPF using PP.
-
18 Jan 2025 1 repository listedAlbeit a computationally efficient approach for MAPF, the solution quality strongly depends on the prioritization.
-
17 Dec 2024 1 repository listedWe further extend MASS using an adaptive window mechanism to address the lifelong MAMP problem.
-
16 Dec 2024 1 repository listedOnly a few algorithms were developed to address asynchronous actions, and they all lie on one end of the spectrum, focusing on finding optimal solutions with limited scalability.
-
3 Nov 2024 1 repository listedWe study Multi-Robot Coverage Path Planning (MCPP) on a 4-neighbor 2D grid G, which aims to compute paths for multiple robots to cover all cells of G.
-
22 Oct 2024 1 repository listedWhen considering the shape and size of agents in MAPF, the computational complexity increases significantly as the number of agents grows, primarily due to the increased overhead in conflict detection between geometric…
-
6 Aug 2024 1 repository listedAnytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in multi-agent systems.
-
30 Apr 2024 1 repository listedHowever, this paper demonstrates that the methods based on DVS cannot always obtain the optimal solution.
-
24 Apr 2024 1 repository listedWe present future directions such as developing more competitive rule-based and anytime MAPF algorithms and parallelizing state-of-the-art MAPF algorithms.
-
ITA-ECBS: A Bounded-Suboptimal Algorithm for the Combined Target-Assignment and Path-Finding Problem8 Apr 2024 1 repository listedThe Combined Target-Assignment and Path-Finding (TAPF) problem, a variant of MAPF, requires one to simultaneously assign targets to agents and plan collision-free paths for agents.
-
26 Mar 2024 1 repository listedOne area of research in multi-agent path finding is to determine how replanning can be efficiently achieved in the case of agents being delayed during execution.
-
20 Mar 2024 1 repository listedIn this paper, we present a novel mechanism named Caching-Augmented Lifelong MAPF (CAL-MAPF), designed to improve the performance of Lifelong MAPF.
-
12 Mar 2024 1 repository listedTo further improve the performance of the communication-based MARL-MAPF solvers, we propose a new method, Ensembling Prioritized Hybrid Policies (EPH).
-
1 Feb 2024 1 repository listedAnticipating possible future deployment of connected and automated vehicles (CAVs), cooperative autonomous driving at intersections has been studied by many works in control theory and intelligent transportation across…
-
30 Jan 2024 1 repository listed Syntology ran 3 of 3 samples · 0 unverified · 3 pointer-only (licence)Multi-Agent Path Finding (MAPF) involves determining paths for multiple agents to travel simultaneously and collision-free through a shared area toward given goal locations.
-
28 Dec 2023 1 repository listedState-of-the-art anytime MAPF is based on Large Neighborhood Search (LNS), where a fast initial solution is iteratively optimized by destroying and repairing a fixed number of parts, i.
-
22 Aug 2023 1 repository listedTo tackle this issue, we propose a new approach for MAPF where agents are guided to their destination by following congestion-avoiding paths.
-
5 Jul 2023 1 repository listedTo tackle this challenge, we propose a multi-agent actor-critic method called Soft Actor-Critic with Heuristic-Based Attention (SACHA), which employs novel heuristic-based attention mechanisms for both the actors and…
-
10 May 2023 1 repository listedWe show that, even with state-of-the-art MAPF algorithms, commonly used human-designed layouts can lead to congestion for warehouses with large numbers of robots and thus have limited scalability.
-
24 Oct 2022 1 repository listedIn recent years, Multi-Agent Path Finding (MAPF) has attracted attention from the fields of both Operations Research (OR) and Reinforcement Learning (RL).
-
24 Jun 2022 1 repository listedThe proposed distributed algorithm: fuzzy self-organizing cooperative coevolution (FSC2) is then leveraged to resolve the three challenges in multi-target SOP: distributed self-organizing search (SOS), distributed task…
-
9 Feb 2022 1 repository listedTherefore, a solution to one query informs the next query, which leads to similarity with respect to the agents' start and goal positions, and how collisions need to be resolved from one query to the next.
-
8 Feb 2022 1 repository listedThe learning-based, fully decentralized framework has been introduced to alleviate real-time problems and simultaneously pursue optimal planning policy.
Syntology lines on 1 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections