69 search results - page 1 / 14 » Temporally-Expressive Planning as Constraint Satisfaction Pr... |
AIPS
2007
13 years 6 months ago
2007
Due to its important practical applications, temporal planning is of great research interest in artificial intelligence. Yet most of the work in this area so far is limited in at...
FLAIRS
2008
13 years 6 months ago
2008
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...
IJCAI
1993
13 years 5 months ago
1993
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we extend the traditional formalization of a Distributed Constraint Satisfaction Problems (DisCSP) to a Quantified DisCSP. A Quantified DisCSP includes several unive...
AAAI
2008
13 years 6 months ago
2008
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...