Using classical planners to solve nondeterministic planning problems

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 190-197

  Kuter, Ugur ^a   Nau, Dana ^a   Reisner, Elnatan ^a   Goldman, Robert P ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b SMART INFORMATION FLOW TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

CLASSICAL PLANNING; CYCLIC SOLUTIONS; NONDETERMINISTIC PLANNING;

PLANNING;

EID: 58849089265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Bertoli, P.; Cimatti, A.; Roveri, M.; and Traverso, P. 2006. Strong Planning under Partial Observability. Artificial Intelligence 170:337-384.
2. Bertoli, P.; Cimatti, A.; and Pistore, M. 2006. Strong Cyclic Planning under Partial Observability. ECAI.
3. Bryce, D.; Kambhampati, S.; and Smith, D. E. 2006. Planning Graph Heuristics for Belief Space Search. Journal of Artificial Intelligence Research 26:35-99.
4. Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2003. Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence 147(1-2):35-84.
5. Despouys, O., and Ingrand, F. 1999. Propice-Plan: Toward a unified framework for planning and execution. In ECP.
6. Fox, M; Long, D.; Bradley, S.; and McKinna, J. 2001. Using model checking for pre-planning analysis. In Proceedings of the AAAI Symposium on Model-based Validation of Intelligence.
7. Gerevini, A.; Saetti, A.; and Serina, I. 2003. Planning through Stochastic Local Search and Temporal Action Graphs. JAIR 20:239-290.
8. Giunchiglia, F., and Traverso, P. 1999. Planning as model checking. In ECP.
9. Goldman, R. P., and Boddy, M. S. 1994. Conditional linear planning. In AIPS.
10. Haigh, K. Z., and Veloso, M. 1996. Interleaving planning and robot execution for asynchronous user requests. In Planning with Incomplete Information for Robot Problems: Papers from the 1996 AAAI Spring Symposium, 35-44. AAAI Press.
11. *: A Heuristic Search Algorithm that Finds Solutions with Loops. Artificial Intelligence 129:35-62.
12. Hoffmann, J., and Brafman, R. 2005. Contingent Planning via Heuristic Forward Search with Implicit Belief States. In ICAPS.
13. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
14. Hsu, C. W.; Wah, B. W.; Huang, R.; and Chen, Y. X. 2006. New Features in SGPlan for Handling Soft Constraints and Goal Preferences in PDDL3.0.
15. Jensen, R.; Veloso, M. M.; and Bowling, M. H. 2001. OBDD-based optimistic and strong cyclic adversarial planning. In ECP.
16. Jensen, R.; Veloso, M. M.; and Bryant, R. 2003. Guided symbolic universal planning. In ICAPS.
17. Kabanza, F.; Barbeau, M.; and St-Denis, R. 1997. Planning control rules for reactive agents. Artificial Intelligence 95(1):67-113.
18. Kautz, H.; Selman, B.; and Hoffmann, J. 2006. Sat Plan: Planning as Satisfiability.
19. Koenig, S., and Simmons, R. G. 1995. Real-time search in non-deterministic domains. In IJCAI-1995.
20. Kuter, U., and Nau, D. 2004. Forward-chaining planning in nondeterministic domains. In AAAI-2004.
21. Kuter, U.; Nau, D.; Pistore, M.; and Traverso, P. 2005. A hierarchical task-network planner based on symbolic model checking. In ICAPS.
22. Palacios, H., and Geffner, H. 2006. Compiling Uncertainty Away: Solving Conformant Planning Problems Using a Classical Planner (Sometimes). In AAAI.
23. Palacios, H., and Geffner, H. 2007. From Conformant into Classical Planning: Efficient Translations that may be Complete Too. In ICAPS.
24. Penberthy, J. S., and Weld, D. 1992. UCPOP: A Sound, Complete, Partial Order Planner for ADL. In KR.
25. Peot, M., and Smith, D. 1992. Conditional nonlinear planning. In AIPS.
26. Pistore, M., and Traverso, P. 2001. Planning as Model Checking for Extended Goals in Non-deterministic Domains. In IJCAI.
27. Pryor, L., and Collins, G. 1996. Planning for contingency: a decision based approach. JAIR 4:81-120.
28. Rintanen, J. 1999. Improvements to the evaluation of quantified boolean formulae. In IJCAI.
29. Schoppers, M. 1987. Universal plans for reactive robots in unpredictable environments. In IJGAI, 1039-1046.
30. Yoon, S.; Fern, A.; and Givan, R. 2007. FF-Replan: A Baseline for Probabilistic Planning. In ICAPS.