On The Planning Abilities of OpenAI's o1 Models: Feasibility, Optimality, and Generalizability
FreeAbout On The Planning Abilities of OpenAI's o1 Models: Feasibility, Optimality, and Generalizability
This research paper conducts a pilot study evaluating the planning capabilities of OpenAI's o1 models across several benchmark tasks, focusing on three key aspects: feasibility, optimality, and generalizability. Through empirical evaluations on constraint-heavy tasks (e.g., Barman, Tyreworld) and spatially complex environments (e.g., Termes, Floortile), the paper highlights o1-preview's strengths in self-evaluation and constraint-following while identifying bottlenecks in decision-making and memory management, particularly in tasks requiring robust spatial reasoning. The results show that o1-preview outperforms GPT-4 in adhering to task constraints and managing state transitions, but often generates suboptimal solutions with redundant actions and struggles to generalize effectively in spatially complex tasks. Code for the experiments is provided.
Key Features
Pros & Cons
- Outperforms GPT-4 in adhering to task constraints and managing state transitions in structured environments
- Demonstrates strong self-evaluation and constraint-following abilities
- Provides open-source code and evaluations for reproducibility
- Offers foundational insights into planning limitations of LLMs
- Often generates suboptimal solutions with redundant actions
- Struggles to generalize effectively in spatially complex tasks
- Bottlenecks in decision-making and memory management
- Pilot study with limited scope; more research needed