{"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/papers/2","list_of":"/task/multi-agent-path-finding","task":"Multi-Agent Path Finding","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,140],"of":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"},"first_page":"/task/multi-agent-path-finding","prev":"/task/multi-agent-path-finding","next":null,"papers":[{"url":null,"slug":"compilation-based-solvers-for-multi-agent","title":"Compilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities","date":"2021-04-23","arxiv_id":"2104.11809","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-the-complexity-analysis-of","title":"Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds","date":"2021-04-18","arxiv_id":"2104.08759","repositories_listed":0,"syntology":null},{"url":null,"slug":"ms-a-new-exact-algorithm-for-multi-agent","title":"MS*: A New Exact Algorithm for Multi-agent Simultaneous Multi-goal Sequencing and Path Finding","date":"2021-03-18","arxiv_id":"2103.09979","repositories_listed":0,"syntology":null},{"url":null,"slug":"pairwise-symmetry-reasoning-for-multi-agent","title":"Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search","date":"2021-03-12","arxiv_id":"2103.07116","repositories_listed":0,"syntology":null},{"url":null,"slug":"loosely-synchronized-search-for-multi-agent","title":"Loosely Synchronized Search for Multi-agent Path Finding with Asynchronous Actions","date":"2021-03-08","arxiv_id":"2103.04516","repositories_listed":0,"syntology":null},{"url":null,"slug":"symmetry-breaking-for-k-robust-multi-agent","title":"Symmetry Breaking for k-Robust Multi-Agent Path Finding","date":"2021-02-17","arxiv_id":"2102.08689","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-resolve-conflicts-for-multi-agent","title":"Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search","date":"2020-12-10","arxiv_id":"2012.06005","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-select-nodes-in-bounded","title":"Learning to Select Nodes in Bounded Suboptimal Conflict-Based Search for Multi-Agent Path Finding","date":"2020-10-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-feedback-scheme-to-reorder-a-multi-agent","title":"A Feedback Scheme to Reorder a Multi-Agent Execution Schedule by Persistently Optimizing a Switchable Action Dependency Graph","date":"2020-10-11","arxiv_id":"2010.05254","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-multi-agent-path-finding-based-on","title":"Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming","date":"2020-09-22","arxiv_id":"2009.10249","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-with-awareness-for","title":"Multi Agent Path Finding with Awareness for Spatially Extended Agents","date":"2020-09-20","arxiv_id":"2009.09355","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-goal-multi-agent-path-finding-via","title":"Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering","date":"2020-09-10","arxiv_id":"2009.05161","repositories_listed":0,"syntology":null},{"url":null,"slug":"explanation-generation-for-multi-modal-multi","title":"Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming","date":"2020-08-08","arxiv_id":"2008.03573","repositories_listed":0,"syntology":null},{"url":null,"slug":"resolving-head-on-conflicts-for-multi-agent","title":"Resolving Head-On Conflicts for Multi-Agent Path Finding with Conflict-Based Search","date":"2020-07-07","arxiv_id":"2007.03575","repositories_listed":0,"syntology":null},{"url":null,"slug":"conflict-based-search-for-connected-multi","title":"Conflict-Based Search for Connected Multi-Agent Path Finding","date":"2020-06-05","arxiv_id":"2006.03280","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-job-assignment-heuristic-for-lifelong-multi","title":"A Job-Assignment Heuristic for Lifelong Multi-Agent Path Finding Problem with Multiple Delivery Locations","date":"2020-04-25","arxiv_id":"2003.07108","repositories_listed":0,"syntology":null},{"url":null,"slug":"pushing-the-envelope-from-discrete-to","title":"Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings","date":"2020-04-25","arxiv_id":"2004.13477","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimized-directed-roadmap-graph-for-multi","title":"Optimized Directed Roadmap Graph for Multi-Agent Path Finding Using Stochastic Gradient Descent","date":"2020-03-29","arxiv_id":"2003.12924","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-pathfinding-based-on-high","title":"Optimizing Cooperative path-finding: A Scalable Multi-Agent RRT* with Dynamic Potential Fields","date":"2019-11-16","arxiv_id":"1911.07840","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-with-capacity","title":"Multi-Agent Path Finding with Capacity Constraints","date":"2019-07-21","arxiv_id":"1907.12648","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-tour-towards-dpllmapf-and-beyond","title":"On the Tour Towards DPLL(MAPF) and Beyond","date":"2019-07-11","arxiv_id":"1907.07631","repositories_listed":0,"syntology":null},{"url":null,"slug":"position-paper-from-multi-agent-pathfinding","title":"Position Paper: From Multi-Agent Pathfinding to Pipe Routing","date":"2019-05-21","arxiv_id":"1905.08412","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-abstractions-to-natural-languages-for","title":"From Abstractions to Grounded Languages for Robust Coordination of Task Planning Robots","date":"2019-05-01","arxiv_id":"1905.00517","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-with-continuous-time","title":"Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT)","date":"2019-03-23","arxiv_id":"1903.09820","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-summary-of-adaptation-of-techniques-from","title":"A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach","date":"2018-12-28","arxiv_id":"1812.10851","repositories_listed":0,"syntology":null},{"url":null,"slug":"searching-with-consistent-prioritization-for","title":"Searching with Consistent Prioritization for Multi-Agent Path Finding","date":"2018-12-15","arxiv_id":"1812.06356","repositories_listed":0,"syntology":null},{"url":null,"slug":"lazy-modeling-of-variants-of-token-swapping","title":"Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search","date":"2018-09-16","arxiv_id":"1809.05959","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-optimal-solutions-to-token-swapping","title":"Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT","date":"2018-06-25","arxiv_id":"1806.09487","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-with-deadlines","title":"Multi-Agent Path Finding with Deadlines","date":"2018-06-11","arxiv_id":"1806.04216","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-with-deadlines-1","title":"Multi-Agent Path Finding with Deadlines: Preliminary Results","date":"2018-05-13","arxiv_id":"1805.04961","repositories_listed":0,"syntology":null},{"url":null,"slug":"ai-buzzwords-explained-multi-agent-path","title":"AI Buzzwords Explained: Multi-Agent Path Finding (MAPF)","date":"2017-10-10","arxiv_id":"1710.03774","repositories_listed":0,"syntology":null},{"url":null,"slug":"feasibility-study-moving-non-homogeneous","title":"Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments","date":"2017-10-04","arxiv_id":"1710.01447","repositories_listed":0,"syntology":null},{"url":null,"slug":"modifying-optimal-sat-based-approach-to-multi","title":"Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants","date":"2017-07-02","arxiv_id":"1707.00228","repositories_listed":0,"syntology":null},{"url":null,"slug":"rapid-randomized-restarts-for-multi-agent","title":"Rapid Randomized Restarts for Multi-Agent Path Finding Solvers","date":"2017-06-08","arxiv_id":"1706.02794","repositories_listed":0,"syntology":null},{"url":null,"slug":"overview-generalizations-of-multi-agent-path","title":"Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios","date":"2017-02-17","arxiv_id":"1702.05515","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-target-assignment-and-path-finding","title":"Optimal Target Assignment and Path Finding for Teams of Agents","date":"2016-12-17","arxiv_id":"1612.05693","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-path-finding-with-delay","title":"Multi-Agent Path Finding with Delay Probabilities","date":"2016-12-15","arxiv_id":"1612.05309","repositories_listed":0,"syntology":null},{"url":null,"slug":"resolving-spatial-time-conflicts-in-a-set-of","title":"Resolving Spatial-Time Conflicts In A Set Of Any-angle Or Angle-constrained Grid Paths","date":"2016-08-09","arxiv_id":"1608.02763","repositories_listed":0,"syntology":null},{"url":null,"slug":"justifying-and-improving-meta-agent-conflict","title":"Justifying and Improving Meta-Agent Conflict-Based Search","date":"2014-10-23","arxiv_id":"1410.6519","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-coordinated-paths-for-multiple","title":"Finding Coordinated Paths for Multiple Holonomic Agents in 2-d Polygonal Environment","date":"2014-02-14","arxiv_id":"1402.3613","repositories_listed":0,"syntology":null}],"record_sha256":"0baa8616d4599bca38e8775381571e856f6fa40b2caef2ef2be7fdc713760e1e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}