BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Copenhagen
BEGIN:STANDARD
DTSTART:20181028T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20190331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.18401.field_ns_calendar_date.0@www.lu.se
DTSTAMP:20190418T161716Z
CREATED:20190210T170957Z
DESCRIPTION:A\n \n \n\n \n\nLocation: \n\nSeminar room - M2112B\n\nDat
e: \n\ntorsdag\, februari 14\, 2019 - 13:15 till 14:00\n\n\n\n\nAbstract:
\nFormal methods from computer science were originally developed for speci
fying and verifying the correct behavior of software and hardware systems\
, and an important research objective now is to ensure these approaches ar
e scalable\, adaptable\, and reliable when applied to physical control sys
tems. Applying formal methods to such systems often requires computing fin
ite state abstractions of the underlying dynamics. These finite abstractio
ns over-approximate the original system so that any trajectory possible fo
r the original system is also present in the finite abstraction.\n\n\nAlgo
rithms for computing finite abstractions usually require computing reachab
le sets as a fundamental subcomponent\, which can be computationally prohi
bitive. In this talk\, we will show that a large class of dynamical system
s exhibit a mixed monotonicity property that generalizes the classical not
ion of monotone dynamical systems and allows for efficient computation of
finite abstractions. In particular\, mixed monotonicity enables reach set
computations that scale linearly with the dimension of the continuous stat
e space. We will also show that this approach extends to systems subject t
o stochastic disturbances\, in which case the resulting finite-state abstr
action can be interpreted as a Markov chain with uncertain transition prob
abilities. As an example\, we apply the methodology to control of traffic
flow networks\, which are shown to be mixed monotone.\n\n\nBio:\nSam Cooga
n is an assistant professor at Georgia Tech with a joint appointment in th
e School of Electrical and Computer Engineering and the School of Civil an
d Environmental Engineering. He currently holds the Demetrius T. Paris Jun
ior Professorship in the School of ECE. Prior to joining Georgia Tech in J
uly 2017\, he was an assistant professor at UCLA from 2015-2017. He receiv
ed the B.S. degree in Electrical Engineering from Georgia Tech and the M.S
. and Ph.D. degrees in Electrical Engineering from the University of Calif
ornia\, Berkeley. In 2015\, he was a postdoctoral research engineer at Sen
sys Networks\, Inc.\, and in 2012 he was a research intern at NASA's Jet P
ropulsion Lab. His research is in the area of dynamical systems and autono
my and focuses on developing scalable tools for verification and control o
f networked\, cyber-physical systems with an emphasis on autonomous transp
ortation systems. He received a Young Investigator Award from the Air For
ce Office of Scientific Research in 2018\, a CAREER Award from the Nationa
l Science Foundation in 2018\, the IEEE Transactions on Control of Network
Systems Outstanding Paper Award in 2017\, and the best student paper awar
d at the 2015 Hybrid Systems: Computation and Control conference.\n\n\nCat
egory: \n\nSeminarium
DTSTART;TZID=Europe/Copenhagen:20190214T131500
DTEND;TZID=Europe/Copenhagen:20190214T140000
LAST-MODIFIED:20190210T171029Z
LOCATION:Seminar room - M2112B
SUMMARY:Seminar by Samuel Coogan: Efficient finite abstraction of dynamical
systems for formally correct control
URL;TYPE=URI:https://www.lu.se/event/seminar-by-samuel-coogan-efficient-fin
ite-abstraction-of-dynamical-systems-for-formally-correct-control
END:VEVENT
END:VCALENDAR