Graph Search Based Planning With Hierarchical Exploration

via “graph search-based planning with hierarchical exploration”

Agent S: an open agentic framework that uses computers like a human

Unique: Implements classical graph search planning combined with LMM-based heuristics for node evaluation, enabling systematic exploration of action sequences with backtracking capabilities rather than greedy single-step decision making

vs others: Provides more systematic exploration than greedy agents through graph search, though at higher computational cost; enables recovery from dead-end paths through backtracking