60 search results - page 8 / 12 » Stochastic Planning with First Order Decision Diagrams |
AIPS
2008
13 years 9 months ago
2008
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
ISAAC
2003
Springer
14 years 20 days ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Chaining can reduce the number of iterations required for symbolic state-space generation and model-checking, especially in Petri nets and similar asynchronous systems, but require...
AIPS
2008
13 years 9 months ago
2008
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
UAI
2004
13 years 8 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...