Sciweavers

33 search results - page 1 / 7
» Planning as Satisfiability with Relaxed $-Step Plans
Sort
View
AUSAI
2007
Springer
14 years 1 months ago
Planning as Satisfiability with Relaxed $-Step Plans
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...
Martin Wehrle, Jussi Rintanen
AAAI
1998
13 years 10 months ago
Control Strategies in HTN Planning: Theory Versus Practice
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...
Dana S. Nau, Stephen J. J. Smith, Kutluhan Erol
IAT
2007
IEEE
14 years 1 months ago
A Unified Framework Based on HTN and POP Approaches for Multi-Agent Planning
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...
Damien Pellier, Humbert Fiorino
AIPS
2009
13 years 10 months ago
SAT-Based Parallel Planning Using a Split Representation of Actions
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 ...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
AAAI
1996
13 years 10 months ago
On the Size of Reactive Plans
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...
Peter Jonsson, Christer Bäckström