Name
Abstract | ||
|---|---|---|
We investigate the problem of cost-optimal planning in ASP. Current ASP planners can be trivially extended to a cost-optimal one by adding weak constraints, but only for a given makespan (number of steps). It is desirable to have a planner that guarantees global optimality. In this paper, we present two approaches to addressing this problem. First, we show how to engineer a cost-optimal planner composed of two ASP programs running in parallel. Using lessons learned from this, we then develop an entirely new approach to cost-optimal planning, stepless planning, which is completely free of makespan. Experiments to compare the two approaches with the only known cost-optimal planner in SAT reveal good potentials for stepless planning in ASP. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1017/S1471068419000395 | THEORY AND PRACTICE OF LOGIC PROGRAMMING |
Keywords | Field | DocType |
Cost-Optimal Planning,Answer Set Programming,CORE-2 ASP Standard | Mathematical optimization,Computer science,Optimal planning,Theoretical computer science | Journal |
Volume | Issue | ISSN |
19 | SP5-6 | 1471-0684 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Spies | 1 | 0 | 0.34 |
| Jia-Huai You | 2 | 708 | 143.63 |
| Ryan Hayward | 3 | 2 | 1.09 |