• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.4
• /
• pp.297-303
• /
• 2014

Using the bond-based peridynamics and the parallel computation with binary decomposition, an adjoint shape design sensitivity analysis(DSA) method is developed for the dynamic crack propagation problems. The peridynamics includes the successive branching of cracks and employs the explicit scheme of time integration. The adjoint variable method is generally not suitable for path-dependent problems but employed since the path of response analysis is readily available. The accuracy of analytical design sensitivity is verified by comparing it with the finite difference one. The finite difference method is susceptible to the amount of design perturbations and could result in inaccurate design sensitivity for highly nonlinear peridynamics problems with respect to the design. It turns out that $C^1$-continuous volume fraction is necessary for the accurate evaluation of shape design sensitivity in peridynamic discretization.

• Convergence Security Journal
• /
• v.13 no.6
• /
• pp.77-82
• /
• 2013

Looking at the recent value change of users and the usage pattern of network users, it is changing from simple web information, one-way information acquisition and data transmission to increase of usage of multimedia, increasing demand for security and customization, and increasing demands for free mobility. Due to this change of demand, the services which were provided individually, developed into a form which is merged, the network also seems to develop into the combined network from the individual network for individual service, and the communication network control technology which is the core technology is also rapidly developing.. This paper propose three path computation scheme that not only use the resources effectively but also to minimize the information transmissions between the multi-layers in a multi-domain environment. This paper also suggested that the optimum path choice be performed through diversification of the path selection using the information of various layers altogether in the multi-layer environment, compared with the established path selection method when the path was selected using the information of each layers.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.699-703
• /
• 1993

When the error path can be modeled as a pure delay, an adaptive algorithm for slowly time varying system is proposed to minimize the sound pressure level. This algorithm makes it possible to use the fittered-x LMS algorithm with on-line delay modeling of the error path. Another simple adaptive algorithm for pure tone noise is proposed which eliminates the cross term in the multiple error filtered-x LMS algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1014-1020
• /
• 1990

Iterative algorithms for detecting the collision of convex objects whose motion is characterized by a path in configuration space are described. They use as an essential substep the computation of the distance between the two objects. When the objects are polytopes in either two or three dimensional space, an algorithm is given which terminates in a finite number of iterations. It determines either that no collision occurs or the first collision point on the path. Extensive numerical experiments for practical problems show that the computational time is short and grows only linearly in the total number of vertices of the two polytopes.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1140-1143
• /
• 1996

A new approach based on artificial potential function is proposed for the obstacle avoidance of redundant manipulators. Unlike the so-called "global" path planning method, which requires expensive computation for the path search before the manipulator starts to move, this new approach, "local" path planning, researches the path in real-time using the local distance information. Previous use of artificial potential function has exhibited local minima in some complex environments. This thesis proposes a potential function that has no local minima even for a cluttered environment. This potential function has been implemented for the collision avoidance of a redundant robot in Simulation. The simulation also employ an algorithm that eliminates collisions with obstacles by calculating the repulsive potential exerted on links, based on the shortest distance to object.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.698-702
• /
• 1992

In this paper, Micro-Genetic algorithms(.mu.-GAs) is proposed on a minimum-time path planning for robot manipulator, which is a kind of optimization algorithm. The minimum-time path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computation burden and can't often find the optimal values. One way to overcome such difficulties is to apply the Micro-Genetic Algorithms, which can allow to find the optimal values, to the minimum-time problem. This paper propose an approach for solving the minimum-time path planning by using Micro-Genetic Algorithms. The effectiveness of the proposed method is demonstrated using the 2 d.o.f plannar Robot manipulator.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.40-47
• /
• 1994

In this paper, Micro-Genetic algorithms($\mu$-GAs) is proposed on a minimum-time path planning for robot manipulator. which is a kind of optimization algorithm. The minimum-time path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computation burden and can`t often find the optimaul values. One way to overcome such difficulties is to apply the Micro-Genetic Algorithms, which can allow to find the optimul values, to the minimum-time problem. This paper propose an approach for solving the minimum-time path planning by using Micro-Genetic Algorithms. The effectiveness of the proposed method is demonstrated using the 2 d.o.f plannar Robot manipulator.

• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.485-491
• /
• 1990

We propose a minimum-time path planning soheme for the robot manipulator using Hopfield neural network. The minimum-time path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computational burden and thus limits the on-line application. One way to avoid such a difficulty is to apply the neural network technique, which can allow the parallel computation, to the minimum-time problem. This paper propose an approach for solving the minimum-time path planning by using Hopfield neural network. The effectiveness of the proposed method is demonstrarted using the PUMA 560 manipulator.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.9
• /
• pp.1364-1371
• /
• 1990

We propose a time-optimal path planning scheme for the robot manipulator using Hopfield neural network. The time-optimal path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computational burden and thus limits the on-line application. One way to avoid such a difficulty is to apply the neural networke technique, which can allow the parallel computation, to the minimum time problem. This paper proposes an approach for solving the time-optimal path planning by using Hopfield neural network. The effectiveness of the proposed method is demonstrarted using a PUMA 560 manipulator.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2001.09a
• /
• pp.19-27
• /
• 2001

Seismic parameters fur computation of ground motions in Southern Korea are obtained from recently recorded data, and site-independent regional and site-dependent local strong ground motions are predicted using efficient computational techniques. For the computation of ground motions, we devised an efficient procedure to compute site-independent $x_{q}$ and dependent $x_{s}$ values separately. The first step of this procedure is to use the coda normalization method far computation of site independent Q or corresponding $x_{q}$ value. The next step is the computation of $x_{s}$, values fur each site separately using the given $x_{q}$ value. For computation of ground motions the empirical Green's function (EGF) is modified to account fur the depth and distance variations of subevents on a finite fault plane using the theoritical Green's function. It is computed using wavenumber integration technique in layered media. The site dependent ground motions at seismic stations in southeastern local area were properly simulated using the modified empirical Green's function method in layered medium. The proposed method and procedures fur estimation of site dependent seismic parameters and ground motions could be efficiently used in the low and moderate seismicity regions.ons.s.ons.