Skip to main content
SpringerLink
Log in

On the Polynomially Solvable Problem of Designing Behavior of the Intelligent Robot

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

A new method was proposed to validate executability of the set of disjuncts describing the world model of the intelligent robot, its aim, and possible actions. Conditions under which the method has a polynomial estimate of computational complexity were presented.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Gary, M. and Johnson, D., Computers and Intractability, New York: Wiley, 1978. Translated under the title Vychislitel'nye machiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.

    Google Scholar 

  2. Vagin, V.N., Deduktsiya i obobshchenie v sistemakh prinyatiya reshenii (Deduction and Generalization in Decision Systems), Moscow: Nauka, 1988.

    Google Scholar 

  3. German, O.V. and Ofitserov, D.V., Problem Solving: Methods, Programming and Future Concepts, New York: Elsevier, 1995.

    Google Scholar 

  4. German, O.V., Vvedenie v teoriyu ekspertnykh sistem i obrabotku znanii (An Introduction to the Theory of Expert Systems and Knowledge Processing), Minsk: Dizain-Pro, 1995.

    Google Scholar 

  5. Popov, E.V. and Firdman, G.R., Algoritmicheskie osnovy intellektualnykh robotov i iskusstvennogo intellekta (Algorithmic Fundamentals of Intelligent Robots and Artificial Intelligence), Moscow: Nauka, 1976.

    Google Scholar 

  6. Kondrashina, E.Yu., Litvintseva, E.V., and Pospelov, D.A., Predstavlenie znanii o vremeni i prostranstve v intellektualnykh sistemakh (Representation of the Knowledge of Time and Space in Intelligent Systems), Moscow: Nauka, 1989.

    Google Scholar 

  7. Chang, Ch.-L. and Lee, R.Ch.-T., Symbolic Logic and Mechanical Theorem Proving, New York: Academic, 1973. Translated under the title Matematicheskaya logika i avtomaticheskoe dokazatel'stvo teorem, Moscow: Nauka, 1978.

    Google Scholar 

  8. Kowalski, R., Logic for Problem Solving, New York: Elsevier, 1979. Translated under the title Logika v reshenii problem, Moscow: Mir, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Belarussian State University of Informatics and Radioelectronics, Minsk, Belarus

    O. V. German & D. V. Semeryuk

Authors
  1. O. V. German
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. V. Semeryuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

German, O.V., Semeryuk, D.V. On the Polynomially Solvable Problem of Designing Behavior of the Intelligent Robot. Automation and Remote Control 62, 181–189 (2001). https://doi.org/10.1023/A:1002886021219

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1002886021219

Keywords

Search

Navigation