A Simplification of the delete relaxation in classical planning

Abstract

We propose a simplification method for the delete relaxation in classical planning. Although the delete relaxation semantically changes some properties of a problem such as finiteness of fuel of a vehicle, useless propositions and actions remain in the delete relaxation. We show that our domain-based simplification method removes such useless properties and generates smaller domain models for the delete relaxations of some International Planning Competition benchmark domains.