Abstract
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded nondeterministic effects, some being more possible (normal) than the others. The uncertainty on states and effects of actions is represented by possibility distributions. The paper first recalls the essence of possibilitic planning concerning the representational aspects and the plan generation algorithms used to search either plans that lead to a goal state with a certainty greater than a given threshold or optimally safe plans that have maximal certainty to succeed. The computational complexity of possibilistic planning is then studied, showing quite favorable results compared to probabilistic planning.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. Bäckström. Computational complexity of reasoning about plans. PhD thesis, University of Linköping, 1992.
B. Bonet and H. Geffner. Arguing for decisions: a qualitative model for decision making. In Proc. of UAI'96, 1996.
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.
C. Boutilier and R. Dearden. Using abstractions for decision-theoretic plCéliaanning with time constraints. In Proceedings AAAI, pages 1016–1022, 1994.
C. Boutilier and D. Poole. Computing optimal policies for partially observable decision processes using compact representations. In Proceedings AAAI'96, pages 1168–1175, 1996.
T. Bylander. The computational complexity of propositional strips planning. Artificial Intelligence, 69:161–204, 1994.
A.R. Cassandra, L.P. Kaelbling, and M.L. Littman. Acting optimally in partially observable stochastic domains. In Proceedings AAAI, pages 1023–1028, 1994.
D. Chapman. Planning for Conjunctive Goals. Artificial Intelligence, 32, 1987.
L. Chrisman. Abstract probabilistic modeling of action. In Proceedings AAAI, pages 28–36, 1992.
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.
M. De Glas and E. Jacopin. An algebric framework for uncertain strips planning. In Proceedings AIPS, 1994.
T. Dean and M. Boddy. Reasoning about Partially Ordered Events. Artificial Intelligence, 36:375–399, 1988.
A. Doan. Modeling probabilistic actions for practical decision-theoretic planning. In Proc. of AIPS'96, 1996.
D. Dubois and H. Prade. Possibility theory — an approach to computerized processing of uncertainty. Plenum Press, 1988.
D. Dubois and H. Prade. Fuzzy sets and probability: misunderstanding, bridges and gaps. In Proceeding of 2nd IEEE Int. Conf. on Fuzzy Systems, pages 1059-1068, 1993.
H. Erol, D. Nau, and V.S. Subrahmanian. Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence, 76:75–88, 1995.
H. Fargier, J. Lang, and R. Sabbadin. Towards qualitative approaches to multistage decision making. In Proc. of IPMU'96, 1996.
F. Garcia and P. Laborie. New Directions in AI Planning, chapter Hierarchisation of the Search Space in Temporal Planning, pages 217–232. IOS Press, Amsterdam, 1996.
R. Goldman and M. Boddy. Epsilon-safe planning. In Proc. of UAI'94, pages 253–261, 1994.
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.
P. Haddawy, A. Doan, and R. Goodwin. Efficient decision-theoretic planning: Techniques and empirical analysis. In Proc. of UAI'95, pages 229–236, 1995.
P. Haddawy and P. Hanks. Issues in decision-theoretic planning: utility functions for deadline goals. In Proc. of the.3rd Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'92), pages 71–82, 1992.
S. Kambhampati and D.S. Nau. On the nature and role of modal truth criteria in planning. Artificial Intelligence, 1996.
C. Knoblock. Automatically generating abstractions for planning. Artificial Intelligence, 68:243–302, 1994.
N. Kushmerick, S. Hanks, and D.W Weld. An algorithm for probabilistic planning. Artificial Intelligence, 76:239–286, 1995.
M.L. Littman. Probabilistic propositional planning: representations and complexity. In Proceedings AAAI, pages 748–754, 1997.
D. McAllester and D. Rosenblitt. Systematic nonlinear planning. In Proceedings AAAI, pages 634–639, 1991.
C.H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
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.
L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1–22, 1977.
S. Thiébaux, J. Hertzberg, W. Shoaff, and M. Schneider. A stochastic model of actions and plans for anytime planning under uncertainty. Int. J. of Intelligent Systems, 10(2):155–183, 1995.
Q. Yang and J. D. Tenenberg. Abstracting a nonlinear least commitment planner. In Proceedings AAAI, pages 204–209, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Da Costa Pereira, C., Garcia, F., Lange, J., Martin-Clouaire, R. (1997). Possibilistic planning: Representation and complexity. In: Steel, S., Alami, R. (eds) Recent Advances in AI Planning. ECP 1997. Lecture Notes in Computer Science, vol 1348. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63912-8_82
Download citation
DOI: https://doi.org/10.1007/3-540-63912-8_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63912-1
Online ISBN: 978-3-540-69665-0
eBook Packages: Springer Book Archive