The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
In real world we have to deal with changing situations which may partially or entirely invalidate an executable plan. Current strategies for plan repair are basically aimed at sol...
Earthwork projects involve moving specific amounts of earth from a discrete set of source locations to a discrete set of destinations. Constructors use different methods and equip...
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...