Score: 0

Decompose, Plan in Parallel, and Merge: A Novel Paradigm for Large Language Models based Planning with Multiple Constraints

Published: June 3, 2025 | arXiv ID: 2506.02683v1

By: Zhengdong Lu , Weikai Lu , Yiling Tao and more

Potential Business Impact:

Helps computers plan trips better and avoid mistakes.

Business Areas:
Natural Language Processing Artificial Intelligence, Data and Analytics, Software

Despite significant advances in Large Language Models (LLMs), planning tasks still present challenges for LLM-based agents. Existing planning methods face two key limitations: heavy constraints and cascading errors. To address these limitations, we propose a novel parallel planning paradigm, which Decomposes, Plans for subtasks in Parallel, and Merges subplans into a final plan (DPPM). Specifically, DPPM decomposes the complex task based on constraints into subtasks, generates the subplan for each subtask in parallel, and merges them into a global plan. In addition, our approach incorporates a verification and refinement module, enabling error correction and conflict resolution. Experimental results demonstrate that DPPM significantly outperforms existing methods in travel planning tasks.

Country of Origin
🇨🇳 China

Page Count
13 pages

Category
Computer Science:
Computation and Language