Name
Abstract | ||
|---|---|---|
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To date, however, no guided algorithms exist for synthesiz- ing universal plans. In this paper, we introduce a general approach for guiding universal planning based on an exist- ing method for heuristic symbolic search in deterministic do- mains. We present three new sound and complete algorithms for best-first strong, strong cyclic, and weak universal plan- ning. Our experimental results show that guiding the search dramatically can reduce both the computation time and the size of the generated plans. |
Year | Venue | Field |
|---|---|---|
2003 | ICAPS | Mathematical optimization,Heuristic,Computer science,Binary decision diagram,Computation |
DocType | Citations | PageRank |
Conference | 5 | 0.45 |
References | Authors | |
10 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rune M. Jensen | 1 | 174 | 9.27 |
| Manuela Veloso | 2 | 8563 | 882.50 |
| Randal E. Bryant | 3 | 9204 | 1194.64 |