Skip to main content

A probabilistic restriction of branching plans

  • Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 53))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fikes, R.E., Hart, P.E. and Nilsson, N.J., Some New Directions in Robot Problem Solving. In: Machine Intelligence 7 B.Meltzer and D.Michie, Eds., pp. 405–430, 1972. Edinburgh Univ. Press.

    Google Scholar 

  2. Piper, J., Integrated Planning and Acting in a Stochastic Environment. Research Rep., School of Artificial Intelligence, University of Edinburgh, 1972.

    Google Scholar 

  3. Štěpánková, O. and Havel, I.M., A Logical Theory of Robot Problem Solving. Artificial Intelligence, 7 1976, pp. 129–161.

    Article  Google Scholar 

  4. Kramosil,I., Probabilistic Restriction of Branching Plans for Goal-Oriented Automaton Behaviour. Research Rep., Institute of Information Theory and Automation, 1977. In Czech.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jozef Gruska

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kramosil, I. (1977). A probabilistic restriction of branching plans. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_154

Download citation

  • DOI: https://doi.org/10.1007/3-540-08353-7_154

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08353-5

  • Online ISBN: 978-3-540-37285-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics