Search Results for author:
Found 5 papers, 0 papers with code
NL2Plan: Robust LLM-Driven Planning from Minimal Text Descriptions
Today's classical planners are powerful, but modeling input tasks in formats such as PDDL is tedious and error-prone.
Numeric Reward Machines
We compare our new approaches to a baseline reward machine in the Craft domain, where the numeric feature is the agent-to-target distance.
Consolidating LAMA with Best-First Width Search
This is the approach used by LAMA, a classical planner that, a decade after its release, is still considered state-of-the-art in agile planning.
Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width: Extended Version
Recently, sketches have been introduced as a general language for representing the subgoal structure of instances drawn from the same domain.
Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches: Extended Version
Width-based planning methods deal with conjunctive goals by decomposing problems into subproblems of low width.
