BEGIN:VCALENDAR
METHOD:PUBLISH
PRODID:www-math-fau-de//Events//DE
VERSION:2.0
BEGIN:VEVENT
SUMMARY:Mini-Workshop on Robots Learning\, Optimization and Control (M
 . Muradi\, E. Strauch\, N. Philippi\, A. Bärmann)
UID:efc75004-5d93-4a1e-9231-6ffc9cc4bb73
DESCRIPTION:Mini-workshop on Robots Learning\, Optimization and Contro
 l Zoom link: Meeting ID: 917 6526 9595 \, Passcode: 431399 Speaker: Mu
 rad Muradi Affiliation: FAU\, Germany Title: Processing Time Optimizat
 ion for Multi-Robot Systems Using Heuristics Algorithms Time: 9:00 &#8
 211\; 9:30 Abstract: -PVC-sealing is a complex process for the tighnes
 s and corrosion resistance of the car body. -Fast and accurate collisi
 on detection with suitable collider pairs. -Using PRM-based motion pla
 nning algorithm to generate collision free path between PVC seams. -Fu
 rther optimization of path in post-processing to generate short and sm
 ooth robot motions. -Implementation of a genetic algorithm for process
  optimization and load balancing. -Successfully application of methodo
 logy on real business problem. -Reduction of non-value-adding part of 
 processing time by up to 17% Speaker: Elisa Strauch Affiliation: TU Da
 mstadt\, Germany Title: Probabilistic Constraints in Optimization Prob
 lems on Flow Networks Time: 9:30 &#8211\; 10:00 Abstract: In this talk
  the focus is placed on probabilistic constraints used in optimization
  problems on networks. There are two different ways to compute the pro
 bability in the constraints: the spheric radial decomposition and the 
 direct approach. The spheric radial decomposition cannot always be app
 lied. For example\, if the exact solution of a partial differential eq
 uation is needed but unknown. The direct approach is more general: We 
 have to integrate the corresponding probability density function which
  we can approximate with a kernel density estimation. We consider the 
 two methods for a stationary network problem with uncertain boundary d
 ata on networks. Furthermore we extend the probabilistic constraints t
 o dynamic flow problems. Coffee/Tea Break: 10:00 &#8211\; 10:15 Speake
 r: Nora Marie Philippi Affiliation: TU Damstadt\, Germany Title: On th
 e transport limit of singularly perturbed convection-diffusion problem
 s on networks Time: 10:15 &#8211\; 10:45 Abstract: I
DTSTART:20201123T080000Z
DTEND:20201123T101500Z
LOCATION:Online
DTSTAMP:20260723T084412Z
END:VEVENT
END:VCALENDAR