Consensus of Multi-Agent Systems Using Back-Tracking and History Following Algorithms

by   Yanumula V. Karteek, et al.

This paper proposes two algorithms, namely "back-tracking" and "history following", to reach consensus in case of communication loss for a network of distributed agents with switching topologies. To reach consensus in distributed control, considered communication topology forms a strongly connected graph. The graph is no more strongly connected whenever an agent loses communication.Whenever an agent loses communication, the topology is no more strongly connected. The proposed back-tracking algorithm makes sure that the agent backtracks its position unless the communication is reestablished, and path is changed to reach consensus. In history following, the agents use their memory and move towards previous consensus point until the communication is regained. Upon regaining communication, a new consensus point is calculated depending on the current positions of the agents and they change their trajectories accordingly. Simulation results, for a network of six agents, show that when the agents follow the previous history, the average consensus time is less than that of back-tracking. However, situation may arise in history following where a false notion of reaching consensus makes one of the agents stop at a point near to the actual consensus point. An obstacle avoidance algorithm is integrated with the proposed algorithms to avoid collisions. Hardware implementation for a three robots system shows the effectiveness of the algorithms.


page 1

page 2

page 3

page 4


Trust-based Consensus in Multi-Agent Reinforcement Learning Systems

An often neglected issue in multi-agent reinforcement learning (MARL) is...

An Algorithm For Adversary Aware Decentralized Networked MARL

Decentralized multi-agent reinforcement learning (MARL) algorithms have ...

Distributed Economic Dispatch for Energy Internet Based on Multi-Agent Consensus Control

We consider the economic dispatch (ED) for an Energy Internet composed o...

Strategic Topology Switching for Security-Part I: Consensus & Switching Times

This two-part paper considers strategic topology switching for the secon...

On Consensus-Optimality Trade-offs in Collaborative Deep Learning

In distributed machine learning, where agents collaboratively learn from...

Cohesive Networks using Delayed Self Reinforcement

How a network gets to the goal (a consensus value) can be as important a...

Fast model averaging via buffered states and first-order accelerated optimization algorithms

In this letter, we study the problem of accelerating reaching average co...

Please sign up or login with your details

Forgot password? Click here to reset