LLM-Augmented Deep Reinforcement Learning for Complex Task Planning

Complex task planning is crucial for enhancing the production autonomy and efficiency. The current Deep Reinforcement Learning (DRL)-based complex task planning algorithms struggle to converge to the optimal policy during training due to a lack of understanding of the environment and strategic knowledge. To counteract this challenge, we introduce a Large Language Model (LLM)-augmented DRL algorithm named Monte Carlo Tree Search Algorithm Assisted by a Large Language Model with Policy and Value Networks (LPV-MCTS). LPV-MCTS leverages the preexisting knowledge of LLM to accelerate the initial training phase of DRL, enabling it to assimilate high-quality data from the outset, thereby hastening the algorithm's environmental comprehension and the convergence of the policy. We then compare the proposed LPV-MCTS algorithm with other complex task planning algorithms. The empirical results demonstrate that the LPV-MCTS outperforms the baselines in terms of planning efficiency, generalizability, and training time efficiency.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/cac63892.2024.10864545
Primary Topic
Reinforcement Learning in Robotics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

LLM-Augmented Deep Reinforcement Learning for Complex Task Planning

Changyu Wang, Wentao Du, Hao Zhou, Zhongmin Cai et al.
Reinforcement Learning in Robotics
article

LLM-Augmented Deep Reinforcement Learning for Complex Task Planning

Changyu Wang, Wentao Du, Hao Zhou, Zhongmin Cai, Yunpeng Song, Haoming Wang
article en

Abstract

Complex task planning is crucial for enhancing the production autonomy and efficiency. The current Deep Reinforcement Learning (DRL)-based complex task planning algorithms struggle to converge to the optimal policy during training due to a lack of understanding of the environment and strategic knowledge. To counteract this challenge, we introduce a Large Language Model (LLM)-augmented DRL algorithm named Monte Carlo Tree Search Algorithm Assisted by a Large Language Model with Policy and Value Networks (LPV-MCTS). LPV-MCTS leverages the preexisting knowledge of LLM to accelerate the initial training phase of DRL, enabling it to assimilate high-quality data from the outset, thereby hastening the algorithm's environmental comprehension and the convergence of the policy. We then compare the proposed LPV-MCTS algorithm with other complex task planning algorithms. The empirical results demonstrate that the LPV-MCTS outperforms the baselines in terms of planning efficiency, generalizability, and training time efficiency.

Jingdong (China) (CN), Xi'an Jiaotong University (CN)
Openalex Percentile: Top 75%
Reinforcement Learning in Robotics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.