Numerical product design: Springback prediction, compensation and optimization

Numerical simulations are being deployed widely for product design. However, the accuracy of the numerical tools is not yet always sufficiently accurate and reliable. This article focuses on the current state and recent developments in different stages of product design: springback prediction, springback compensation and optimization by finite element (FE) analysis. To improve the springback prediction by FE analysis, guidelines regarding the mesh discretization are provided and a new through-thickness integration scheme for shell elements is launched. In the next stage of virtual product design the product is compensated for springback. Currently, deformations due to springback are manually compensated in the industry. Here, a procedure to automatically compensate the tool geometry, including the CAD description, is presented and it is successfully applied to an industrial automotive part. The last stage in virtual product design comprises optimization. This article presents an optimization scheme which is capable of designing optimal and robust metal forming processes efficiently

SHOP2: An HTN Planning System

The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. This paper describes the features of SHOP2 which enabled it to excel in the competition, especially those aspects of SHOP2 that deal with temporal and metric planning domains

Locally optimal unstructured finite element meshes in 3 dimensions

This paper investigates the adaptive finite element solution of a general class of variational problems in three dimensions using a combination of node movement, edge swapping, face swapping and node insertion. The adaptive strategy proposed is a generalization of previous work in two dimensions and is based upon the construction of a hierarchy of locally optimal meshes. Results presented, both for a single equation and a system of coupled equations, suggest that this approach is able to produce better meshes of tetrahedra than those obtained by more conventional adaptive strategies and in a relatively efficient manner

Effective Target Aware Visual Navigation for UAVs

In this paper we propose an effective vision-based navigation method that allows a multirotor vehicle to simultaneously reach a desired goal pose in the environment while constantly facing a target object or landmark. Standard techniques such as Position-Based Visual Servoing (PBVS) and Image-Based Visual Servoing (IBVS) in some cases (e.g., while the multirotor is performing fast maneuvers) do not allow to constantly maintain the line of sight with a target of interest. Instead, we compute the optimal trajectory by solving a non-linear optimization problem that minimizes the target re-projection error while meeting the UAV's dynamic constraints. The desired trajectory is then tracked by means of a real-time Non-linear Model Predictive Controller (NMPC): this implicitly allows the multirotor to satisfy both the required constraints. We successfully evaluate the proposed approach in many real and simulated experiments, making an exhaustive comparison with a standard approach.Comment: Conference paper at "European Conference on Mobile Robotics" (ECMR) 201

A Global Approach for Solving Edge-Matching Puzzles

We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this problem and provide conditions under which it exactly characterizes a puzzle. Using the new representation, we recast the combinatorial, discrete problem of solving puzzles as a global, polynomial system of equations with continuous variables. We further propose new algorithms for generating approximate solutions to the continuous problem by solving a sequence of convex relaxations

A solution to the crucial problem of population degeneration in high-dimensional evolutionary optimization

Three popular evolutionary optimization algorithms are tested on high-dimensional benchmark functions. An important phenomenon responsible for many failures - population degeneration - is discovered. That is, through evolution, the population of searching particles degenerates into a subspace of the search space, and the global optimum is exclusive from the subspace. Subsequently, the search will tend to be confined to this subspace and eventually miss the global optimum. Principal components analysis (PCA) is introduced to discover population degeneration and to remedy its adverse effects. The experiment results reveal that an algorithm's efficacy and efficiency are closely related to the population degeneration phenomenon. Guidelines for improving evolutionary algorithms for high-dimensional global optimization are addressed. An application to highly nonlinear hydrological models demonstrates the efficacy of improved evolutionary algorithms in solving complex practical problems. © 2011 IEEE