BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv6.5.6//EN
X-ORIGINAL-URL:https://cmc.deusto.eus/
X-WR-CALNAME:cmc.deusto.eus
X-WR-CALDESC:DeustoCCM - Chair of Computational Mathematics at University of Deusto
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
UID:MEC-9ebd41e6cbc1e14780805f6fc0d65867@cmc.deusto.eus
DTSTART:20220919T140000Z
DTEND:20220919T150000Z
DTSTAMP:20220914T102400Z
CREATED:20220914
LAST-MODIFIED:20220914
PRIORITY:5
TRANSP:OPAQUE
SUMMARY:FAU MoD Lecture: Learning-Based Optimization and PDE Control in User-Assignable Finite Time
DESCRIPTION:Speaker: Prof. Dr. Miroslav Krstic\nAffiliation: University of California San Diego (USA)\nOrganized by: FAU MoD, Research Center for Mathematics of Data at Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany)\nAbstract. This year is the centennial of the 1922 invention of Extremum Seeking, one of the currently most active areas of learning-based control or model-free adaptive control. It has also been exactly a quarter century since the resurrection of this method through its proof of convergence in 1997. In this lecture I will present new results on accelerating the convergence of ES algorithms from exponential to convergence in user-prescribed finite time. The subject of stabilization in prescribed time emerged in 2017 as an interesting alternative to sliding mode control (SMC) for achieving convergence in a time that is independent of the initial condition, using time-varying feedback gain which grows to infinity as the time approaches the terminal (prescribed) time. Such unbounded gains, multiplying the state that goes to zero and making the control input bounded, are common in optimal control with a hard terminal constraint, such as in classical Proportional Navigation control law in aerospace applications, like target intercept. I will present results, achieved over the past year – 2021 – by two of my students, Velimir Todorovski (a graduate of FAU-Erlangen) and Cemal Tugrul Yilmaz, on extending prescribed-time stabilization to prescribed-time extremum seeking. Todorovski solves the problem of source seeking for mobile robots in GPS-denied environments. Yilmaz solves the problem of real-time optimization under large delays on the input and in the presence of PDE (partial differential equation) dynamics. Their designs are model-free and, most importantly, achieve convergence/optimality in a user-prescribed interval of time, independent of initial conditions.\nWHERE?\nOnline:\nZoom meeting link\nMeeting ID: 697 5255 8798 | PIN: 737047\nOn-site:\nRoom H13. Department of Mathematik.\nFriedrich-Alexander-Universität Erlangen-Nürnberg (FAU)\nCauestrasse 11, 91058 Erlangen\n[Poster of the event ( https://mod.fau.eu/wp-content/uploads/FAUMoD-poster-MKrstic-19sep2022.pdf )]\nThis event on LinkedIn\nYou might like:\n• BaCateC project: Endowing Artificial Intelligence with Control-Theoretic Guarantees: Data-Based Optimization in Real Time for Dynamic Systems\n
URL:https://cmc.deusto.eus/events-calendar/fau-mod-lecture-learning-based-optimization-and-pde-control-in-user-assignable-finite-time/
ORGANIZER;CN=FAU DCN-AvH:MAILTO:
CATEGORIES:Events Calendar,Events Calendar Past
LOCATION:Cauerstrasse 11, Erlangen 91058
ATTACH;FMTTYPE=image/png:https://cmc.deusto.eus/wp-content/uploads/FAUMoD-lectureSeries-MKrstic-19sep2022-wFAUDCNAvH.png
END:VEVENT
END:VCALENDAR