Name
Abstract | ||
|---|---|---|
In recent years, researchers have reformulated STRIPS planning problems as SAT problems or CSPs. In this paper, we discuss the Constraint-Based Interval Planning (CBIP) paradigm, which can represent planning problems incorporating interval time and resources. We describe how to reformulate mutual exclusion constraints for a CBIP-based system, the Extendible Uniform Remote Operations Planner Architecture (EUROPA). We show that reformulations involving dynamic variable domains restrict the algorithms which can be used to solve the resulting DCSP. We present an alternative formulation which does not employ dynamic domains, and describe the relative merits of the different reformulations. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/3-540-44914-0_17 | SARA |
Keywords | Field | DocType |
reformulating planning,dynamic variable domain,sat problem,different reformulations,dynamic constraint satisfaction,extendible uniform remote operations,alternative formulation,dynamic domain,planner architecture,constraint-based interval planning,strips planning problem,cbip-based system,planning,domains,constraint satisfaction,exclusion,algorithms,mutual exclusion | Constraint satisfaction,Mathematical optimization,Architecture,Scheduling (computing),Computer science,Planner,Constraint satisfaction problem,STRIPS,Mutual exclusion,restrict | Conference |
ISBN | Citations | PageRank |
3-540-67839-5 | 10 | 0.91 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| jeremy frank | 1 | 10 | 0.91 |
| Ari K. Jónsson | 2 | 287 | 18.45 |
| Paul H. Morris | 3 | 424 | 40.40 |
| dennis koga | 4 | 12 | 1.81 |