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:20200207T120714
UID:fef53ca4-4999-11ea-982f-000e0c3db68b
SUMMARY:Vortrag von Prof. M.-A. Belabbas
DESCRIPTION:Prof. M.-A. Belabbas\nAssociate Professor\nElectrical and Computer Engineering\nCoordinated Science Laboratory\nUniversity of Illinois, Urbana-Champaign &nbsp;\n&nbsp;&nbsp;\nTuesday 2020-02-11 16:00\nIST-Seminar-Room V9.2.255 - Pfaffenwaldring 9 - Campus Stuttgart-Vaihingen\nAbstract\nThe motion planning problem is one of the oldest and most studied problems in control theory. It\nconsists of determining control signals that drive a system from its initial state to a desired\nfinal state. The difficulty of the problem lies in the fact that the dynamics can be arbitrary\nnonlinear, and the trajectory of the system may be subject to additional holonomic, non-holonomic\nor obstacle constraints. We present in this talk a new point of view on motion planning and, as a\nresult, provide a new method to solve this important problem. The method proceeds by deforming an\narbitrary path joining the initial state of the system to a desired final state into an admissible\npath, that is a path that meets the various constraints of the problem. The method builds on\nrelatively recent developments in geometric analysis. In a nutshell, it consists of encoding the\nvarious constraints of the problem in an appropriately-defined inner product which is then used to\nderive a parabolic partial differential equation whose solution provides the sought homotopy\nbetween an arbitrary path and a feasible trajectory for the system to follow. We will present the\nmethod in details and apply it to various motion planning examples, including wheeled vehicles\ncontrol and robot gymnastics. &nbsp;\nBiographical Information\nM.-A. Belabbas obtained his PhD degree in applied mathematics from Harvard University and his\nundergraduate degree from Ecole Centrale Paris, France, and Universite Catholique de Louvain,\nBelgium. He is currently an associate professor in the Electrical and Computer Engineering\ndepartment at the University of Illinois, Urbana-Champaign and at the Coordinated Science\nLaboratory. His research interests are in geometric control theory, stochastic control and\nlearning. &nbsp;
DTSTART;TZID=Europe/Berlin;VALUE=DATE:20200211
URL;VALUE=URI:https://www.ist.uni-stuttgart.de/de/veranstaltungen/Vortrag-von-Prof.-M.-A.-Belabbas/
END:VEVENT
END:VCALENDAR