An important insufficiency of modern industrial plans is their lack of robustness. Disruptions prevent companies from operating as planned before and induce high costs for trouble shooting. The main reason for the severe impact of disruptions stems from the fact that planners do traditionally consider the precise input to be available at planning time. The repair game is a formalization of a planning task, and playing it performs disruption management and generates robust plans with the help of game tree search. Technically, at each node of a search tree, a traditional optimization problem is solved such that large parts of the computation time are blocked by sequential computations. Nevertheless, there is enough node parallelism which the authors can make use of, in order to bring the running times onto a real-time level, and in order to increase the solution quality per minute significantly. Thus, they are able to present a planning application at the cutting-edge of operations research, heavily taking advantage of parallel game tree search. They present simulation experiments which show the benefits of the repair game, as well as speedup results.
Parallelism for perturbation management and robust plans
Parallelrechnereinsatz für Störungsmanagement und robuste Planung
2005
10 Seiten, 1 Bild, 2 Tabellen, 19 Quellen
Aufsatz (Konferenz)
Englisch
Robust Adaptive Controller with Fine Grain Parallelism
British Library Conference Proceedings | 2000
|CLASSIFICATION ROBUST AGAINST MULTIPLE PERTURBATION TYPES
Europäisches Patentamt | 2020
|Perturbation Theory Based Robust Design Under Model Uncertainty
Online Contents | 2009
|Parallelism in planar kinematic chains (manipulators)
Online Contents | 2004
|