{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/multi-agent-path-finding","name":"Multi-Agent Path Finding","slug":"multi-agent-path-finding","description_markdown":null,"categories":[{"name":"Playing Games","url":"/area/playing-games"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":140,"papers_with_code":38,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":2,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/cpp-simulated-evaluation","name":"CPP simulated evaluation","full_name":"","num_papers_in_archive":1},{"url":"/dataset/pursuitmw","name":"pursuitMW","full_name":"Multi-agent pursuit in matrix world","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":140,"of_with_code":38,"tagged_in_all":140,"counts":{"archive_papers_tagged":140,"with_a_code_link":38,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":140,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/guidance-graph-optimization-for-lifelong","slug":"guidance-graph-optimization-for-lifelong","title":"Guidance Graph Optimization for Lifelong Multi-Agent Path Finding","date":"2024-02-02","arxiv_id":"2402.01446","repositories_listed":2,"syntology":null},{"url":"/paper/mapfast-a-deep-algorithm-selector-for-multi","slug":"mapfast-a-deep-algorithm-selector-for-multi","title":"MAPFAST: A Deep Algorithm Selector for Multi Agent Path Finding using Shortest Path Embeddings","date":"2021-02-24","arxiv_id":"2102.12461","repositories_listed":2,"syntology":null},{"url":"/paper/subdimensional-expansion-for-multi-objective","slug":"subdimensional-expansion-for-multi-objective","title":"Subdimensional Expansion for Multi-objective Multi-agent Path Finding","date":"2021-02-02","arxiv_id":"2102.01353","repositories_listed":2,"syntology":null},{"url":"/paper/improving-continuous-time-conflict-based","slug":"improving-continuous-time-conflict-based","title":"Improving Continuous-time Conflict Based Search","date":"2021-01-24","arxiv_id":"2101.09723","repositories_listed":2,"syntology":null},{"url":"/paper/multi-objective-conflict-based-search-for","slug":"multi-objective-conflict-based-search-for","title":"A Conflict-Based Search Framework for Multi-Objective Multi-Agent Path Finding","date":"2021-01-11","arxiv_id":"2101.03805","repositories_listed":2,"syntology":null},{"url":"/paper/accelerating-focal-search-in-multi-agent-path","slug":"accelerating-focal-search-in-multi-agent-path","title":"Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds","date":"2025-03-04","arxiv_id":"2503.03779","repositories_listed":1,"syntology":null},{"url":"/paper/sigma-sheaf-informed-geometric-multi-agent","slug":"sigma-sheaf-informed-geometric-multi-agent","title":"SIGMA: Sheaf-Informed Geometric Multi-Agent Pathfinding","date":"2025-02-10","arxiv_id":"2502.06440","repositories_listed":1,"syntology":null},{"url":"/paper/graph-coloring-to-reduce-computation-time-in","slug":"graph-coloring-to-reduce-computation-time-in","title":"Graph Coloring to Reduce Computation Time in Prioritized Planning","date":"2025-01-18","arxiv_id":"2501.10812","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-computation-with-multiple","slug":"simultaneous-computation-with-multiple","title":"Simultaneous Computation with Multiple Prioritizations in Multi-Agent Motion Planning","date":"2025-01-18","arxiv_id":"2501.10781","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-motion-planning-for-differential","slug":"multi-agent-motion-planning-for-differential","title":"Multi-Agent Motion Planning For Differential Drive Robots Through Stationary State Search","date":"2024-12-17","arxiv_id":"2412.13359","repositories_listed":1,"syntology":null},{"url":"/paper/loosely-synchronized-rule-based-planning-for","slug":"loosely-synchronized-rule-based-planning-for","title":"Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions","date":"2024-12-16","arxiv_id":"2412.11678","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-multi-robot-coverage-path-1","slug":"large-scale-multi-robot-coverage-path-1","title":"Large-Scale Multi-Robot Coverage Path Planning on Grids with Path Deconfliction","date":"2024-11-03","arxiv_id":"2411.01707","repositories_listed":1,"syntology":null},{"url":"/paper/layered-la-mapf-a-decomposition-of-large","slug":"layered-la-mapf-a-decomposition-of-large","title":"Layered LA-MAPF: a decomposition of large agent MAPF instance to accelerate solving without compromising solvability","date":"2024-10-22","arxiv_id":"2410.17160","repositories_listed":1,"syntology":null},{"url":"/paper/2408-02960","slug":"2408-02960","title":"Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic","date":"2024-08-06","arxiv_id":"2408.02960","repositories_listed":1,"syntology":null},{"url":"/paper/mgcbs-an-optimal-and-efficient-algorithm-for","slug":"mgcbs-an-optimal-and-efficient-algorithm-for","title":"MGCBS: An Optimal and Efficient Algorithm for Solving Multi-Goal Multi-Agent Path Finding Problem","date":"2024-04-30","arxiv_id":"2404.19518","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-lifelong-multi-agent-path-finding-to","slug":"scaling-lifelong-multi-agent-path-finding-to","title":"Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities","date":"2024-04-24","arxiv_id":"2404.16162","repositories_listed":1,"syntology":null},{"url":"/paper/ita-ecbs-a-bounded-suboptimal-algorithm-for","slug":"ita-ecbs-a-bounded-suboptimal-algorithm-for","title":"ITA-ECBS: A Bounded-Suboptimal Algorithm for the Combined Target-Assignment and Path-Finding Problem","date":"2024-04-08","arxiv_id":"2404.05223","repositories_listed":1,"syntology":null},{"url":"/paper/a-real-time-rescheduling-algorithm-for-multi","slug":"a-real-time-rescheduling-algorithm-for-multi","title":"A Real-Time Rescheduling Algorithm for Multi-robot Plan Execution","date":"2024-03-26","arxiv_id":"2403.18145","repositories_listed":1,"syntology":null},{"url":"/paper/caching-augmented-lifelong-multi-agent-path","slug":"caching-augmented-lifelong-multi-agent-path","title":"Caching-Augmented Lifelong Multi-Agent Path Finding","date":"2024-03-20","arxiv_id":"2403.13421","repositories_listed":1,"syntology":null},{"url":"/paper/ensembling-prioritized-hybrid-policies-for","slug":"ensembling-prioritized-hybrid-policies-for","title":"Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding","date":"2024-03-12","arxiv_id":"2403.07559","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-path-finding-for-cooperative","slug":"multi-agent-path-finding-for-cooperative","title":"Multi-agent Path Finding for Cooperative Autonomous Driving","date":"2024-02-01","arxiv_id":"2402.00334","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-mechanism-design-for-multi-agent","slug":"scalable-mechanism-design-for-multi-agent","title":"Scalable Mechanism Design for Multi-Agent Path Finding","date":"2024-01-30","arxiv_id":"2401.17044","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-mechanism-design-for-multi-agent#ran","syntology_url":"https://syntology.ai/paper/2401.17044","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.17044"}},"official":{"repos":["lunjohnzhang/mapf-mechanism"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-anytime-multi-agent-path-finding","slug":"adaptive-anytime-multi-agent-path-finding","title":"Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search","date":"2023-12-28","arxiv_id":"2312.16767","repositories_listed":1,"syntology":null},{"url":"/paper/traffic-flow-optimisation-for-lifelong-multi","slug":"traffic-flow-optimisation-for-lifelong-multi","title":"Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding","date":"2023-08-22","arxiv_id":"2308.11234","repositories_listed":1,"syntology":null},{"url":"/paper/sacha-soft-actor-critic-with-heuristic-based","slug":"sacha-soft-actor-critic-with-heuristic-based","title":"SACHA: Soft Actor-Critic with Heuristic-Based Attention for Partially Observable Multi-Agent Path Finding","date":"2023-07-05","arxiv_id":"2307.02691","repositories_listed":1,"syntology":null},{"url":"/paper/multi-robot-coordination-and-layout-design","slug":"multi-robot-coordination-and-layout-design","title":"Multi-Robot Coordination and Layout Design for Automated Warehousing","date":"2023-05-10","arxiv_id":"2305.06436","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-path-finding-via-tree-lstm","slug":"multi-agent-path-finding-via-tree-lstm","title":"Multi-Agent Path Finding via Tree LSTM","date":"2022-10-24","arxiv_id":"2210.12933","repositories_listed":1,"syntology":null},{"url":"/paper/toward-multi-target-self-organizing-pursuit","slug":"toward-multi-target-self-organizing-pursuit","title":"Toward multi-target self-organizing pursuit in a partially observable Markov game","date":"2022-06-24","arxiv_id":"2206.12330","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-experience-in-lifelong-multi-agent","slug":"leveraging-experience-in-lifelong-multi-agent","title":"Leveraging Experience in Lifelong Multi-Agent Pathfinding","date":"2022-02-09","arxiv_id":"2202.04382","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-path-finding-with-prioritized","slug":"multi-agent-path-finding-with-prioritized","title":"Multi-Agent Path Finding with Prioritized Communication Learning","date":"2022-02-08","arxiv_id":"2202.03634","repositories_listed":1,"syntology":null},{"url":"/paper/coordinated-multi-agent-pathfinding-for","slug":"coordinated-multi-agent-pathfinding-for","title":"Coordinated Multi-Agent Pathfinding for Drones and Trucks over Road Networks","date":"2021-10-17","arxiv_id":"2110.08802","repositories_listed":1,"syntology":null},{"url":"/paper/subdimensional-expansion-using-attention","slug":"subdimensional-expansion-using-attention","title":"Subdimensional Expansion Using Attention-Based Learning For Multi-Agent Path Finding","date":"2021-09-29","arxiv_id":"2109.14695","repositories_listed":1,"syntology":null},{"url":"/paper/learning-selective-communication-for-multi","slug":"learning-selective-communication-for-multi","title":"Learning Selective Communication for Multi-Agent Path Finding","date":"2021-09-12","arxiv_id":"2109.05413","repositories_listed":1,"syntology":null},{"url":"/paper/multi-objective-conflict-based-search-using","slug":"multi-objective-conflict-based-search-using","title":"Multi-objective Conflict-based Search Using Safe-interval Path Planning","date":"2021-08-02","arxiv_id":"2108.00745","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-heuristic-multi-agent-path","slug":"distributed-heuristic-multi-agent-path","title":"Distributed Heuristic Multi-Agent Path Finding with Communication","date":"2021-06-21","arxiv_id":"2106.11365","repositories_listed":1,"syntology":null},{"url":"/paper/eecbs-a-bounded-suboptimal-search-for-multi","slug":"eecbs-a-bounded-suboptimal-search-for-multi","title":"EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding","date":"2020-10-03","arxiv_id":"2010.01367","repositories_listed":1,"syntology":null},{"url":"/paper/lifelong-multi-agent-path-finding-in-large","slug":"lifelong-multi-agent-path-finding-in-large","title":"Lifelong Multi-Agent Path Finding in Large-Scale Warehouses","date":"2020-05-15","arxiv_id":"2005.07371","repositories_listed":1,"syntology":null},{"url":"/paper/lifelong-multi-agent-path-finding-for-online","slug":"lifelong-multi-agent-path-finding-for-online","title":"Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks","date":"2017-05-30","arxiv_id":"1705.10868","repositories_listed":1,"syntology":null},{"url":null,"slug":"enhancing-lifelong-multi-agent-path-finding-1","title":"Enhancing Lifelong Multi-Agent Path-finding by Using Artificial Potential Fields","date":"2025-05-28","arxiv_id":"2505.22753","repositories_listed":0,"syntology":null},{"url":null,"slug":"where-paths-collide-a-comprehensive-survey-of","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","date":"2025-05-25","arxiv_id":"2505.19219","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-for-large-agents-is","title":"Multi-Agent Path Finding For Large Agents Is Intractable","date":"2025-05-15","arxiv_id":"2505.10387","repositories_listed":0,"syntology":null},{"url":null,"slug":"anytime-single-step-mapf-planning-with","title":"Anytime Single-Step MAPF Planning with Anytime PIBT","date":"2025-04-10","arxiv_id":"2504.07841","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-lacam","title":"Real-Time LaCAM","date":"2025-04-08","arxiv_id":"2504.06091","repositories_listed":0,"syntology":null},{"url":null,"slug":"prioritized-planning-for-continuous-time","title":"Prioritized Planning for Continuous-time Lifelong Multi-agent Pathfinding","date":"2025-03-17","arxiv_id":"2503.13175","repositories_listed":0,"syntology":null},{"url":null,"slug":"railgun-a-unified-convolutional-policy-for","title":"RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks","date":"2025-03-04","arxiv_id":"2503.02992","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-parallelizable-variant-of-hca","title":"A parallelizable variant of HCA*","date":"2025-01-31","arxiv_id":"2501.19218","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-quantum-classical-multi-agent","title":"Hybrid Quantum-Classical Multi-Agent Pathfinding","date":"2025-01-24","arxiv_id":"2501.14568","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-lifelong-multi-agent-path-finding","title":"Enhancing Lifelong Multi-Agent Path Finding with Cache Mechanism","date":"2025-01-06","arxiv_id":"2501.02803","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-under-limited","title":"Multi-Agent Path Finding under Limited Communication Range Constraint via Dynamic Leading","date":"2025-01-06","arxiv_id":"2501.02770","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-in-continuous-spaces","title":"Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models","date":"2024-12-23","arxiv_id":"2412.17993","repositories_listed":0,"syntology":null},{"url":null,"slug":"speedup-techniques-for-switchable-temporal","title":"Speedup Techniques for Switchable Temporal Plan Graph Optimization","date":"2024-12-20","arxiv_id":"2412.15908","repositories_listed":0,"syntology":null},{"url":null,"slug":"transient-multi-agent-path-finding-for","title":"Transient Multi-Agent Path Finding for Lifelong Navigation in Dense Environments","date":"2024-12-05","arxiv_id":"2412.04256","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-for-timed-tasks","title":"Multi-agent Path Finding for Timed Tasks using Evolutionary Games","date":"2024-11-15","arxiv_id":"2411.10558","repositories_listed":0,"syntology":null},{"url":null,"slug":"deploying-ten-thousand-robots-scalable","title":"Deploying Ten Thousand Robots: Scalable Imitation Learning for Lifelong Multi-Agent Path Finding","date":"2024-10-28","arxiv_id":"2410.21415","repositories_listed":0,"syntology":null},{"url":null,"slug":"mfc-eq-mean-field-control-with-envelope-q","title":"MFC-EQ: Mean-Field Control with Envelope Q-Learning for Moving Decentralized Agents in Formation","date":"2024-10-15","arxiv_id":"2410.12062","repositories_listed":0,"syntology":null},{"url":null,"slug":"windowed-mapf-with-completeness-guarantees","title":"Windowed MAPF with Completeness Guarantees","date":"2024-10-02","arxiv_id":"2410.01798","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-in-continuous","title":"Multi-agent Path Finding in Continuous Environment","date":"2024-09-16","arxiv_id":"2409.10680","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-for-mixed-autonomy","title":"Multi-agent Path Finding for Mixed Autonomy Traffic Coordination","date":"2024-09-05","arxiv_id":"2409.03881","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-with-real-robot","title":"Multi-Agent Path Finding with Real Robot Dynamics and Interdependent Tasks for Automated Warehouses","date":"2024-08-26","arxiv_id":"2408.14527","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithm-selection-for-optimal-multi-agent","title":"Algorithm Selection for Optimal Multi-Agent Path Finding via Graph Embedding","date":"2024-06-16","arxiv_id":"2406.10827","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-search-based-planning-for-multi","title":"Accelerating Search-Based Planning for Multi-Robot Manipulation by Leveraging Online-Generated Experiences","date":"2024-03-29","arxiv_id":"2404.00143","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-learnt-local-mapf-policies-with","title":"Improving Learnt Local MAPF Policies with Heuristic Search","date":"2024-03-29","arxiv_id":"2403.20300","repositories_listed":0,"syntology":null},{"url":null,"slug":"routing-and-scheduling-in-answer-set","title":"Routing and Scheduling in Answer Set Programming applied to Multi-Agent Path Finding: Preliminary Report","date":"2024-03-18","arxiv_id":"2403.12153","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-conflict-aware-optimal-goal-assignment","title":"A Conflict-Aware Optimal Goal Assignment Algorithm for Multi-Robot Systems","date":"2024-02-19","arxiv_id":"2402.13292","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-task-assignment-and-path-planning","title":"Optimal Task Assignment and Path Planning using Conflict-Based Search with Precedence and Temporal Constraints","date":"2024-02-13","arxiv_id":"2402.08772","repositories_listed":0,"syntology":null},{"url":null,"slug":"why-solving-multi-agent-path-finding-with","title":"Why Solving Multi-agent Path Finding with Large Language Model has not Succeeded Yet","date":"2024-01-08","arxiv_id":"2401.03630","repositories_listed":0,"syntology":null},{"url":null,"slug":"bidirectional-temporal-plan-graph-enabling","title":"Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution","date":"2023-12-30","arxiv_id":"2401.00315","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-anonymous-multi-agent-path-finding","title":"Improved Anonymous Multi-Agent Path Finding Algorithm","date":"2023-12-17","arxiv_id":"2312.10572","repositories_listed":0,"syntology":null},{"url":null,"slug":"crowd-aware-multi-agent-pathfinding-with","title":"Optimizing Crowd-Aware Multi-Agent Path Finding through Local Communication with Graph Neural Networks","date":"2023-09-19","arxiv_id":"2309.10275","repositories_listed":0,"syntology":null},{"url":null,"slug":"selective-communication-for-cooperative","title":"Selective Communication for Cooperative Perception in End-to-End Autonomous Driving","date":"2023-05-26","arxiv_id":"2305.17181","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-complexity-analysis-of-multi","title":"Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids","date":"2023-05-25","arxiv_id":"2305.16303","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-computing-universal-plans-for-partially","title":"On Computing Universal Plans for Partially Observable Multi-Agent Path Finding","date":"2023-05-25","arxiv_id":"2305.16203","repositories_listed":0,"syntology":null},{"url":null,"slug":"tracking-progress-in-multi-agent-path-finding","title":"Tracking Progress in Multi-Agent Path Finding","date":"2023-05-15","arxiv_id":"2305.08446","repositories_listed":0,"syntology":null},{"url":null,"slug":"double-deck-multi-agent-pickup-and-delivery","title":"Double-Deck Multi-Agent Pickup and Delivery: Multi-Robot Rearrangement in Large-Scale Warehouses","date":"2023-04-27","arxiv_id":"2304.14309","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-study-of-highway-for-lifelong-multi-agent","title":"The Study of Highway for Lifelong Multi-Agent Path Finding","date":"2023-04-09","arxiv_id":"2304.04217","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-multi-agent-pickup-and-delivery-with","title":"Robust Multi-Agent Pickup and Delivery with Delays","date":"2023-03-30","arxiv_id":"2303.17422","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-multi-agent-planning-using-graph","title":"Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality","date":"2023-01-20","arxiv_id":"2301.08451","repositories_listed":0,"syntology":null},{"url":null,"slug":"counterexample-guided-abstraction-refinement-1","title":"Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding","date":"2023-01-20","arxiv_id":"2301.08687","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-approach-to-the-online-multi","title":"An Efficient Approach to the Online Multi-Agent Path Finding Problem by Using Sustainable Information","date":"2023-01-11","arxiv_id":"2301.04446","repositories_listed":0,"syntology":null},{"url":null,"slug":"heuristically-guided-compilation-for-multi","title":"Heuristically Guided Compilation for Multi-Agent Path Finding","date":"2022-12-13","arxiv_id":"2212.06940","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-using-evolutionary","title":"Multi Agent Path Finding using Evolutionary Game Theory","date":"2022-12-05","arxiv_id":"2212.02010","repositories_listed":0,"syntology":null},{"url":null,"slug":"cost-splitting-for-multi-objective-conflict","title":"Cost Splitting for Multi-Objective Conflict-Based Search","date":"2022-11-23","arxiv_id":"2211.12885","repositories_listed":0,"syntology":null},{"url":null,"slug":"socialmapf-optimal-and-efficient-multi-agent","title":"SOCIALMAPF: Optimal and Efficient Multi-Agent Path Finding with Strategic Agents for Social Navigation","date":"2022-10-15","arxiv_id":"2210.08390","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-goal-multi-agent-pickup-and-delivery","title":"Multi-Goal Multi-Agent Pickup and Delivery","date":"2022-08-02","arxiv_id":"2208.01223","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-and-bounded-suboptimal-multi-goal","title":"Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding","date":"2022-08-02","arxiv_id":"2208.01222","repositories_listed":0,"syntology":null},{"url":null,"slug":"plan-execution-for-multi-agent-path-finding","title":"Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters","date":"2022-07-05","arxiv_id":"2207.01752","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-multi-robot-path-finding-and","title":"Graph-Based Multi-Robot Path Finding and Planning","date":"2022-06-22","arxiv_id":"2206.11319","repositories_listed":0,"syntology":null},{"url":null,"slug":"effectively-incorporating-weighted-cost-to-go","title":"Effective Integration of Weighted Cost-to-go and Conflict Heuristic within Suboptimal CBS","date":"2022-05-23","arxiv_id":"2205.11624","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-terraforming-efficient-multi","title":"Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation","date":"2022-03-20","arxiv_id":"2203.10540","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-multi-agent-pickup-and-delivery-problem","title":"The Multi-Agent Pickup and Delivery Problem: MAPF, MARL and Its Warehouse Applications","date":"2022-03-14","arxiv_id":"2203.07092","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-task-and-motion-planning-for","title":"Cooperative Task and Motion Planning for Multi-Arm Assembly Systems","date":"2022-03-04","arxiv_id":"2203.02475","repositories_listed":0,"syntology":null},{"url":null,"slug":"conflict-based-search-for-explainable-multi","title":"Conflict-Based Search for Explainable Multi-Agent Path Finding","date":"2022-02-20","arxiv_id":"2202.09930","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-multi-agent-path-finding-for","title":"Optimal Multi-Agent Path Finding for Precedence Constrained Planning Tasks","date":"2022-02-08","arxiv_id":"2202.10449","repositories_listed":0,"syntology":null},{"url":null,"slug":"dpll-mapf-an-integration-of-multi-agent-path","title":"DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies","date":"2021-11-11","arxiv_id":"2111.06494","repositories_listed":0,"syntology":null},{"url":null,"slug":"flexible-and-explainable-solutions-for-multi","title":"Flexible and Explainable Solutions for Multi-Agent Path Finding Problems","date":"2021-09-17","arxiv_id":"2109.08299","repositories_listed":0,"syntology":null},{"url":null,"slug":"formalisation-of-action-with-durations-in","title":"Formalisation of Action with Durations in Answer Set Programming","date":"2021-09-17","arxiv_id":"2109.08305","repositories_listed":0,"syntology":null},{"url":null,"slug":"prioritized-sipp-for-multi-agent-path-finding","title":"Prioritized SIPP for Multi-Agent Path Finding With Kinematic Constraints","date":"2021-08-11","arxiv_id":"2108.05145","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-competitive-analysis-of-online-multi-agent","title":"A Competitive Analysis of Online Multi-Agent Path Finding","date":"2021-06-22","arxiv_id":"2106.11454","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralised-approach-for-multi-agent-path","title":"Decentralised Approach for Multi Agent Path Finding","date":"2021-06-03","arxiv_id":"2106.05188","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-multi-agent-path-finding-beyond","title":"Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance","date":"2021-05-23","arxiv_id":"2105.10993","repositories_listed":0,"syntology":null}],"syntology_records":1,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/task/multi-agent-path-finding/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/task/multi-agent-path-finding/papers/2","json":"/task/multi-agent-path-finding/papers/2.json","rows":40},{"order":"ran","page":1,"of":1,"url":"/task/multi-agent-path-finding/papers/ran/1","json":"/task/multi-agent-path-finding/papers/ran/1.json","rows":1}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"2ec2ebfab0628adb1da169e71d83f40476444f17fb01973438693a414e7c5342","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}