Possibilistic planning: Representation and complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1348 LNAI, Issue , 1997, Pages 143-155

  Da Costa Pereira, Célia ^a   Garcia, Frédérick ^a   Lang, Jérôme ^b   Martin Clouaire, Roger ^a  

^a CEMAGREF   (France)

^b UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

INITIAL STATE; ON STATE; PLAN GENERATION ALGORITHM; POSSIBILISTIC; POSSIBILISTIC APPROACH; POSSIBILITY DISTRIBUTIONS; PROBABILISTIC PLANNING;

ARTIFICIAL INTELLIGENCE;

EID: 84898686965     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63912-8_82     Document Type: Conference Paper

References (32)

1. C, Bäckström. Computational complexity of reasoning about plans. PhD thesis, University of Linköping, 1992
2. B. Bonet and H. Geffner. Arguing for decisions: a qualitative model for decision making. In Proc. of UAI'96, 1996.
3. C. Boutilier, T. Dean, and S. Hanks. New Directions in AI Planning, chapter Planning under uncertainty: structural assumptions and computational leverage, pages 157-172. IOS Press, Amsterdam, 1996.
4. C. Boutilier and R. Dearden. Using abstractions for decision-theoretic planning with time constraints. In Proceedings AAAI, pages 1016-1022, 1994.
5. C. Boutilier and D. Poole. Computing optimal policies for partially observable decision processes using compact representations. In Proceedings AAAI'96, pages 1168-1175, 1996.
6. T. Bylander. The computational complexity of propositional strips planning. Artificial Intelligence, 69:161-204, 1994.
7. A.R. Cassandra, L.P. Kaelbling, and M.L. Littman. Acting optimally in partially observable stochastic domains. In Proceedings AAAI, pages 1023-1028, 1994.
8. D. Chapman. Planning for Conjunctive Goals. Artificial Intelligence, 32, 1987.
9. L. Chrisman. Abstract probabilistic modeling of action. In Proceedings AAAI, pages 28-36, 1992.
10. C. Da Costa Pereira, F. Garcia, J. Lang, and R. Martin-Clouaire. Planning with graded nondeterministic actions: a possibilistic approach. Int. J. of Intelligent Systems, 12(12), 1997.
11. M. De Glas and E. Jacopin. An algebric framework for uncertain strips planning. In Proceedings AIPS, 1994.
12. T. Dean and M. Boddy. Reasoning about Partially Ordered Events. Artificial Intelligence, 36:375-399, 1988.
13. A. Doan. Modeling probabilistic actions for practical decision-theoretic planning. In Proc. of A IPS'96, 1996.
14. D. Dubois and H. Prade. Possibility theory-an approach to computerized processing of uncertainty. Plenum Press, 1988.
15. D. Dubois and H. Prade. Fuzzy sets and probability: misunderstanding, bridges and gaps. In Proceeding of 2nd IEEE Int. Con}, on Fuzzy Systems, pages 1059-1068, 1993.
16. H. Eroi, D. Nau, and V.S. Subrahmanian. Complexity, decidability and undecid-ability results for domain-independent planning. Artificial Intelligence, 76:75-88, 1995.
17. H. Fargier, J. Lang, and R. Sabbadin. Towards qualitative approaches to multistage decision making. In Proc. of IPMU'96, 1996.
18. F. Garcia and P. Laborie. New Directions in AI Planning, chapter Hiérarchisation of the Search Space in Temporal Planning, pages 217-232. IOS Press, Amsterdam, 1996.
19. R. Goldman and M. Boddy. Epsilon-safe planning. In Proc. of UAI'94, pages 253-261, 1994.
20. J. Goldsmith, M. Littman, and M. Mundhenk. The complexity of plan existence and evaluation in probabilistic domains. In Proc. of UAI'97, pages 182-189, 1997.
21. P. Haddawy, A. Doan, and R. Goodwin. Efficient decision-theoretic planning: Techniques and empirical analysis. In Proc. of UAI'95, pages 229-236, 1995.
22. P. Haddawy and P. Hanks. Issues in decision-theoretic planning: utility functions for deadline goals. In Proc. of the Srd Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'92), pages 71-82, 1992.
23. S. Kambhampati and D.S. Nau. On the nature and role of modal truth criteria in planning. Artificial Intelligence, 1996.
24. C. Knoblock. Automatically generating abstractions for planning. Artificial Intelligence, 68:243-302, 1994.
25. N. Kushmerick, S. Hanks, and D.W Weld. An algorithm for probabilistic planning. Artificial Intelligence, 76:239-286, 1995.
26. M.L. Littman. Probabilistic propositional planning: representations and complexity. In Proceedings AAAI, pages 748-754, 1997.
27. D. McAllester and D. Rosenblitt. Systematic nonlinear planning. In Proceedings AAAI, pages 634-639, 1991.
28. C.H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
29. J.S. Penberthy and D. Weld. UCPOP: A sound, complete, partial-order planner for ADL. In Proc. of the 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'92), pages 103-114, 1992.
30. L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1-22, 1977.
31. S. Thiebaux, J. Hertzberg, W. Shoaff, and M. Schneider. A stochastic model of actions and plans for anytime planning under uncertainty. Int. I. of Intelligent Systems, 10(2):155-183, 1995.
32. Q. Yang and J. D. Tenenberg. Abstracting a nonlinear least commitment planner. In Proceedings AAAI, pages 204-209, 1990.