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 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 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 advances.
We will further discuss extensions of such algorithms to problems
of averaging, parameter estimation, and clock synchronization in
wireless sensor networks.
Date and Time
Location
Hosts
Registration
-
Add Event to Calendar
- 172 St. George St.,
- Toronto, Ontario
- Canada M5R 0A3
- Room Number: SF B560
- Starts 27 November 2025 05:00 AM UTC
- Ends 05 December 2025 05:00 AM UTC
- No Admission Charge
Speakers
Hideaki of University of Tokyo
Resiliency in Multi-Agent Consensus under Adversarial Attacks
This talk will provide an overview on the recent research on
multi-agent systems operating in hostile 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 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 advances.
We will further discuss extensions of such algorithms to problems
of averaging, parameter estimation, and clock synchronization in
wireless sensor networks.
Biography:
Hideaki Ishii received the M.Eng. degree from Kyoto University in 1998,
and the Ph.D. degree from the University of Toronto in 2002.
He was a Postdoctoral Research
Associate at the University of Illinois at Urbana-Champaign in 2001-2004,
and a Research Associate at The University of Tokyo in 2004-2007.
He was an Associate Professor and then a Professor
at the Tokyo Institute of Technology, Yokohama, Japan, in 2007-2024.
Email:
Address:University of Tokyo, University of Tokyo, Tokyo, Tokyo, Japan, NA
Agenda
Abstract:
This talk will provide an overview on the recent research on
multi-agent systems operating in hostile 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 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 advances.
We will further discuss extensions of such algorithms to problems
of averaging, parameter estimation, and clock synchronization in
wireless sensor networks.