A Planning Compilation to Reason about Goal Achievement at Planning Time
By: Alberto Pozanco , Marianela Morales , Daniel Borrajo and more
Potential Business Impact:
Finds the best steps to finish a task.
Identifying the specific actions that achieve goals when solving a planning task might be beneficial for various planning applications. Traditionally, this identification occurs post-search, as some actions may temporarily achieve goals that are later undone and re-achieved by other actions. In this paper, we propose a compilation that extends the original planning task with commit actions that enforce the persistence of specific goals once achieved, allowing planners to identify permanent goal achievement during planning. Experimental results indicate that solving the reformulated tasks does not incur on any additional overhead both when performing optimal and suboptimal planning, while providing useful information for some downstream tasks.
Similar Papers
Two Constraint Compilation Methods for Lifted Planning
Artificial Intelligence
Helps robots plan complex tasks faster.
Enhancing LLM-Based Agents via Global Planning and Hierarchical Execution
Information Retrieval
Helps AI agents finish complex jobs better.
Planning with Minimal Disruption
Artificial Intelligence
Finds plans that change things the least.