Self-Learning of Robots and the Model of Hamiltonian Path with Fixed Number of Color Repetitions for Systems of Scenarios Creation
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.
self-learning intelligent mobile robot Hamiltonian path learning scenarios arc-colored digraph
Anna Gorbenko Vladimir Popov
Ural Federal University, 620083, Ekaterinburg, Russia
国际会议
北京
英文
909-912
2012-12-16(万方平台首次上网日期,不代表论文的发表时间)