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.

• Periodical: Advanced Materials Research (Volume 683)
• Pages: 909-912
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.683.909
• Online since: April 2013
• Authors: Anna Gorbenko, Vladimir Popov
• Keywords: Arc-Colored Digraph, Hamiltonian Path, Intelligent Mobile Robot, Learning Scenarios, Self-Learning

References

[1] A. Gorbenko, V. Popov, The Problem of Selection of a Minimal Set of Visual Landmarks, Appl. Math. Sci. 6 (2012) 4729-4732.

[2] A. Gorbenko, V. Popov, Computational Experiments for the Problem of Selection of a Minimal Set of Visual Landmarks, Appl. Math. Sci. 6 (2012) 5775-5780.

[3] V. Popov, Partially Distinguishable Guards, Appl. Math. Sci. 6 (2012) 6587-6591.

[4] A. Gorbenko, V. Popov, On the Problem of Placement of Visual Landmarks, Appl. Math. Sci. 6 (2012) 689-696.

[5] A. Gorbenko, V. Popov, A Real-World Experiments Setup for Investigations of the Problem of Visual Landmarks Selection for Mobile Robots, Appl. Math. Sci. 6 (2012) 4767-4771.

[6] A. Gorbenko, V. Popov, A. Sheka, Localization on Discrete Grid Graphs, LNEE 107 (2012) 971-978.

[7] A. Gorbenko, V. Popov, Footstep Planning for Humanoid Robots, Appl. Math. Sci. 6 (2012) 6567-6571.

[8] A. Gorbenko, V. Popov, Programming for Modular Reconfigurable Robots, Programming and Computer Software 38 (2012) 13-23.

DOI: 10.1134/s0361768812010033

[9] A. Gorbenko, V. Popov, Multi-agent Path Planning, Appl. Math. Sci. 6 (2012) 6733-6737.

[10] A. Gorbenko, M. Mornev, V. Popov, Planning a Typical Working Day for Indoor Service Robots, IAENG IJCS 38 (2011) 176-182.

[11] A. Gorbenko, V. Popov, Robot Self-Awareness: Usage of Co-training for Distance Functions for Sequences of Images, Adv. Studies Theor. Phys. 6 (2012) 1243-1246.

[12] A. Gorbenko, V. Popov, Robot Self-Awareness: Occam's Razor for Fluents, Int. Journal of Math. Analysis 6 (2012) 1453-1455.

[13] A. Gorbenko, V. Popov, A. Sheka, Robot Self-Awareness: Exploration of Internal States, Appl. Math. Sci. 6 (2012) 675-688.

[14] A. Gorbenko, V. Popov, Anticipation in Simple Robot Navigation and Learning of Effects of Robot's Actions and Changes of the Environment, Int. Journal of Math. Analysis 6 (2012) 2747-2751.

[15] A. Gorbenko, V. Popov, The Force Law Design of Artificial Physics Optimization for Robot Anticipation of Motion, Adv. Studies Theor. Phys. 6 (2012) 625-628.

[16] A. Gorbenko, V. Popov, Self-Learning Algorithm for Visual Recognition and Object Categorization for Autonomous Mobile Robots, LNEE 107 (2012) 1289-1295.

DOI: 10.1007/978-94-007-1839-5_139

[17] A. Gorbenko, V. Popov, The Hamiltonian Alternating Path Problem, IAENG IJAM 42 (2012) 204-213.

[18] A. Gorbenko, V. Popov, The Problem of Finding Two Edge-Disjoint Hamiltonian Cycles, Appl. Math. Sci. 6 (2012) 6563-6566.

[19] A. Gorbenko, V. Popov, Hamiltonian Alternating Cycles with Fixed Number of Color Appearances, Appl. Math. Sci. 6 (2012) 6729-6731.

[20] A. Gorbenko and V. Popov, Task-resource Scheduling Problem, Int. J. Automation and Computing 9 (2012) 429-441.

DOI: 10.1007/s11633-012-0664-y

[21] A. Gorbenko and V. Popov, The c-Fragment Longest Arc-Preserving Common Subsequence Problem, IAENG International Journal of Computer Science, Vol. 39, no. 3, pp.231-238, August (2012).

[22] A. Gorbenko and V. Popov, The set of parameterized k-covers problem, Theoretical Computer Science, vol. 423, no. 1, pp.19-24, March (2012).

DOI: 10.1016/j.tcs.2011.12.052