Sciweavers

37 search results - page 2 / 8
» Forward-Chaining Planning in Nondeterministic Domains
Sort
View
IJCAI
2001
13 years 6 months ago
Planning as Model Checking for Extended Goals in Non-deterministic Domains
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal proper...
Marco Pistore, Paolo Traverso
AAAI
2008
13 years 7 months ago
Fusing Procedural and Declarative Planning Goals for Nondeterministic Domains
While in most planning approaches goals and plans are different objects, it is often useful to specify goals that combine declarative conditions with procedural plans. In this pap...
Dmitry Shaparau, Marco Pistore, Paolo Traverso
JAIR
2000
96views more  JAIR 2000»
13 years 4 months ago
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
Rune M. Jensen, Manuela M. Veloso
AIPS
2008
13 years 7 months ago
Using Classical Planners to Solve Nondeterministic Planning Problems
Researchers have developed a huge number of algorithms to solve classical planning problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic soluti...
Ugur Kuter, Dana S. Nau, Elnatan Reisner, Robert P...
AIPS
2006
13 years 6 months ago
Bounded Branching and Modalities in Non-Deterministic Planning
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
Blai Bonet