{"total":15,"rows":[{"id":"2310.01207","title":"Learn to Follow: Decentralized Lifelong Multi-agent Pathfinding via Planning and Learning","created":"2023-10-02","cited_by_count":29,"area":null},{"id":"2202.03634","title":"Multi-Agent Path Finding with Prioritized Communication Learning","created":"2022-02-08","cited_by_count":18,"area":null},{"id":"2202.05793","title":"Answer Set Planning: A Survey","created":"2022-02-11","cited_by_count":12,"area":null},{"id":"2206.11319","title":"Graph-Based Multi-Robot Path Finding and Planning","created":"2022-06-22","cited_by_count":7,"area":null},{"id":"2208.01222","title":"Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding","created":"2022-08-02","cited_by_count":5,"area":null},{"id":"2201.06014","title":"Standby-Based Deadlock Avoidance Method for Multi-Agent Pickup and Delivery Tasks","created":"2022-01-16","cited_by_count":4,"area":null},{"id":"2106.11454","title":"A Competitive Analysis of Online Multi-Agent Path Finding","created":"2021-06-22","cited_by_count":2,"area":null},{"id":"2111.06494","title":"DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies","created":"2021-11-11","cited_by_count":1,"area":null},{"id":"2409.06888","title":"QD-MAPPER: A Quality Diversity Framework to Automatically Evaluate Multi-Agent Path Finding Algorithms in Diverse Maps","created":"2024-09-10","cited_by_count":1,"area":null},{"id":"2603.23405","title":"Planning over MAPF Agent Dependencies via Multi-Dependency PIBT","created":"2026-03-24","cited_by_count":1,"area":null},{"id":"2207.01752","title":"Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters","created":"2022-07-05","cited_by_count":0,"area":null},{"id":"2301.08687","title":"Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding","created":"2023-01-20","cited_by_count":0,"area":null},{"id":"2501.02770","title":"Multi-Agent Pathfinding Under Team-Connected Communication Constraint via Adaptive Path Expansion and Dynamic Leading","created":"2025-01-06","cited_by_count":0,"area":null},{"id":"2606.15797","title":"Unassigned Agents in Compilation-based Multi-agent Path Finding","created":"2026-06-14","cited_by_count":0,"area":null},{"id":"2608.01024","title":"Stress-Relief Annealing: Polynomial-Time Simulation-Free Layout Optimization for Automated Warehouses","created":"2026-08-02","cited_by_count":0,"area":null}],"next_cursor":null}