Self-Learning of Robots and the Model of Hamiltonian Path with Fixed Number of Color Repetitions for Systems of Scenarios Creation

Abstract

In this paper, we propose a system of scenarios creation for self-learning of intelligent mobile robots. This model is based on the model of Hamiltonian path with fixed number of color repetitions for c-arc-colored digraphs. We show that the problem of Hamiltonian path with fixed number of color repetitions for c-arc-colored digraphs is NP-complete. We consider an approach to solve the problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.