Academic Journals Database
Disseminating quality controlled scientific knowledge

A graph-based model of object recognition self-learning

Author(s): A. Gorbenko

Journal: Advanced Studies in Theoretical Physics
ISSN 1313-1311

Volume: 7;
Issue: 3;
Start page: 115;
Date: 2013;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: robot | satisfiability problem | NP-complete | arc-colored digraphs | monochromatic paths

In this paper, we study the object recognition self-learning for robots.In particular, we consider the self-learning during solution of typicaltasks. We propose a graph-based model for self-learning. This model isbased on the problem of monochromatic path for given set of weights.We prove that the problem is NP-complete. We consider an approachto solve the problem. This approach is based on an explicit reductionfrom the problem to the satisfiability problem.

Tango Jona
Tangokurs Rapperswil-Jona


HR software für Hotellerie

Automatische Erstellung
von Personaldokumente
und Anmeldungen bei Behörden