33 search results - page 1 / 7 » Planning as Satisfiability with Relaxed $-Step Plans |
AUSAI
2007
Springer
13 years 9 months ago
2007
Springer
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
AAAI
1998
13 years 6 months ago
1998
AI planning techniques are beginning to find use in a number of practical planning domains. However, the backward-chaining and partial-order-planning control strategies traditiona...
IAT
2007
IEEE
13 years 8 months ago
2007
IEEE
The purpose of this paper is to introduce a multi-agent model for plan synthesis in which the production of a global shared plan is based on a promising unified framework based on...
AIPS
2009
13 years 6 months ago
2009
Planning based on propositional SAT(isfiability) is a powerful approach to computing step-optimal plans given a parallel execution semantics. In this setting: (i) a solution plan ...
AAAI
1996
13 years 6 months ago
1996
One of the most widespread approaches to reactive planning is Schoppers' universal plans. We propose a stricter definition of universal plans which guarantees a weak notion o...