Please use this identifier to cite or link to this item: https://dspace.ncfu.ru/handle/20.500.12258/14567
Title: Consensus achievement method for a robotic swarm about the most frequently feature of an environment
Authors: Petrenko, V. I.
Петренко, В. И.
Tebueva, F. B.
Тебуева, Ф. Б.
Ryabtsev, S. S.
Рябцев, С. С.
Gurchinsky, M. M.
Гурчинский, М. М.
Struchkov, I. V.
Стручков, И. В.
Keywords: Consensus achievement method;Multi-agent robotic systems
Issue Date: 2020
Publisher: IOP Publishing Ltd
Citation: Petrenko, V.I., Tebueva, F.B., Ryabtsev, S.S., Gurchinsky, M.M., Struchkov, I.V. Consensus achievement method for a robotic swarm about the most frequently feature of an environment // IOP Conference Series: Materials Science and Engineering. - 2020. - Volume 919. - Issue 4. - Номер статьи 042025
Series/Report no.: IOP Conference Series: Materials Science and Engineering
Abstract: Decentralized multi-agent robotic systems have many advantages over centralized ones. Such systems make it possible to distribute computational and communication operations between all its elements, and are also more resistant to the loss of individual elements of a swarm, but they complicate the implementation of complex high-level tasks. An example of such a problem is the selection of one of the possible alternatives, in which the swarm must choose the most favorable solution from a list of possible alternatives. This paper proposes an algorithm for reaching a consensus for robotic swarms deployed in scenarios in which they can choose one of the two most common signs in the external environment. The proposed algorithm is based on the calculation of the measured features of the environment, as well as the distribution of this data between robots. The algorithm was tested using the ARGoS simulator
URI: http://hdl.handle.net/20.500.12258/14567
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File SizeFormat 
scopusresults 1432 .pdf
  Restricted Access
475.68 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.