Skip to main content
Book cover

AISB91 pp 136–146Cite as

Recursive Plans

  • Conference paper
  • 33 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Boyer, R. S. and Moore, J. S. (1979) ACM monograph series, A Computational Logic, Academic Press, INC. London

    Google Scholar 

  • Bratko, I. (1987) Prolog Programming for Artificial Intelligence, Academic Press, INC. London

    Google Scholar 

  • Drammond, M. (1986) A representation of action and belief for automatic planning systems, in: (Georgeff, M. and Lansky, A.), Morgan Kauffman

    Google Scholar 

  • Ghassem-Sani, G. R. (1988) Iterative actions in non-linear planners, M.Sc. Thesis, Department of Computer Science, University of Essex

    Google Scholar 

  • Ghassem-Sani, G. R. and Steel, S. W. D. (forthcoming) Recursive Plans, Internal Report, University of Essex

    Google Scholar 

  • Huet, G. P. (1974) A unification algorithm for typed lambda-calculus, note de travial A 055, Institute de Recherche d’Informatique et d’Automatique

    Google Scholar 

  • Manna, Z. and Waldinger, R. (1980) A deductive approach to programme synthesis, ACM Transactions on Programming Languages and Systems, 2(1), PP. 90–121

    Article  MATH  Google Scholar 

  • Manna, Z. and Waldinger, R. (1986) A Theory of plans, in: (Georgeff, M. and Lansky, A.), Morgan Kauffman

    Google Scholar 

  • McCarthy J. (1963) Situations, actions, and causal laws, Technical report, Stanford university, Stanford, Calf.

    Google Scholar 

  • Robinson, J. A. (1965) A machine oriented logic based on the resolution principle, J. ACM 12, No 1, PP. 23–41

    Article  MATH  Google Scholar 

  • Sacerdoti, E. D. (1977) A Structure for Plans and Behaviour, American Elsevier North-Holland, New York

    Google 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–233

    Google Scholar 

  • Warren, D. H. D. (1976) Generating Conditional Plans and Programmes, In Proceedings of the AISB summer conference, PP. 344–354

    Google Scholar 

  • Wilkins, D. E. (1984) Domain-independent Planning: Representation and Plan Generation, Artificial Intelligence 22(3), PP. 269–301

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag London Limited

About this paper

Cite this paper

Ghassem-Sani, G.R., Steel, S.W.D. (1991). Recursive Plans. In: Steels, L., Smith, B. (eds) AISB91. Springer, London. https://doi.org/10.1007/978-1-4471-1852-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-1852-7_13

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19671-6

  • Online ISBN: 978-1-4471-1852-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics