Consensus achievement method for a robotic swarm about the most frequently feature of an environment

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.

A method of counteracting Byzantine robots with a random behavior strategy during collective design-making in swarm robotic systems

“…Thus, the problem of detecting and isolating BR with random behavior in the collective design-making process is urgent. This work focuses on a modification of the method [16] for detecting BR with random behavior.…”

“…For the possibility of using such an approach, confidence was added to the method [16] in the exchanged data, although in this method it is not involved in the process of reaching a consensus in collective design-making, but is used in classical methods.…”

“…The article [15] provides a successful example of using blockchain technology to provide IS for collective design-making. To avoid high hardware costs, this paper uses a distributed ledger approach without using a hash function [16].…”