Gene

Statistics

Algorithm

Graph

Mathematical analysis

Artificial intelligence

Psychology

Political science

Estimator

Chemistry

Pedagogy

Bipartite graph

Controller (irrigation)

Transformation (genetics)

Decentralised system

Control (management)

Tracking (education)

Deception

Mathematics

Bounded function

Computer science

Multi-agent system

Control theory (sociology)

State (computer science)

Biochemistry

Agronomy

Theoretical computer science

Biology

IEEE Transactions on Cybernetics

This article presents a novel adaptive bipartite consensus tracking strategy for multiagent systems (MASs) under sensor deception attacks. The fundamental design philosophy is to develop a hierarchical algorithm based on shortest route technology that recasts the bipartite consensus tracking problem for MASs into the tracking problem for a single agent and eliminates the need for any global information of the Laplacian matrix. As the sensors suffer from malicious deception attacks, the states cannot be measured accurately, we thus construct a novel dynamic estimator to estimate the actual states, which, together with a new coordinate transformation involving the attacked and estimated state variables, allows a distributed security control scheme to be developed, in which the singularity of the adaptive iterative process involved in existing works is completely avoided. Furthermore, the Nussbaum functions are included in the controller to account for the influence of the unknown control gains caused by sensor deception attacks. It is shown that the distributed consensus tracking errors converge to a small neighborhood of the origin, and all the signals in the closed-loop system remain bounded. Simulation on a forced damped pendulums (FDPs) is conducted to demonstrate and verify the effectiveness of the proposed strategy.

A Novel Bipartite Consensus Tracking Control for Multiagent Systems Under Sensor Deception Attacks