Abstract
In classical planning, actions are assumed to be deterministic, the initial state is known and the goal is defined by a set of state facts, and the solution consists of a sequence of actions that leads the system from the initial state to the goal state. However, most practical problems, especially in non observable and uncertain contexts, do not satisfy these requirements of complete and deterministic information. The main goal of this work is to develop a generic planning under uncertainty model at the knowledge level enabling plan viability evaluation so that the most possible, effective, and complete plan can be determined. The proposed model in this work is presented at different levels of analysis: meta ontological, ontological, epistemological and logical levels, and applied to the post and ex ante approaches. The planning task is composed of a set of planning subtasks: plan generation, plan prevention, plan support, plan correction, and plan replacement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Da Costa, C., Garcia, F., Lang, J., and Martin-Clouaire, R.: Planning with graded nondeterministic actions: A possibilistic approach. International Journal of Intelligent Systems. Special Issue on “Fuzzy Information Engineering”, vol 12 (12) (december 1997)
McCarthy, J.: Epistemological problems of AI. Morgan Kaufmann, IJCAI 5, 46–52. Cambridge (1977)
Ginsberg, M. L., Smith, D.E.: Reasoning About Action II: The Qualification Problem. CS Standford University, Standford (1988)
McCarthy, J.: Some philosophical problems from the standpoint of AI. Machine Intelligence 4. 26–45. New York (1969)
Kushmerick, N., Hanks, S. & Weld, D.: An algorithm for probabilistic planning. J. Artificial Intelligence, 76(1–2): 239–86 (1995)
Thiébaux, S., Hertzberg, J., Shoaff, W., Schneider, M.: A Stochastic Model of Actions and Plans for Anytime Planning under Uncertainty. TR-93-027, Melbourne (1993)
Newell, A.: The Knowledge Level. Artificial Intelligence, 18(1): 82–127 (1982)
Breuker, J., Van de Velde, W.: CommonKADS Library for Expertise Modelling. IOS Press (1994)
Fikes, R., Nilsson, N.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2 (3/4): 189–208 (1971)
McAllester, D., Rosenblitt, D.: Systematic Nonlinear Planning. AAAI-91 (1991)
Peot, M. A. and Smith, D. E.: Conditional nonlinear planning. In Proceedings of the First International Conference on Artificial Intelligence Planning Systems, pp. 189–197 College Park, Maryland. Morgan Kaufmann (1992)
Pryor, L., Collins, G.: Planning for Contingencies: A Decision-based Approach. Journal of Artificial Intelligence Research 4. 287–339 (1996)
Onder, N., and Pollack, M. E.: Contingency Selection in Plan Generation. Proceedings of the 4th European Conference on Planning, Toulouse, France, September (1997)
Onder, N., Pollack, M. E., and Horty, J.: A Unified Algorithm for Conditional and Probabilistic Planning. AIPS Workshop on Integrating Planning, Scheduling, and Execution in Dynamic and Uncertain Environments, June, (1998)
Russell, S. J., Norvig, P.: Artificial Intelligence. A Modern Approach. Prentice Hall (1995).
Sacerdoti, E. D.: The nonlinear nature of plans. Proceedings of the Fourth Joint Conference on Artificial Intelligence (IJCAI-75), 206–214, Tbilisi, Georgia (1975)
Klir, G. J., Folger, T. A.: Fuzzy Sets, Uncertainty and Information. Prentice Hall (1988)
Dubois, D., Prade, H.: Possibility Theory. An approach to computerized processing of uncertainty. Plenum Press (1998)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paniagua-Arís, E., Palma-Méndez, J.T., Martín-Rubio, F. (2001). A Planning under Uncertainty Model. In: Moreno-Díaz, R., Buchberger, B., Luis Freire, J. (eds) Computer Aided Systems Theory — EUROCAST 2001. EUROCAST 2001. Lecture Notes in Computer Science, vol 2178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45654-6_16
Download citation
DOI: https://doi.org/10.1007/3-540-45654-6_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42959-3
Online ISBN: 978-3-540-45654-4
eBook Packages: Springer Book Archive