• 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.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.7 no.1
• /
• pp.104-111
• /
• 1998

This study solves the inverse kinematics problem of industrial FANUC robot. Because every joint angle of FANUC robot is dependent on the position of end-effector and the direction of approach vector, arm metrix T6 is very complicated and each joint angle is a function of other joint angles. Therefore, the inverse kinematics problem can not be solved by conventional methods. Noticing the fact that if one joint angle is known, the other joint angles are calculated by the algebraic methods. $ heta$1 is calculated using neumerical analysis method, and solves inverse kinematics problem. This proposed method, in this study, is more simpler and faster than conventional methods and is very useful in the real-time control of the manipulator.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.23 no.3
• /
• pp.364-373
• /
• 1999

A combination of conjugate gradient and Levenberg-Marquardt method is used to estimate the spatially varying scattering coefficient, ${\sigma}(r)$, in the solid and hollow spheres by utilizing the measured transmitted beams from the solution of an inverse analysis. The direct radiation problem associated with the inverse problem is solved by using the $S_{12}-approximation$ of the discrete ordinates method. The accuracy of the computations increased when the results from the conjugate gradient method are used as an initial guess for the Levenberg-Marquardt method of minimization. Optical thickness up to ${\tau}_0=3$ is used for the computations. Three different values of standard deviation are considered to examine the accuracy of the solution from the inverse analysis.

• International Journal of Precision Engineering and Manufacturing
• /
• v.2 no.1
• /
• pp.76-80
• /
• 2001

A binary parallel robot manipulator uses actuators that have only two stable states being built by stacking variable geometry trusses on top of each other in a long serial chain. Discrete characteristics of the binary manipulator make it impossible to analyze an inverse kinematic problem in conventional ways. We therefore introduce new definitions of workspace and inverse kinematic solution, and the apply a genetic algorithm to the newly defied inverse kinematic problem. Numerical examples show that our genetic algorithm is very efficient to solve the inverse kinematic problem of binary robot manipulators.

• Journal of Ocean Engineering and Technology
• /
• v.14 no.2
• /
• pp.121-127
• /
• 2000

In this paper a new technique of inverse fairing problem for ship hull is proposed. Recently Lu solved the inverse fairing problem for automobile's body that was made by one surface element. In this system however hull surface is constructed by Gregory's composite surface interpolation method. So reflection line at boundary position is used as a tool of solving inverse problem in surface fairing. But the results are not good. The new concepts of Normal vector line and Constrained reflection line are introduced as an alternative tool. Energy minimization method for Normal Vector Line curve net and the inverse method for Constrained Reflection Line by using optimization technique are examined And the final lines from this proposed surface fairing method shows good fairness.

• Kyungpook Mathematical Journal
• /
• v.64 no.2
• /
• pp.353-369
• /
• 2024

In this study, we investigate the unknown time-dependent heat source function in inverse problems. We consider three general nonlocal conditions; two classical boundary conditions and one nonlocal over-determination, condition, these genereate six different cases. The finite integration method (FIM), based on numerical integration, has been adapted to solve PDEs, and we use it to discretize the spatial domain; we use backward differences for the time variable. Since the inverse problem is ill-posed with instability, we apply regularization to reduce the instability. We use the first-order Tikhonov's regularization together with the minimization process to solve the inverse source problem. Test examples in all six cases are presented in order to illustrate the accuracy and stability of the numerical solutions.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.461-470
• /
• 2007

Parameter identification is studied in viscoelastic rods by solving an inverse problem numerically. The material properties of the rod, which appear in the constitutive relations, are recovered by optimizing an objective function constructed from reference strain data. The resulting inverse algorithm consists of an optimization algorithm coupled with a corresponding direct algorithm that computes the strain fields given a set of material properties. Numerical results are presented for two model inverse problems; (i)the effect of noise in the reference strain fields (ii) the effect of minimal reference data in space and/or time data.

• Communications of the Korean Mathematical Society
• /
• v.16 no.3
• /
• pp.437-443
• /
• 2001

In this paper the inverse problems for the Dirac Operator are studied. A set of values of eigenfunctions in some internal point and spectrum are taken as a data. Uniqueness theorems are obtained. The approach that was used in the investigation of inverse problems for interior spectral data of the Sturm-Liouville operator is employed.

• International Journal of Precision Engineering and Manufacturing
• /
• v.8 no.1
• /
• pp.59-65
• /
• 2007

This paper suggests a method for developing computer code that can solve inverse heat conduction problem, The concept of the object-oriented development is employed to implement the computer code in an efficient and flexible fashion. The software design is conducted based on the unified modeling language. Furthermore, this paper also explains how to implement the deliverable computer code using the existing software development tools.

• Journal of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.781-791
• /
• 2001

We consider the inverse conductivity problem to identify the unknown conductivity $textsc{k}$ as well as the domain D. We show hat, unlike the case when $textsc{k}$ is known, even a two or three dimensional ball may not be identified uniquely if the conductivity constant $textsc{k}$ is not known. We find a necessary and sufficient condition on the Cauchy data (u│∂Ω, g) for the uniqueness in identification of $textsc{k}$ and D. We also discuss on failure of stability.