LLMDR: LLM-Driven Deadlock Detection and Resolution in Multi-Agent Pathfinding

Multi-Agent Pathfinding (MAPF) is a core challenge in multi-agent systems. Existing learning-based MAPF methods often struggle with scalability, particularly when addressing complex scenarios that are prone to deadlocks. To address these challenges, we introduce LLMDR (LLM-Driven Deadlock Detection and Resolution), an approach designed to resolve deadlocks and improve the performance of learnt MAPF models. LLMDR integrates the inference capabilities of large language models (LLMs) with learnt MAPF models and prioritized planning, enabling it to detect deadlocks and provide customized resolution strategies. We evaluate LLMDR on standard MAPF benchmark maps with varying agent numbers, measuring its performance when combined with several base models. The results demonstrate that LLMDR improves the performance of learnt MAPF models, particularly in deadlock-prone scenarios, with notable improvements in success rates. These findings show the potential of integrating LLMs to improve the scalability of learning-based MAPF methods.The source code for LLMDR is available at:this https URL

@article{seo2025_2503.00717,
  title={ LLMDR: LLM-Driven Deadlock Detection and Resolution in Multi-Agent Pathfinding },
  author={ Seungbae Seo and Junghwan Kim and Minjeong Shin and Bongwon Suh },
  journal={arXiv preprint arXiv:2503.00717},
  year={ 2025 }
}