312 search results - page 45 / 63 » On Temporal Planning as CSP |
AIPS
2004
13 years 9 months ago
2004
We address the issue of incorporating domain-specific preferences in planning systems, where a preference may be seen as a "soft" constraint that it is desirable, but no...
KR
1991
Springer
13 years 11 months ago
1991
Springer
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
ISVC
2009
Springer
14 years 4 days ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
CONSTRAINTS
1998
13 years 7 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...