69 search results - page 7 / 14 » Temporally-Expressive Planning as Constraint Satisfaction Pr... |
AIPS
2009
13 years 8 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
IAT
2003
IEEE
14 years 23 days ago
2003
IEEE
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
AIPS
1994
13 years 8 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
AAAI
2007
13 years 9 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
JAIR
2000
13 years 7 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...