|
News of the Kabardin-Balkar scientific center of RAS, 2015, Issue 1, Pages 16–22
(Mi izkab262)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
COMPUTER SCIENCE. MATHEMATICS
Task allocation in distributed artificial intelligence using collective behavior models
A. N. Dukkardta, M. I. Anchekovb, Z. V. Nagoevb, A. U. Zammoevb, O. V. Nagoevab, Yu. Kh. Khamukovb a Southern Federal University, Technological Institute at Taganrog,
347928, Taganrog, 44, Nekrasovsky Lane
b Institute of Computer Science and Problems of Regional Management of KBSC of the Russian Academy of Sciences,
360000, KBR, Nalchik, 37-a, I. Armand street
Abstract:
The paper presents a modified search architecture, based on the paradigm of multi-agent approach to
solving complex problems. This approach allows us to parallelize the process of finding solutions and
managing the problem pre-convergence algorithms. In this paper we propose a decomposition mechanism
of the original problem based on the bee algorithm to determine the most perspective solutions and
neighborhoods and further search process delegation to the agents that implement various optimization
techniques. Conducted series of experiments have shown the efficiency of the designed search engine,
compared with the genetic, evolutionary and swarms optimization algorithms. Parallel computing application for solving optimization problems improves the quality of the obtained solutions up to 8 percent.
Keywords:
multi-agent system, collective behaviour, swarm algorithm, bee’s algorithm, design engineering, parallel computing.
Received: 15.08.2014
Citation:
A. N. Dukkardt, M. I. Anchekov, Z. V. Nagoev, A. U. Zammoev, O. V. Nagoeva, Yu. Kh. Khamukov, “Task allocation in distributed artificial intelligence using collective behavior models”, News of the Kabardin-Balkar scientific center of RAS, 2015, no. 1, 16–22
Linking options:
https://www.mathnet.ru/eng/izkab262 https://www.mathnet.ru/eng/izkab/y2015/i1/p16
|
Statistics & downloads: |
Abstract page: | 43 | Full-text PDF : | 24 | References: | 8 |
|