{"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 (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":38,"tagged_in_all":140,"items":[{"url":"/paper/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","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","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","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","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","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","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","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","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","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","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","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","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","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","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","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","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","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","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","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","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","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_unverified":0,"n_pointer_only":3}},{"url":"/paper/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","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","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","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","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","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","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","title":"Multi-Agent Path Finding with Prioritized Communication Learning","date":"2022-02-08","arxiv_id":"2202.03634","repositories_listed":1,"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"},"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-09-24T18:15:14+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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"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"}}