Parallelized Planning-Acting for Efficient LLM-based Multi-Agent Systems
Yaoru Li, Shunyu Liu, Tongya Zheng, Mingli Song
TL;DR
The paper tackles the bottleneck of serialized decision-making in LLM-based multi-agent systems operating in dynamic environments. It proposes a parallelized planning-acting framework with interruptible dual-thread execution, a centralized memory system, and a comprehensive skill library to enable real-time planning and execution. Through Minecraft benchmarks (Resource Collection, Boss Combat, Adversarial PvP), it demonstrates notable improvements in responsiveness, coordination, and adaptability, aided by RTDM and a real-time memory/communication mechanism. This approach offers practical benefits for real-time multi-agent collaboration and adversarial tasks, reducing latency and enabling dynamic re-planning. The work also acknowledges limitations such as computational costs, hallucination risks, and multimodal fusion considerations, outlining directions for efficiency and robustness improvements.
Abstract
Recent advancements in Large Language Model(LLM)-based Multi-Agent Systems(MAS) have demonstrated remarkable potential for tackling complex decision-making tasks. However, existing frameworks inevitably rely on serialized execution paradigms, where agents must complete sequential LLM planning before taking action. This fundamental constraint severely limits real-time responsiveness and adaptation, which is crucial in dynamic environments with ever-changing scenarios. In this paper, we propose a novel parallelized planning-acting framework for LLM-based MAS, featuring a dual-thread architecture with interruptible execution to enable concurrent planning and acting. Specifically, our framework comprises two core threads:(1) a planning thread driven by a centralized memory system, maintaining synchronization of environmental states and agent communication to support dynamic decision-making; and (2) an acting thread equipped with a comprehensive skill library, enabling automated task execution through recursive decomposition. Extensive experiments on challenging Minecraft demonstrate the effectiveness of the proposed framework.
