A probabilistic restriction of branching plans

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


Terminal Node Image Space Probabilistic Evaluation Stochastic Environment Program Synthesis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 2.
    Piper, J., Integrated Planning and Acting in a Stochastic Environment. Research Rep., School of Artificial Intelligence, University of Edinburgh, 1972.Google Scholar
  3. 3.
    Štěpánková, O. and Havel, I.M., A Logical Theory of Robot Problem Solving. Artificial Intelligence, 7 1976, pp. 129–161.CrossRefGoogle Scholar
  4. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Ivan Kramosil
    • 1
  1. 1.Institute of Information Theory and AutomationCzechoslovak Academy of SciencesPrague 8

Personalised recommendations