Saved in:
Bibliographic Details
Main Authors: Seo, Seungbae, Kim, Junghwan, Shin, Minjeong, Suh, Bongwon
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2503.00717
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910853788336128
author Seo, Seungbae
Kim, Junghwan
Shin, Minjeong
Suh, Bongwon
author_facet Seo, Seungbae
Kim, Junghwan
Shin, Minjeong
Suh, Bongwon
contents 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: https://github.com/ssbacc/llmdr-dhc
format Preprint
id arxiv_https___arxiv_org_abs_2503_00717
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle LLMDR: LLM-Driven Deadlock Detection and Resolution in Multi-Agent Pathfinding
Seo, Seungbae
Kim, Junghwan
Shin, Minjeong
Suh, Bongwon
Multiagent Systems
Artificial Intelligence
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: https://github.com/ssbacc/llmdr-dhc
title LLMDR: LLM-Driven Deadlock Detection and Resolution in Multi-Agent Pathfinding
topic Multiagent Systems
Artificial Intelligence
url https://arxiv.org/abs/2503.00717