Domain-Independent Cost-Optimal Planning in ASP

摘要: We investigate the problem of cost-optimal planning in ASP. Current ASP planners can be trivially extended to a one by adding weak constraints, but only for given makespan (number steps). It is desirable have planner that guarantees global optimality. In this paper, we present two approaches addressing problem. First, show how engineer composed programs running parallel. Using lessons learned from this, then develop an entirely new approach planning, stepless which completely free makespan. Experiments compare with known SAT reveal good potentials The paper under consideration acceptance TPLP.