• International Journal of Control, Automation, and Systems
• /
• v.3 no.2
• /
• pp.211-216
• /
• 2005

In electrical impedance tomography (EIT), various image reconstruction algorithms have been used in order to compute the internal resistivity distribution of the unknown object with its electric potential data at the boundary. Mathematically, the EIT image reconstruction algorithm is a nonlinear ill-posed inverse problem. This paper presents a simulated annealing technique as a statistical reconstruction algorithm for the solution of the static EIT inverse problem. Computer simulations with 32 channels synthetic data show that the spatial resolution of reconstructed images by the proposed scheme is improved as compared to that of the mNR algorithm at the expense of increased computational burden.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.22 no.2
• /
• pp.256-262
• /
• 2013

This paper presents a linear path control algorithm for NeuroMate robot in a skull drilling system. For the path control inverse kinematics of the robot is analyzed and a linear interpolation algorithm is presented. A geometric approach is used for solving inverse kinematic equations for the robot. Four feasible solutions are found through the approach. The approach gives geometric insights for selecting the best solution from the feasible solutions. The presented linear interpolation algorithm computes a next position considering current velocity and remaining distance to the target position. Presented algorithm is implemented and tested in a skull drilling system.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.283-287
• /
• 1996

The exhaust noise reduction of automobile with the active muffler is experimentally investigated. The control algorithm is the filtered-x LMS algorithm and the inverse algorithm with the adaptive line enhancer. Also, the control efficiency is increased with synthesized second harmonic engine frequency. In the experiment, the active muffler is applied to the end of exhaust system in automobile and the control with on-line secondary path modeling method(inverse algorithm) is compared the control of off-line secondary path modeling method. As secondary path transfer functions are changed, the experimental results show that the control performance with on-line method is more efficient than that with off-line method in the exhaust noise reduction of automobile.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.2
• /
• pp.120-127
• /
• 2003

In electrical impedance tomography(EIT), various image reconstruction algorithms have been used in order to compute the internal resistivity distribution of the unknown object with its electric potential data at the boundary. Mathematically the EIT image reconstruction algorithm is a nonlinear ill-posed inverse problem. This paper presents a simulated annealing technique as a statistical reconstruction algorithm for the solution of the static EIT inverse problem. Computer simulations with the 32 channels synthetic data show that the spatial resolution of reconstructed images by the proposed scheme is improved as compared to that of the mNR algorithm or genetic algorithm at the expense of increased computational burden.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.12
• /
• pp.2055-2067
• /
• 1997

Values of process parameters in sheet metal forming can be estimated by various one-step inverse methods. One-step inverse methods based on deformation theory, however, cause some amount of error. The amount of error is generally increased as the deformation path becomes more complex. As a remedy, a new three dimensional multi-step inverse method is introduced for optimum design of blank shapes and strain distributions from desired final shapes. The approach extends a one-step inverse method to a multi-step inverse method in order to reduce the amount of error. The algorithm developed is applied to square cup drawing to confirm its validity by demonstrating reasonably accurate numerical results. Rapid calculation with this algorithm enables easy determination of an initial blank of sheet metal forming.

• The Journal of Korea Robotics Society
• /
• v.12 no.1
• /
• pp.42-54
• /
• 2017

Using an inverse of the geometric Jacobian matrix is one of the most popular ways to control robot manipulators, because the Jacobian matrix contains the relationship between joint space velocities and operational space velocities. However, the control algorithm based on Jacobian matrix has algorithmic singularities: The robot manipulator becomes unstable when the Jacobian matrix loses rank. To solve this problem, various methods such as damped and filtered inverse have been proposed, but comparative studies to evaluate the performance of these algorithms are insufficient. Thus, this paper deals with a comparative analysis of six representative singularity avoidance algorithms: Damped Pseudo Inverse, Error Damped Pseudo Inverse, Scaled Jacobian Transpose, Selectively Damped Inverse, Filtered Inverse, and Task Transition Method. Especially, these algorithms are verified through computer simulations with a virtual model of a humanoid robot, THORMANG, in order to evaluate tracking error, computational time, and multiple task performance. With the experimental results, this paper contains a deep discussion about the effectiveness and limitations of each algorithm.

• Journal of the Korea Convergence Society
• /
• v.9 no.10
• /
• pp.249-255
• /
• 2018

This paper presents a human-centered control algorithm for personalized autonomous driving based on the integration of inverse time-to-collision and time headway. In order to minimize the sense of difference between driver and autonomous driving, the human-centered control technology is required. Driving characteristics in case that vehicle drives with the preceding vehicle have been analyzed and reflected to the longitudinal control algorithm. The driving characteristics such as acceleration, inverse time-to-collision, time headway have been analyzed for longitudinal control. The control algorithm proposed in this study has been constructed on Matlab/Simulink environment and the performance evaluation has been conducted by using actual driving data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.796-804
• /
• 1994

This paper presents Inverse SAR imaging algorithm for a unknown velocity target and a real ISAR data is processed and applied to the algorithm. The real ISAR data is obtained by transmitting a number of pulse modulated by a stepped-frequency method and the received data are undersampled. We present a method applicable for the case of a undersampled data base. In this method, the original echoed signal is mixed with a reference signal to make it unaliased, followed by being interpolated. Target`s velocity required for the algorithm is estimated via subaperture processing and after the coordinate transformation into squint-mode SAR with the estimated velocity, a recently proposed SAR/ISAR imaging algorithm derived without any approximation is utilized to produce the output image. We also propose an ISAR image scheme that is usable when a target changes its velocity during ISAR data acquisition time.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.159-162
• /
• 2007

The inverse kinematics problem in robotics is an essential work for grasping and manipulation tasks by robotic and humanoid hands. In this paper, an intelligent neural learning scheme for solving such inverse kinematics of humanoid fingers is presented. Specifically, a multi-layered neural network is utilized for effective inverse kinematics, where a dynamic neural learning algorithm is employed. Also, a bio-mimetic feature of general human fingers is incorporated to the learning scheme. The usefulness of the proposed approach is verified by simulations.

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