312 search results - page 7 / 63 » On Temporal Planning as CSP |
80
Voted
IEAAIE
2001
Springer
15 years 2 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
61
Voted
AIPS
2006
14 years 11 months ago
2006
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
60
Voted
IJCAI
2003
14 years 11 months ago
2003
Graphplan planning graphs are structures widely used in modern planners. The exclusion relations calculated in the planning graph extension provide very useful information, especi...
65
Voted
AIPS
2007
14 years 12 months ago
2007
The last eight years have seen dramatic progress in temporal planning as highlighted by the temporal track in the last three International Planning Competitions (IPC). However, ou...
IJCAI
2007
14 years 11 months ago
2007
In many planning situations, a planner is required to return a diverse set of plans satisfying the same goals which will be used by the external systems collectively. We take a do...