全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

A graph-based model of object recognition self-learning

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

Full-Text   Cite this paper   Add to My Lib

Abstract:

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.

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413