BEGIN:VCALENDAR VERSION:2.0 PRODID:IEEE vTools.Events//EN CALSCALE:GREGORIAN BEGIN:VTIMEZONE TZID:America/New_York BEGIN:DAYLIGHT DTSTART:20260308T030000 TZOFFSETFROM:-0500 TZOFFSETTO:-0400 RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3 TZNAME:EDT END:DAYLIGHT BEGIN:STANDARD DTSTART:20251102T010000 TZOFFSETFROM:-0400 TZOFFSETTO:-0500 RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11 TZNAME:EST END:STANDARD END:VTIMEZONE BEGIN:VEVENT DTSTAMP:20251218T182557Z UID:6BCEBE2E-8B16-4E73-8916-FDB609FDEB93 DTSTART;TZID=America/New_York:20251205T110000 DTEND;TZID=America/New_York:20251205T130000 DESCRIPTION:Abstract:\nThis talk will provide an overview on the recent res earch on\nmulti-agent systems operating in hostile environments.\nIn the c ontext of consensus problems\, we will focus on the\ninfluence of misbehav ing agents capable to inject false data in\ntheir transmissions and how to mitigate such cyber\nattacks by the approach of the so-called mean subseq uence reduced\nalgorithms and their variants. Agents equipped with such al gorithms\nwill ignore their neighbors taking outlying state values.\nWe wi ll see that characterizations on the properties necessary\nfor network top ologies can be established\, and moreover that\nnetwork resiliency can be enhanced when more communication and\ncomputational resources are availabl e. This approach originates\nin the area of distributed algorithms in comp uter science\, but\nrecent studies in systems control have brought notable advances.\nWe will further discuss extensions of such algorithms to probl ems\nof averaging\, parameter estimation\, and clock synchronization in\nw ireless sensor networks.\n\nSpeaker(s): Hideaki\, \n\nAgenda: \nAbstract:\ nThis talk will provide an overview on the recent research on\nmulti-agent systems operating in hostile environments.\nIn the context of consensus p roblems\, we will focus on the\ninfluence of misbehaving agents capable to inject false data in\ntheir transmissions and how to mitigate such cyber\ nattacks by the approach of the so-called mean subsequence reduced\nalgori thms and their variants. Agents equipped with such algorithms\nwill ignore their neighbors taking outlying state values.\nWe will see that character izations on the properties necessary\nfor network topologies can be establ ished\, and moreover that\nnetwork resiliency can be enhanced when more co mmunication and\ncomputational resources are available. This approach orig inates\nin the area of distributed algorithms in computer science\, but\nr ecent studies in systems control have brought notable advances.\nWe will f urther discuss extensions of such algorithms to problems\nof averaging\, p arameter estimation\, and clock synchronization in\nwireless sensor networ ks.\n\nRoom: SF B560 \, 172 St. George St.\,\, Toronto\, Ontario\, Canada\ , M5R 0A3 LOCATION:Room: SF B560 \, 172 St. George St.\,\, Toronto\, Ontario\, Canada \, M5R 0A3 ORGANIZER:mehrdad.tirandazian@ieee.org SEQUENCE:19 SUMMARY:Resiliency in Multi-Agent Consensus under Adversarial Attacks URL;VALUE=URI:https://events.vtools.ieee.org/m/518026 X-ALT-DESC:Description: <br /><blockquote style="color: rgb(34\, 34\, 34)\; font-family: Arial\, Helvetica\, sans-serif\; font-size: small\; font-sty le: normal\; font-variant-ligatures: normal\; font-variant-caps: normal\; font-weight: 400\; letter-spacing: normal\; orphans: 2\; text-align: start \; text-indent: 0px\; text-transform: none\; widows: 2\; word-spacing: 0px \; -webkit-text-stroke-width: 0px\; white-space: normal\; background-color : rgb(255\, 255\, 255)\; text-decoration-thickness: initial\; text-decorat ion-style: initial\; text-decoration-color: initial\;">\n<div>\n<div style ="font-style: normal\; font-variant-caps: normal\; font-weight: 400\; lett er-spacing: normal\; text-indent: 0px\; text-transform: none\; white-space : normal\; word-spacing: 0px\; text-decoration: none\; text-align: left\; font-family: Aptos\, Aptos_EmbeddedFont\, Aptos_MSFontService\, Calibri\, Helvetica\, sans-serif\; font-size: 12pt\;"><strong>Abstract</strong>:<br> This talk will provide an overview on the recent research on&nbsp\;<br>mul ti-agent systems operating in hostile environments.&nbsp\;<br>In the conte xt of consensus problems\, we will focus on the&nbsp\;<br>influence of mis behaving agents capable to inject false data in&nbsp\;<br>their transmissi ons and how to mitigate such cyber&nbsp\;<br>attacks by the approach of th e so-called mean subsequence reduced<br>algorithms and their variants. Age nts equipped with such algorithms&nbsp\;<br>will ignore their neighbors ta king outlying state values.&nbsp\;<br>We will see that characterizations o n the properties necessary&nbsp\;<br>for network topologies can be establi shed\, and moreover that&nbsp\;<br>network resiliency can be enhanced when more communication and&nbsp\;<br>computational resources are available. T his approach originates&nbsp\;<br>in the area of distributed algorithms in computer science\, but&nbsp\;<br>recent studies in systems control have b rought notable advances.<br>We will further discuss extensions of such alg orithms to problems&nbsp\;<br>of averaging\, parameter estimation\, and cl ock synchronization in&nbsp\;<br>wireless sensor networks.&nbsp\;</div>\n< /div>\n</blockquote><br /><br />Agenda: <br /><p><strong>Abstract</strong> :<br>This talk will provide an overview on the recent research on&nbsp\;<b r>multi-agent systems operating in hostile environments.&nbsp\;<br>In the context of consensus problems\, we will focus on the&nbsp\;<br>influence o f misbehaving agents capable to inject false data in&nbsp\;<br>their trans missions and how to mitigate such cyber&nbsp\;<br>attacks by the approach of the so-called mean subsequence reduced<br>algorithms and their variants . Agents equipped with such algorithms&nbsp\;<br>will ignore their neighbo rs taking outlying state values.&nbsp\;<br>We will see that characterizati ons on the properties necessary&nbsp\;<br>for network topologies can be es tablished\, and moreover that&nbsp\;<br>network resiliency can be enhanced when more communication and&nbsp\;<br>computational resources are availab le. This approach originates&nbsp\;<br>in the area of distributed algorith ms in computer science\, but&nbsp\;<br>recent studies in systems control h ave brought notable advances.<br>We will further discuss extensions of suc h algorithms to problems&nbsp\;<br>of averaging\, parameter estimation\, a nd clock synchronization in&nbsp\;<br>wireless sensor networks.&nbsp\;</p> END:VEVENT END:VCALENDAR