


[Contents]  [Index] 
Collaborator: I. Bremer, R. Henrion, D. Hömberg, M.H. Farshbaf Shaker, W. Weiss
Cooperation with: C. Chelminski (Cardinal St. Wyszynski University, Poland), D. Dentcheva (Stephens Institute of Technology, New Jersey, USA), H. Hämmerle (Rücker GmbH, Weingarten), A. Jourani (Université de Bourgogne, Dijon, France), A. Khludnev (Lavrentyev Institute of Hydrodynamics, Novosibirsk, Russia), U. Lindemann (Volkswagen AG, Wolfsburg), J. Outrata (Institute of Information Theory and Automation (UTIA) Prague, Czech Republic), W. Römisch (HumboldtUniversität zu Berlin), A. Seeger (Université d'Avignon, France), J. Sokoowski (IECN/INRIA Lorraine, VandoeuvrelèsNancy, France), T. Szántai (Technical University of Budapest, Hungary), F. Tröltzsch (Technische Universität Berlin), S. Volkwein (KarlFranzensUniversität Graz, Austria), M. Yamamoto (University of Tokyo, Japan)
Supported by: DFGForschungszentrum MATHEON, projects C7 & C11; Rücker GmbH; Volkswagen AG
Description:
1. Mean risk models for electricity portfolio management (R. Henrion).
Continuing the work initiated in this project, the focus was on scenario reduction in stochastic optimization. The multistage decision/observation structure of optimization problems with random data (like electricity demands or prices in power generating systems) is usually reflected in a scenario tree. Figure 1 (upper part) shows an example of a 4stage tree with 7 branches at each node where branching probabilities are visualized by different gray values.
The optimization problem induced by such trees may become too large to
be solved efficiently. Hence, a careful
reduction of such trees is a crucial prerequisite for their solution. The
modification of a scenario tree can be interpreted as a perturbation of the
underlying probability measure. A theoretically sound approach of carrying
out such reduction relies on the use of suitable probability metrics which
are well adapted to the problem class, [11]. Efficient scenario
reduction algorithms have been obtained before in the case of purely
continuous decision variables, [3].
A new challenge arises in case of
additional discrete decision variables (e.g., on/off decisions for power
generating units). The class of probability metrics to be considered then,
in order to ensure that the reduced tree stays close to the original one, is
given by discrepancy distances based on rectangles or
cells. A solution
method based on linear programming and capable of dealing with all
discrepancytype distances has been developed and implemented. Figure
1
(lower part) shows a reduced set of 10 out of originally 343 scenarios
(again with gray values corresponding to probabilities) which minimizes the
(cell) discrepancy distance to the original tree.
Further works related to this project were concerned with solution stability in stochastic optimization ([4]), error bounds in nonlinear optimization ([5, 1]), and structural properties of quasiconcave probability measures ([6]).
2. Optimal control of surface heat treatments (D. Hömberg, W. Weiss).
In [12], a simplified version of a thermomechanical model of phase transitions in steel ([7]) has been considered. Disregarding the transformation plasticity, numerical simulations with density depending on temperature and phase volume fractions show that the model is capable of reproducing the typical thermomechanical behavior of materials exhibiting phase transitions. Figure 2 shows the results of a numerical simulation where the lateral boundary of a steel cylinder has been cooled so fast that only martensite is produced. On top, one can see the evolution of temperature in the core and at the boundary of the cylinder. In the middle, the growth of the martensitic phase is depicted. The picture at the bottom shows the evolution of thermal stresses. Especially two stress reversals can be seen, which is a typical feature of materials exhibiting phase transitions during cooling.
Disregarding furthermore the temperature dependency of the density of the different phases and assuming instead that the main effect stems from the different thermal expansions of the respective phases, control problems for the resulting thermomechanical problem have also been investigated in [12].
Another natural approach is to generalize the usual equations of linearized thermoelasticity for the case of materials with phase transition by incorporating phasedependent thermal expansion coefficients via a mixture ansatz. While in [8] a contact problem for such a model has been investigated, the aim of [2] is to investigate the related control problem.
Concerning laser surface treatments,
we have started to exploit the
adaptivity features of pdelib2
in collaboration with Research Group 3 (see page ).
As a first result, Figure 3 shows a snapshot of a
laser hardening simulation. On top, the adaptively refined grid
which moves with the laser focus is depicted. At the bottom, one
can see the temperature and isolines of the austenite volume
fraction. To resolve the thin austenitic layer, a second grid
had to be introduced.
As has been described in last year's report, an efficient PID algorithm has been developed for controlling laser material treatments. As a partial justification for this approach we could prove the exact controllability of a linear parabolic equation along a curve. The result can also be extended to a semilinear heat equation (cf. [10]).
3. Path planning for industrial robots and human models in automotive industry (I. Bremer, R. Henrion, W. Weiss).
According to the demands of our cooperation partner, our work last year was centered around three tasks: timeoptimal pathplanning avoiding collisions, pathplanning and simulation of cooperative robots, and a comparison between virtual reality and real world, to assure that robotic movements in a virtual shopfloor environment take the same time as in reality.
An additional challenge in this project is to maintain the realtime capabilities of complete shopfloor simulations including more than 100 active robots and further components.
To avoid collisions between a robot and its surrounding, one has to compute a timeoptimal path respecting a prescribed minimal distance to all objects in the scene. The circumvention of barriers is realized by introducing additional points in the robot path. If one uses the real geometry of theses barriers, the problem is highdimensional and timeconsuming. Instead, the geometries of the barriers are approximated by simple geometries, e.g., balls. Then the problem is reduced to computing the coordinates of additional auxiliary points in the robot path to obtain a timeoptimal path which respects the minimal distance to a given point (cf. Figure 4).
A typical situation in which the employment of cooperative robots is beneficial is the case of one robot moving a workpiece with a gripper while another one performs some spotwelding tasks on that workpiece (cf. Figure 5). Compared to the usual inverse kinematics problem for one robot, the number of degrees of freedom is increased by 1 to 6, depending on prescriptions for the path of the partner robot. To compute a common pair of positions, an SQP method is used to minimize the position error subject to angle constraints in the robotic joints.
4. Modeling and parameter identification for cost parameters of car factories (D. Hömberg, W. Weiss).
The aim of the project is the development of cost models in cooperation with our partner Volkswagen AG. The investments for the building of a car factory depend on a number of different variables, for example, the size of the cars, the produced number of cars per day, and the size of that part of the car which is really assembled in the respective factory. The typical number of variables is small, e.g., five. If the investment is known as a function of these variables, it is possible to optimize the costs for building a factory.
Unfortunately, there exist only few data sets of really existing factories
in order to determine a decent cost model. Therefore, the desired
formula should contain only a small number of free parameters,
which may be determined by using the data of the really existing factories.
Thus the most important part of the project was to find appropriate
cost models based on plausible assumptions which are able to reproduce
the given data with only few parameters and on the other hand allow
for an extrapolation outside the given range of parameter values.
To solve the nonlinear regression problem, the software WIASParKoM has been developed (cf. Figure 6). The free parameters in the model are determined by a hybrid optimization strategy. First a random search is used to find different possible local solutions, and then a conjugate gradient method is used to single out the best global solution. The software WIASParKoM allows for calculating and plotting costs for arbitrary values of the variables together with the corresponding confidence intervals.
References:



[Contents]  [Index] 