BEGIN:VCALENDAR
VERSION:2.0
PRODID:OpenCms 21.0.19
BEGIN:VTIMEZONE
TZID:Europe/Berlin
X-LIC-LOCATION:Europe/Berlin
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
END:STANDARD
END:VTIMEZONE				
BEGIN:VEVENT
DTSTAMP:20250703T170409
UID:f8f03486-581e-11f0-a37f-000e0c3db68b
SUMMARY:Talk of Prof. Carlo Novara
DESCRIPTION:Abstract\nThanks to phenomena like superposition and tunnelling, quantum computers have shown the\ncapability to significantly reduce the computational complexity of certain classes of non-convex\noptimization problems, allowing their solution with a substantial speedup with respect to classical\ncomputers. In this perspective, the integration of quantum optimization techniques in the automatic\ncontrol field has the potential to give relevant advancements in solving complex, high-dimensional\nproblems that are computationally intensive for classical methods. In this talk, we explore the\napplication of quantum optimization in two areas: Nonlinear Model Predictive Control (NMPC) and\nScheduling. In the context of NMPC, we first introduce a novel polynomial formulation of NMPC,\nallowing efficient solution of NMPC optimization problems on classical hardware. This formulation\nis the basis for the development of a quantum NMPC algorithm: the polynomial structure is\nreformulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, which is well-suited\nfor execution on quantum annealers, a particular class of quantum computers that are nowadays\ncommercially available. In the context of Scheduling, we show how relevant space mission planning\nproblems with inherent combinatorial complexity can be reformulated as QUBO problems and then\nsolved using quantum annealers. We present some simulation examples, related to trajectory control\nfor automated ground vehicles and satellite scheduling in space missions. In these examples, the\ndeveloped quantum algorithms are solved using real quantum annealers, and are compared with\nstate-of-the-art algorithms, running on classical computers. In the talk, we also discuss the\ngeneral advantages, potential, and limitations of quantum computing, in view of its integration in\nthe automatic control field.   \nBiographical Information\nCarlo Novara received the Laurea degree in Physics from Università di Torino (Italy) in 1996 and\nthe PhD degree in Computer and System Engineering from Politecnico di Torino (Italy) in 2002. He\nheld a visiting researcher position at the University of California at Berkeley in 2001 and 2004.\nHe is currently a Full Professor at Politecnico di Torino in the field of Automatic Control. He is\nthe author or co-author of about 200 scientific publications in international journals and\nconference proceedings. He has been involved in several national and international projects, in\ncollaboration with Italian and European institutions/companies. He is the co-author of several\npatents in the automotive field. He is a member of the IEEE committee on System Identification and\nAdaptive Control, of the IFAC committee on Modelling, Identification and Signal Processing, of the\nIFAC committee on Modeling and Control of Environmental Systems, and a founding member of the\nIEEE-CSS committee on Medical and Healthcare Systems. His research interests include system\nidentification, filtering/estimation, nonlinear control, predictive control, data-driven methods,\nset membership methods, nonlinear optimization, quantum computing, and aerospace, automotive and\nenergy applications.\n\n\n\n\n  
DTSTART;TZID=Europe/Berlin:20250715T140000
DTEND;TZID=Europe/Berlin:19700101T010000
LOCATION:Institute for Systems Theory and Automatic Control, , Seminar room 2.255, Pfaffenwaldring 9, 70569  Stuttgart, Campus Vaihingen 
URL;VALUE=URI:https://www.ist.uni-stuttgart.de/events/Talk-of-Prof.-Carlo-Novara/
END:VEVENT
END:VCALENDAR