• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.2
• /
• pp.127-135
• /
• 2024

Recent studies have shown that inverse design using deep learning has the potential to rapidly generate the optimal design that satisfies the target performance without the need for iterative optimization processes. Unlike traditional methods, deep learning allows the network to rapidly generate a large number of solution candidates for the same objective after a single training, and enables the generation of diverse designs tailored to the objectives of inverse design. These inverse design techniques are expected to significantly enhance the efficiency and innovation of design processes in various fields such as aerospace, biology, medical, and engineering. We analyzes inverse design models that are mainly utilized in the nano and chemical fields, and proposes inverse design models based on supervised and unsupervised learning that can be applied to the engineering system. It is expected to present the possibility of effectively applying inverse design methodologies to the design optimization problem in the field of engineering according to each specific objective.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.10
• /
• pp.1574-1582
• /
• 2004

Binary manipulators have recently received much attention due to hyper-redundancy, light weight, good controllability and high reliability. The precise positioning of the manipulator end-effecter requires the use of many modules, which results in a high-dimensional workspace. When the workspace dimension is large, existing inverse kinematics methods such as the Ebert-Uphoff algorithm may require impractically large memory size in determining the binary positions of all actuators. To overcome this limitation, we propose a new inverse kinematics algorithm: the inverse kinematics problem is formulated as an optimization problem using real-valued design variables, The key procedure in this approach is to transform the integer-variable optimization problem to a real-variable optimization problem and to push the real-valued design variables as closely as possible to the permissible binary values. Since the actual optimization is performed in real-valued design variables, the design sensitivity becomes readily available, and the optimization method becomes extremely efficient. Because the proposed formulation is quite general, other design considerations such as operation power minimization can be easily considered.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.805-815
• /
• 2022

The model-based evolutionary algorithms are divided into three groups: estimation of distribution algorithms, inverse modeling, and surrogate modeling. Existing inverse modeling is mainly applied to solve multi-objective optimization problems and is not suitable for many-objective optimization problems. Some inversed-model techniques, such as the inversed-model of multi-objective evolutionary algorithm, constructed from the Pareto front (PF) to the Pareto solution on nondominated solutions using a random grouping method and Gaussian process, were introduced. However, some of the most efficient inverse models might be eliminated during this procedure. Also, there are challenges, such as the presence of many local PFs and developing poor solutions when the population has no evident regularity. This paper proposes inverse modeling using random forest regression and uniform reference points that map all nondominated solutions from the objective space to the decision space to solve many-objective optimization problems. The proposed algorithm is evaluated using the benchmark test suite for evolutionary algorithms. The results show an improvement in diversity and convergence performance (quality indicators).

• Transactions of Materials Processing
• /
• v.26 no.1
• /
• pp.41-47
• /
• 2017

Cyclic behavior of advanced high strength steel sheets was measured using an inverse-optimization approach with pre-straining and bending. First, tensile specimens were pre-strained, and three-point bending was conducted for the pre-strained specimens. By using the inverse finite element optimization, the combined isotropic-kinematic hardening parameters that minimize the error between the measured and predicted bending force-displacement curves. The measured cyclic behavior agreed well with the cyclic behavior measured by sheet tension-compression test, which confirms the validity of the measuring procedure based on inverse optimization.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.11
• /
• pp.3398-3407
• /
• 1996

In this paper, we derive an algorithm and develope a computer program which analyze rapidly and precisely the inverse kinematics of robotic mechanism with spatial complex chain structure based on the relative coordinates. We represent the inverse kinematic problem as an optimization problem with the kinematic constraint equations. The inverse kinematic analysis algorithm, therefore, consists of two algorithms, the main, an optimization algorithm finding the motion of independent joints from that of an end-effector and the sub, a forward kinematic analysis algorithm computing the motion of dependent joints. We accomplish simulations for the investigation upon the accuracy and efficiency of the algorithm.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.34 no.7
• /
• pp.679-688
• /
• 2010

The major objective of the present study is to extend the applications of inverse analysis to more realistic engineering fields with a complex combustion process rather than the traditional simple heat-transfer problems. In order to do this, the unknown initial mass fractions of $CH_4/O_2$ are estimated from the temperature measurement data by inverse analysis in the practical diffusion-controlled turbulent combustion problem. In order to ensure efficient inverse analysis, the repulsive particle swarm optimization (RPSO) method, which belongs to the class of stochastic evolutionary global optimization methods, is implemented as an inverse solver. Based on this study, it is expected that useful information can be obtained when inverse analysis is used in the diagnosis, design, or optimization of real combustion systems involving unknown parameters.

• Journal of computational fluids engineering
• /
• v.3 no.1
• /
• pp.37-45
• /
• 1998

A new and efficient inverse design method based on the numerical optimization technique has been developed. The 2-D incompressible Navier-Stokes equations are solved for obtaining the objective functions and coupled with the optimization procedure to perform the inverse design. The steepest descent and the conjugate gradient method have been applied to find the searching direction. The golden section method was applied to compute the design variable intervals. It has been found that the airfoil and the pump impellers are well converged to their targeting shapes.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.7 s.178
• /
• pp.1753-1762
• /
• 2000

An inverse method is presented to obtain material's flow properties by using small punch test. This procedure employs, as the objective function of inverse analysis, the balance of measured load-di splacement response and calculated one during deformation. In order to guarantee convergence to global minimum, simulated annealing method was adopted to optimize the current objective function. In addition, artificial neural network was used to predict the load-displacement response under given material parameters which is the most time consuming and limits applications of global optimization methods to these kinds of problems. By implementing the simulated annealing for optimization along with calculating load-displacement curve by neural network, material parameters were identified irrespective of initial values within very short time for simulated test data. We also tested the present method for error-containing experimental data and showed that the flow properties of material were well predicted.

• Proceedings of the KSME Conference
• /
• 2000.04b
• /
• pp.144-147
• /
• 2000

A numerical method for the solution of one-dimensional inverse heat conduction problem is established and its performance is demonstrated with computational results. The present work introduces the maximum entropy method in order to build a robust formulation of the inverse problem. The maximum entropy method finds the solution that maximizes the entropy functional under given temperature measurement. The philosophy of the method is to seek the most likely inverse solution. The maximum entropy method converts the inverse problem to a non-linear constrained optimization problem of which constraint is the statistical consistency between the measured temperature and the estimated temperature. The successive quadratic programming facilitates the maximum entropy estimation. The gradient required fur the optimization procedure is provided by solving the adjoint problem. The characteristic feature of the maximum entropy method is discussed with the illustrated results. The presented results show considerable resolution enhancement and bias reduction in comparison with the conventional methods.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.119-126
• /
• 2019

The partial inverse optimization problem is an interesting variant of the inverse optimization problem in which the given instance of an optimization problem need to be modified so that a prescribed partial solution can constitute a part of an optimal solution in the modified instance. In this paper, we consider the traveling salesman problem defined on the line (TSP on the line) which has many applications such as item delivery systems, the collection of objects from storage shelves, and so on. It is worth studying the partial inverse TSP on the line, defined as follows. We are given n requests on the line, and a sequence of k requests that need to be served consecutively. Each request has a specific position on the real line and should be served by the server traveling on the line. The task is to modify as little as possible the position vector associated with n requests so that the prescribed sequence can constitute a part of the optimal solution (minimum Hamiltonian cycle) of TSP on the line. In this paper, we show that the partial inverse TSP on the line and its variant can be solved in polynomial time when the sever is equiped with a specific internal algorithm Forward Trip or with a general optimal algorithm.