179 search results - page 11 / 36 » Using Classical Planners to Solve Nondeterministic Planning ... |
162
click to vote
KER
2007
15 years 5 months ago
2007
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
163
click to vote
CAEPIA
2005
Springer
15 years 11 months ago
2005
Springer
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
154
click to vote
FLAIRS
2009
15 years 3 months ago
2009
In our experiments with four well-known systems for solving partially observable planning problems (Contingent-FF, MBP, PKS, and POND), we were greatly surprised to find that they...
172
click to vote
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
15 years 11 months ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
134
click to vote
AIPS
1994
15 years 7 months ago
1994
Generating production-quality plans is an essential element in transforming planners from research tools into real-world applications. However most of the work to date on learning...