NEURAL NETWORK-BASED METHODS FOR FINDING THE SHORTEST PATH and establishing associative connections between objects

Q3 Computer Science
E. Fedorov, O. Nechyporenko, Maryna Chychuzhko, Vladyslav Chychuzhko, Ruslan Leshchenko
{"title":"NEURAL NETWORK-BASED METHODS FOR FINDING THE SHORTEST PATH and establishing associative connections between objects","authors":"E. Fedorov, O. Nechyporenko, Maryna Chychuzhko, Vladyslav Chychuzhko, Ruslan Leshchenko","doi":"10.32620/reks.2023.2.05","DOIUrl":null,"url":null,"abstract":"Nowadays, solving optimizations problems is one of the tasks for intelligent computer systems. Currently, there is a problem of insufficient efficiency of optimizations tasks solving methods (for example, high computing time and/or accuracy). The object of the research is the process of finding the shortest path and establishing associative connections between objects. The subject of the research is the methods of finding the shortest path and establishing associative connections between objects based on neural networks with associative memory and neural network reinforcement training. The objective of this work is to improve the efficiency of finding the shortest path and establishing associative connections between objects through neural networks with associative memory and neural network reinforcement training. To achieve this goal, a neuro-associative method and a neural network reinforcement training method was developed. The advantages of the proposed methods include the following. First, the proposed bi-directional recurrent correlative associative memory, which uses hetero-associative and auto-associative memory and an exponential weighting function, allows for increasing the associative memory capacity while preserving learning accuracy. Second, the Deep Q-Network (DQN) reinforcement learning method with dynamic parameters uses the ε-greedy approach, which in the initial iterations is close to random search, and in the final iterations is close to directed search, which is ensured by using dynamic parameters and allows increasing the learning speed while preserving learning accuracy. Conducted numerical research allowed us to estimate both methods (for the first method, the root mean square error was 0.02, and for the second method it was 0.05). The proposed methods allow expanding the field of application of neural networks with associative memory and neural network reinforcement learning, which is confirmed by their adaptation for the tasks of finding the shortest path and establishing associative connections between objects and contribute to the effectiveness of intelligent computer systems of general and special purpose. Prospects for further research are to investigate the proposed methods for a wide class of artificial intelligence problems.","PeriodicalId":36122,"journal":{"name":"Radioelectronic and Computer Systems","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Radioelectronic and Computer Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32620/reks.2023.2.05","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

Abstract

Nowadays, solving optimizations problems is one of the tasks for intelligent computer systems. Currently, there is a problem of insufficient efficiency of optimizations tasks solving methods (for example, high computing time and/or accuracy). The object of the research is the process of finding the shortest path and establishing associative connections between objects. The subject of the research is the methods of finding the shortest path and establishing associative connections between objects based on neural networks with associative memory and neural network reinforcement training. The objective of this work is to improve the efficiency of finding the shortest path and establishing associative connections between objects through neural networks with associative memory and neural network reinforcement training. To achieve this goal, a neuro-associative method and a neural network reinforcement training method was developed. The advantages of the proposed methods include the following. First, the proposed bi-directional recurrent correlative associative memory, which uses hetero-associative and auto-associative memory and an exponential weighting function, allows for increasing the associative memory capacity while preserving learning accuracy. Second, the Deep Q-Network (DQN) reinforcement learning method with dynamic parameters uses the ε-greedy approach, which in the initial iterations is close to random search, and in the final iterations is close to directed search, which is ensured by using dynamic parameters and allows increasing the learning speed while preserving learning accuracy. Conducted numerical research allowed us to estimate both methods (for the first method, the root mean square error was 0.02, and for the second method it was 0.05). The proposed methods allow expanding the field of application of neural networks with associative memory and neural network reinforcement learning, which is confirmed by their adaptation for the tasks of finding the shortest path and establishing associative connections between objects and contribute to the effectiveness of intelligent computer systems of general and special purpose. Prospects for further research are to investigate the proposed methods for a wide class of artificial intelligence problems.
基于神经网络的寻找最短路径和建立对象之间关联连接的方法
解决优化问题是当今智能计算机系统的任务之一。目前,存在优化任务求解方法效率不足的问题(例如,计算时间和/或精度高)。研究的对象是寻找最短路径并在对象之间建立联想连接的过程。研究的主题是基于具有联想记忆的神经网络和神经网络强化训练来寻找最短路径和建立对象之间的联想连接的方法。这项工作的目的是通过具有联想记忆的神经网络和神经网络强化训练,提高寻找最短路径和建立对象之间的联想连接的效率。为了实现这一目标,开发了一种神经联想方法和神经网络强化训练方法。所提出的方法的优点包括以下方面。首先,所提出的双向递归相关联想记忆使用异联想记忆和自联想记忆以及指数加权函数,在保持学习准确性的同时增加了联想记忆容量。其次,具有动态参数的深度Q网络(DQN)强化学习方法使用ε-贪婪方法,该方法在初始迭代中接近随机搜索,在最终迭代中接近定向搜索,这是通过使用动态参数来确保的,并允许在保持学习精度的同时提高学习速度。进行的数值研究使我们能够估计这两种方法(第一种方法的均方根误差为0.02,第二种方法为0.05)。所提出的方法允许通过联想记忆和神经网络强化学习扩展神经网络的应用领域,这通过它们对寻找最短路径和在对象之间建立关联连接的任务的适应性来证实,并有助于通用和专用智能计算机系统的有效性。进一步研究的前景是研究所提出的一类人工智能问题的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Radioelectronic and Computer Systems
Radioelectronic and Computer Systems Computer Science-Computer Graphics and Computer-Aided Design
CiteScore
3.60
自引率
0.00%
发文量
50
审稿时长
2 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信