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

Playing Games

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.

Papers archive 2025-07-28

archive papers tagged: 140 · with a code link: 38 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (1 of 140 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 2: papers 1 to 100 of 140, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.

  • 2 Feb 2024 2 repositories listed
    In 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 listed
    Solving 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 listed
    One 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 listed
    Conflict-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 listed
    Naively 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 listed
    While 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 listed
    To 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 listed
    This 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 listed
    Albeit a computationally efficient approach for MAPF, the solution quality strongly depends on the prioritization.
  • 17 Dec 2024 1 repository listed
    We further extend MASS using an adaptive window mechanism to address the lifelong MAMP problem.
  • 16 Dec 2024 1 repository listed
    Only 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 listed
    We 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 listed
    When 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 listed
    Anytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in multi-agent systems.
  • 30 Apr 2024 1 repository listed
    However, this paper demonstrates that the methods based on DVS cannot always obtain the optimal solution.
  • 24 Apr 2024 1 repository listed
    We present future directions such as developing more competitive rule-based and anytime MAPF algorithms and parallelizing state-of-the-art MAPF algorithms.
  • 8 Apr 2024 1 repository listed
    The 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 listed
    One 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 listed
    In 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 listed
    To 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 listed
    Anticipating 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…
  • 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 listed
    State-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. e., the neighborhood, of the…
  • 22 Aug 2023 1 repository listed
    To 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 listed
    To 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 listed
    We 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 listed
    In 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 listed
    The 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 listed
    Therefore, 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 listed
    The learning-based, fully decentralized framework has been introduced to alleviate real-time problems and simultaneously pursue optimal planning policy.
  • 17 Oct 2021 1 repository listed
  • 29 Sep 2021 1 repository listed
  • 12 Sep 2021 1 repository listed
  • 2 Aug 2021 1 repository listed
  • 21 Jun 2021 1 repository listed
  • 3 Oct 2020 1 repository listed
  • 15 May 2020 1 repository listed
  • 30 May 2017 1 repository listed
  • Enhancing Lifelong Multi-Agent Path-finding by Using Artificial Potential Fields
    28 May 2025 0 repositories listed
  • Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding
    25 May 2025 0 repositories listed
  • Multi-Agent Path Finding For Large Agents Is Intractable
    15 May 2025 0 repositories listed
  • Anytime Single-Step MAPF Planning with Anytime PIBT
    10 Apr 2025 0 repositories listed
  • Real-Time LaCAM
    8 Apr 2025 0 repositories listed
  • Prioritized Planning for Continuous-time Lifelong Multi-agent Pathfinding
    17 Mar 2025 0 repositories listed
  • RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks
    4 Mar 2025 0 repositories listed
  • A parallelizable variant of HCA*
    31 Jan 2025 0 repositories listed
  • Hybrid Quantum-Classical Multi-Agent Pathfinding
    24 Jan 2025 0 repositories listed
  • Enhancing Lifelong Multi-Agent Path Finding with Cache Mechanism
    6 Jan 2025 0 repositories listed
  • Multi-Agent Path Finding under Limited Communication Range Constraint via Dynamic Leading
    6 Jan 2025 0 repositories listed
  • Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models
    23 Dec 2024 0 repositories listed
  • Speedup Techniques for Switchable Temporal Plan Graph Optimization
    20 Dec 2024 0 repositories listed
  • Transient Multi-Agent Path Finding for Lifelong Navigation in Dense Environments
    5 Dec 2024 0 repositories listed
  • Multi-agent Path Finding for Timed Tasks using Evolutionary Games
    15 Nov 2024 0 repositories listed
  • Deploying Ten Thousand Robots: Scalable Imitation Learning for Lifelong Multi-Agent Path Finding
    28 Oct 2024 0 repositories listed
  • MFC-EQ: Mean-Field Control with Envelope Q-Learning for Moving Decentralized Agents in Formation
    15 Oct 2024 0 repositories listed
  • Windowed MAPF with Completeness Guarantees
    2 Oct 2024 0 repositories listed
  • Multi-agent Path Finding in Continuous Environment
    16 Sep 2024 0 repositories listed
  • Multi-agent Path Finding for Mixed Autonomy Traffic Coordination
    5 Sep 2024 0 repositories listed
  • Multi-Agent Path Finding with Real Robot Dynamics and Interdependent Tasks for Automated Warehouses
    26 Aug 2024 0 repositories listed
  • Algorithm Selection for Optimal Multi-Agent Path Finding via Graph Embedding
    16 Jun 2024 0 repositories listed
  • Accelerating Search-Based Planning for Multi-Robot Manipulation by Leveraging Online-Generated Experiences
    29 Mar 2024 0 repositories listed
  • Improving Learnt Local MAPF Policies with Heuristic Search
    29 Mar 2024 0 repositories listed
  • Routing and Scheduling in Answer Set Programming applied to Multi-Agent Path Finding: Preliminary Report
    18 Mar 2024 0 repositories listed
  • A Conflict-Aware Optimal Goal Assignment Algorithm for Multi-Robot Systems
    19 Feb 2024 0 repositories listed
  • Optimal Task Assignment and Path Planning using Conflict-Based Search with Precedence and Temporal Constraints
    13 Feb 2024 0 repositories listed
  • Why Solving Multi-agent Path Finding with Large Language Model has not Succeeded Yet
    8 Jan 2024 0 repositories listed
  • Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution
    30 Dec 2023 0 repositories listed
  • Improved Anonymous Multi-Agent Path Finding Algorithm
    17 Dec 2023 0 repositories listed
  • Optimizing Crowd-Aware Multi-Agent Path Finding through Local Communication with Graph Neural Networks
    19 Sep 2023 0 repositories listed
  • Selective Communication for Cooperative Perception in End-to-End Autonomous Driving
    26 May 2023 0 repositories listed
  • Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids
    25 May 2023 0 repositories listed
  • On Computing Universal Plans for Partially Observable Multi-Agent Path Finding
    25 May 2023 0 repositories listed
  • Tracking Progress in Multi-Agent Path Finding
    15 May 2023 0 repositories listed
  • Double-Deck Multi-Agent Pickup and Delivery: Multi-Robot Rearrangement in Large-Scale Warehouses
    27 Apr 2023 0 repositories listed
  • The Study of Highway for Lifelong Multi-Agent Path Finding
    9 Apr 2023 0 repositories listed
  • Robust Multi-Agent Pickup and Delivery with Delays
    30 Mar 2023 0 repositories listed
  • Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality
    20 Jan 2023 0 repositories listed
  • Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding
    20 Jan 2023 0 repositories listed
  • An Efficient Approach to the Online Multi-Agent Path Finding Problem by Using Sustainable Information
    11 Jan 2023 0 repositories listed
  • Heuristically Guided Compilation for Multi-Agent Path Finding
    13 Dec 2022 0 repositories listed
  • Multi Agent Path Finding using Evolutionary Game Theory
    5 Dec 2022 0 repositories listed
  • Cost Splitting for Multi-Objective Conflict-Based Search
    23 Nov 2022 0 repositories listed
  • SOCIALMAPF: Optimal and Efficient Multi-Agent Path Finding with Strategic Agents for Social Navigation
    15 Oct 2022 0 repositories listed
  • Multi-Goal Multi-Agent Pickup and Delivery
    2 Aug 2022 0 repositories listed
  • Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding
    2 Aug 2022 0 repositories listed
  • Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters
    5 Jul 2022 0 repositories listed
  • Graph-Based Multi-Robot Path Finding and Planning
    22 Jun 2022 0 repositories listed
  • Effective Integration of Weighted Cost-to-go and Conflict Heuristic within Suboptimal CBS
    23 May 2022 0 repositories listed
  • Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation
    20 Mar 2022 0 repositories listed
  • The Multi-Agent Pickup and Delivery Problem: MAPF, MARL and Its Warehouse Applications
    14 Mar 2022 0 repositories listed
  • Cooperative Task and Motion Planning for Multi-Arm Assembly Systems
    4 Mar 2022 0 repositories listed
  • Conflict-Based Search for Explainable Multi-Agent Path Finding
    20 Feb 2022 0 repositories listed
  • Optimal Multi-Agent Path Finding for Precedence Constrained Planning Tasks
    8 Feb 2022 0 repositories listed
  • DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies
    11 Nov 2021 0 repositories listed
  • Flexible and Explainable Solutions for Multi-Agent Path Finding Problems
    17 Sep 2021 0 repositories listed
  • Formalisation of Action with Durations in Answer Set Programming
    17 Sep 2021 0 repositories listed
  • Prioritized SIPP for Multi-Agent Path Finding With Kinematic Constraints
    11 Aug 2021 0 repositories listed
  • A Competitive Analysis of Online Multi-Agent Path Finding
    22 Jun 2021 0 repositories listed
  • Decentralised Approach for Multi Agent Path Finding
    3 Jun 2021 0 repositories listed
  • Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance
    23 May 2021 0 repositories listed

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; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.

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