BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//scienceofintelligence.de - ECPv6.15.12.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.scienceofintelligence.de
X-WR-CALDESC:Events for scienceofintelligence.de
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Berlin
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20221030T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20230622T160000
DTEND;TZID=Europe/Berlin:20230622T173000
DTSTAMP:20260408T113334
CREATED:20230119T093719Z
LAST-MODIFIED:20240813T103047Z
UID:14077-1687449600-1687455000@www.scienceofintelligence.de
SUMMARY:Jörg Raisch (Science of Intelligence)\, "Efficient Consensus over Wireless Channels & and its Use in Traffic Automation Problems"
DESCRIPTION:Consensus algorithms are routinely employed in a variety of multi-agent scenarios. They require that each agent iteratively evaluates a multivariate function of its neighbours’ information states. If a wireless communication channel is used\, this is typically implemented through protocols (such as TDMA – Time Division Multiple Access) that avoid superposition of transmitted signals by assigning each transmitter its own (time) slot.However\, consensus only requires that agents know a function of their neighbours’ information states\, not the individual information states. Hence one may ask whether using the famous Kolmogorov-Arnold representation theorem might allow to exploit the channel’s superposition property to drastically reduce communication effort. Kolmogorov-Arnold essentially states that every continuous multivariate function can be expressed via univariate functions and addition. If channel superposition were to be considered as addition\, all agents could consequently simultaneously transmit a suitably preprocessed version of their information state\, with receiving agents locally postprocessing the received superposition signal.\nWe will explain for two widely used consensus types (average consensus and max-consensus) why in practice the application of Kolmogorov-Arnold is notquite as straightforward. For both consensus types\, we will suggest alternative approaches\, which make use of the channel’s superposition property whilehandling non-ideality effects such as time-varying unknown channel coefficients. By allowing all agents to transmit at the same time\, the required number oftransmission slots is considerably reduced. In the second part of the talk\, we will demonstrate how average and max-consensus algorithms can be used in various traffic automation scenarios. This includes platooning\, distributed automatic lane changing\, and distributed automation of traffic intersections.
URL:https://www.scienceofintelligence.de/event/pi-lecture-with-jorg-raisch/
LOCATION:MAR 2.057
CATEGORIES:PI Lecture
ATTACH;FMTTYPE=image/jpeg:https://www.scienceofintelligence.de/wp-content/uploads/2023/01/raisch_800.jpg
END:VEVENT
END:VCALENDAR