Resiliency in Multi-Agent Consensus under Adversarial Attacks

Abstract:
This talk will provide an overview on the recent research on
multi-agent systems operating in hostile <a href="http://environments.
In” target=”_blank” title=”environments.
In”>environments.
In the context of consensus problems, we will focus on the
influence of misbehaving agents capable to inject false data in
their transmissions and how to mitigate such cyber
attacks by the approach of the so-called mean subsequence reduced
algorithms and their variants. Agents equipped with such algorithms
will ignore their neighbors taking outlying state <a href="http://values.
We” target=”_blank” title=”values.
We”>values.
We will see that characterizations on the properties necessary
for network topologies can be established, and moreover that
network resiliency can be enhanced when more communication and
computational resources are available. This approach originates
in the area of distributed algorithms in computer science, but
recent studies in systems control have brought notable <a href="http://advances.
We” target=”_blank” title=”advances.
We”>advances.
We will further discuss extensions of such algorithms to problems
of averaging, parameter estimation, and clock synchronization in
wireless sensor <a href="http://networks.

Speaker(s):” target=”_blank” title=”networks.

Speaker(s):”>networks.

Speaker(s): Hideaki,

Agenda:
Abstract:
This talk will provide an overview on the recent research on
multi-agent systems operating in hostile <a href="http://environments.
In” target=”_blank” title=”environments.
In”>environments.
In the context of consensus problems, we will focus on the
influence of misbehaving agents capable to inject false data in
their transmissions and how to mitigate such cyber
attacks by the approach of the so-called mean subsequence reduced
algorithms and their variants. Agents equipped with such algorithms
will ignore their neighbors taking outlying state <a href="http://values.
We” target=”_blank” title=”values.
We”>values.
We will see that characterizations on the properties necessary
for network topologies can be established, and moreover that
network resiliency can be enhanced when more communication and
computational resources are available. This approach originates
in the area of distributed algorithms in computer science, but
recent studies in systems control have brought notable <a href="http://advances.
We” target=”_blank” title=”advances.
We”>advances.
We will further discuss extensions of such algorithms to problems
of averaging, parameter estimation, and clock synchronization in
wireless sensor <a href="http://networks.

Room:” target=”_blank” title=”networks.

Room:”>networks.

Room: SF B560 , 172 St. George St.,, Toronto, Ontario, Canada, M5R 0A3