Tree Search Planning
Tree search planning aims to efficiently find optimal action sequences to achieve goals, particularly in complex environments with high-dimensional state spaces. Current research focuses on integrating large language models (LLMs) and hierarchical planning methods, such as recursive tree planners and those employing multiple encoders for improved knowledge representation, to enhance planning efficiency and robustness. These advancements are improving decision-making in robotics, reinforcement learning, and other domains by enabling more efficient exploration of action spaces and better generalization across tasks. The resulting improvements in planning algorithms have significant implications for building more intelligent and adaptable AI agents.
Papers
Tree-Planner: Efficient Close-loop Task Planning with Large Language Models
Mengkang Hu, Yao Mu, Xinmiao Yu, Mingyu Ding, Shiguang Wu, Wenqi Shao, Qiguang Chen, Bin Wang, Yu Qiao, Ping Luo
LightZero: A Unified Benchmark for Monte Carlo Tree Search in General Sequential Decision Scenarios
Yazhe Niu, Yuan Pu, Zhenjie Yang, Xueyan Li, Tong Zhou, Jiyuan Ren, Shuai Hu, Hongsheng Li, Yu Liu