e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publication
Contribución de congreso (ConferenceOutput)
Eliminating Redundant Actions from Plans Using Classical Planning
Even though automated planning is PSPACE-complete in general, satisfcing planners are able to solve large planning tasks quickly. However, the found plans are often far from optimal and may even contain actions that can be removed while maintaining a valid plan. The problem of fnding and eliminating the most expensive set of such redundant actions in a plan is NP-complete and there is a compilation to MaxSAT that solves it. Here, we introduce a simple and natural formulation of the problem as a planning task. Solving it with an optimal planner guarantees fnding a minimal reduction. Our experiments show that this is competitive with the previous state of the art for optimal action elimination.
Project:
EC / H2020 952215
View at: https://hdl.handle.net/10016/48363