It is generally agreed that a planner should be able to reason with uncertain and iterative behaviours because many actions in real world have such behaviours. Some of earlier non-linear planners have approached these issues, nevertheless, the way that they handle the problem has not been logically derived. We introduce a new type of non-linear plans, Recursive Plans, which can be used to solve a class of conditional and recursive problems. The idea, which has been implemented, is based on mathematical induction.
Unable to display preview. Download preview PDF.
- Bratko, I. (1987) Prolog Programming for Artificial Intelligence, Academic Press, INC. LondonGoogle Scholar
- Drummond, M. (1986) A representation of action and belief for automatic planning systems, in: (Georgeff, M. and Lansky, A.), Morgan KauffmanGoogle Scholar
- Ghassem-Sani, G. R. (1988) Iterative actions in non-linear planners, M.Sc. Thesis, Department of Computer Science, University of EssexGoogle Scholar
- Ghassem-Sani, G. R. and Steel, S. W. D. (forthcoming) Recursive Plans, Internal Report, University of EssexGoogle Scholar
- Huet, G. P. (1974) A unification algorithm for typed lambda-calculus, note de travial A 055, Institute de Recherche d’Informatique et d’AutomatiqueGoogle Scholar
- McCarthy J. (1963) Situations, actions, and causal laws, Technical report, Stanford university, Stanford, Calf.Google Scholar
- Sacerdoti, E. D. (1977) A Structure for Plans and Behaviour, American Elsevier North-Holland, New YorkGoogle Scholar
- Steel, S. W. D. (1988) An iterative construct for non-linear precedence planners, Proc. Seventh Biennial Conference of the Canadian Society for the Computational Study of Intelligence, PP. 227–233Google Scholar
- Warren, D. H. D. (1976) Generating Conditional Plans and Programmes, In Proceedings of the AISB summer conference, PP. 344–354Google Scholar