BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LACIM - ECPv5.0.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LACIM
X-ORIGINAL-URL:http://lacim.uqam.ca
X-WR-CALDESC:Events for LACIM
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200918T110000
DTEND;TZID=America/New_York:20200918T120000
DTSTAMP:20210118T173357
CREATED:20200831T201705Z
LAST-MODIFIED:20200906T143958Z
UID:17526-1600426800-1600430400@lacim.uqam.ca
SUMMARY:Mathias Hudoba de Badyn (ETH): Optimizing Graphs for Networked Dynamical Systems
DESCRIPTION:Networked control systems are ubiquitous in modern applications\, ranging from self-driving cars\, autonomous supply-and-delivery systems\, to spacecraft formation flight. In this talk\, we address algorithms for controlling such systems\, and tools from algebraic graph theory that allow us to optimize the performance of those algorithms. We examine how these algorithms reject external noise signals in the context of the H2 system norm. First\, a fast algorithm is discussed for computing the H2 norm of consensus on series-parallel networks. Extensions to multiplex\, matrix-weighted graphs are presented. For networks with non-heterogenous agents with system dynamics operating at different timescales\, we examine how the graph topology affects the H2 norm of edge consensus\, a representation of the consensus algorithm using relative measurements between agents. We present algorithms that find the minimum-H2 norm spanning tree of a graph\, and discuss how notions of graph centrality affect the H2 norm when choosing to add additional connections between nodes.\n
URL:http://lacim.uqam.ca/event/mathias-hudoba-de-badyn-eth/
LOCATION:En ligne/online\, Canada
CATEGORIES:SÃ©minaire
END:VEVENT
END:VCALENDAR