DoraemonGPT: Toward Solving Real-world Tasks with Large Language Models
Zongxin Yang, Guikun Chen, Xiaodi Li, Wenguan Wang, Yi Yang
OpenReview ground truth
Abstract
The field of developing AI agents is advancing at an unprecedented rate due to the powerful capabilities of large language models (LLMs). However, current LLM-driven agents mainly focus on solving tasks for the image modality, which limits their ability to understand the dynamic nature of the real world, making it still far from real-life applications, e.g., guiding students through multi-step laboratory experiments and identifying their mistakes. Considering the video modality better reflects the ever-changing and perceptually intensive nature of real-world scenarios, we devise DoraemonGPT, a comprehensive and conceptually elegant system driven by LLMs to handle dynamic video tasks. Given a video with a question/task, DoraemonGPT begins by converting the input video with massive content into a symbolic memory that stores task-related attributes. This structured representation allows for spatial-temporal querying and reasoning by sub-task tools, resulting in concise and relevant intermediate results. Recognizing that LLMs have limited internal knowledge when it comes to specialized domains (e.g., analyzing the scientific principles underlying experiments), we incorporate plug-and-play tools to assess external knowledge and address tasks across different domains. Moreover, we introduce a novel LLM-driven planner based on Monte Carlo Tree Search to efficiently explore the large planning space for scheduling various tools. The planner iteratively finds feasible solutions by backpropagating the result’s reward, and multiple solutions can be summarized into an improved final answer. We extensively evaluate DoraemonGPT’s effectiveness and reasoning capabilities in real-world dynamic scenarios and provide in-the-wild showcases demonstrating its ability to handle more complex questions than previous studies.
Author context
Most prolific author: 6 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 30 comparisons
Ranked above opponent in 41% of matchups.
- ▼ lost to Tree-Planner: Efficient Close-loop Task Pl… ×6
- ▼ lost to Complete and continuous representations of… ×4
- ▼ lost to Experimental Design for Multi-Channel Imag… ×4
- ▼ lost to RAND: Robustness Aware Norm Decay For Quan… ×4
- ▼ lost to Mining Patents with Large Language Models … ×4
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 30)