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

Authors:
O. V. German;D. V. Semeryuk
Affiliations:
Belarussian State University of Informatics and Radioelectronics, Minsk, Belarus;Belarussian State University of Informatics and Radioelectronics, Minsk, Belarus
Venue:
Automation and Remote Control
Year:
2001

Citing 3
Cited 1

Logic for Problem Solving

Logic for Problem Solving
Problem Solving: Methods, Programming, and Future Concepts

Problem Solving: Methods, Programming, and Future Concepts
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving

Logical synthesis of the control algorithm in a system with Boolean variables

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

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.