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
- Changyu Wang (ORCID: https://orcid.org/0000-0002-3207-0965)
- Wentao Du (ORCID: https://orcid.org/0000-0003-1848-646X)
- Hao Zhou (ORCID: https://orcid.org/0000-0003-0642-881X)
- Zhongmin Cai (ORCID: https://orcid.org/0000-0003-2152-720X)
- Yunpeng Song (ORCID: https://orcid.org/0009-0002-6347-8880)
- Haoming Wang (ORCID: https://orcid.org/0000-0003-1577-1628)
Institutions
- Jingdong (China) (CN)
- Xi'an Jiaotong University (CN)
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