Multi-Agent Path Finding via Offline RL and LLM Collaboration

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Atasever, Merve, Hong, Matthew, Kulkarni, Mihir Nitin, Li, Qingpei, Deshmukh, Jyotirmoy V.
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908560918577152
author Atasever, Merve
Hong, Matthew
Kulkarni, Mihir Nitin
Li, Qingpei
Deshmukh, Jyotirmoy V.
author_facet Atasever, Merve
Hong, Matthew
Kulkarni, Mihir Nitin
Li, Qingpei
Deshmukh, Jyotirmoy V.
contents Multi-Agent Path Finding (MAPF) poses a significant and challenging problem critical for applications in robotics and logistics, particularly due to its combinatorial complexity and the partial observability inherent in realistic environments. Decentralized reinforcement learning methods commonly encounter two substantial difficulties: first, they often yield self-centered behaviors among agents, resulting in frequent collisions, and second, their reliance on complex communication modules leads to prolonged training times, sometimes spanning weeks. To address these challenges, we propose an efficient decentralized planning framework based on the Decision Transformer (DT), uniquely leveraging offline reinforcement learning to substantially reduce training durations from weeks to mere hours. Crucially, our approach effectively handles long-horizon credit assignment and significantly improves performance in scenarios with sparse and delayed rewards. Furthermore, to overcome adaptability limitations inherent in standard RL methods under dynamic environmental changes, we integrate a large language model (GPT-4o) to dynamically guide agent policies. Extensive experiments in both static and dynamically changing environments demonstrate that our DT-based approach, augmented briefly by GPT-4o, significantly enhances adaptability and performance.
format Preprint
id arxiv_https___arxiv_org_abs_2509_22130
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Multi-Agent Path Finding via Offline RL and LLM Collaboration
Atasever, Merve
Hong, Matthew
Kulkarni, Mihir Nitin
Li, Qingpei
Deshmukh, Jyotirmoy V.
Multiagent Systems
Artificial Intelligence
Machine Learning
Multi-Agent Path Finding (MAPF) poses a significant and challenging problem critical for applications in robotics and logistics, particularly due to its combinatorial complexity and the partial observability inherent in realistic environments. Decentralized reinforcement learning methods commonly encounter two substantial difficulties: first, they often yield self-centered behaviors among agents, resulting in frequent collisions, and second, their reliance on complex communication modules leads to prolonged training times, sometimes spanning weeks. To address these challenges, we propose an efficient decentralized planning framework based on the Decision Transformer (DT), uniquely leveraging offline reinforcement learning to substantially reduce training durations from weeks to mere hours. Crucially, our approach effectively handles long-horizon credit assignment and significantly improves performance in scenarios with sparse and delayed rewards. Furthermore, to overcome adaptability limitations inherent in standard RL methods under dynamic environmental changes, we integrate a large language model (GPT-4o) to dynamically guide agent policies. Extensive experiments in both static and dynamically changing environments demonstrate that our DT-based approach, augmented briefly by GPT-4o, significantly enhances adaptability and performance.
title Multi-Agent Path Finding via Offline RL and LLM Collaboration
topic Multiagent Systems
Artificial Intelligence
Machine Learning
url https://arxiv.org/abs/2509.22130