BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IEEE Toronto Section - ECPv6.15.17//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:IEEE Toronto Section
X-ORIGINAL-URL:https://www.ieeetoronto.ca
X-WR-CALDESC:Events for IEEE Toronto Section
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20251205T160000
DTEND;TZID=UTC:20251205T180000
DTSTAMP:20260430T093805
CREATED:20251127T215114Z
LAST-MODIFIED:20251204T220713Z
UID:10000911-1764950400-1764957600@www.ieeetoronto.ca
SUMMARY:Resiliency in Multi-Agent Consensus under Adversarial Attacks
DESCRIPTION: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.  Speaker(s): Hideaki\,   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.  Room: SF B560 \, 172 St. George St.\,\, Toronto\, Ontario\, Canada\, M5R 0A3
URL:https://www.ieeetoronto.ca/event/resiliency-in-multi-agent-consensus-under-adversarial-attacks/
LOCATION:Room: SF B560 \, 172 St. George St.\,\, Toronto\, Ontario\, Canada\, M5R 0A3
END:VEVENT
END:VCALENDAR