• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1054-1059
• /
• 2005

The artificial potential method uses a potential field to guide a robot from a start to a goal configuration respectively. The potential field consists of attractive potential used to pull a robot toward a goal and repulsive potential to keep it away from obstacles. However, there are two problems concerning local minimum and computational cost to be resolved in conventional artificial potential methods. This study proposes a method utilizing a spline surface that interpolates arbitrary boundaries and a domain reduction method that reduces the unnecessary area. The proposed spline surface interpolates arbitrary shaped boundaries and is used as an artificial potential to guide a robot for global motion planning of a mobile robot. A reduced domain process reduces the unnecessary domain. We apply a distance-weighted function as such a function, which blends distances from each boundary with a reduction in computational time compared with other analytical methods. As a result, this paper shows that an arbitrary boundary spline surface provides global planning and a domain reduction method reduces local minimum with quick operation.

• Computational Structural Engineering
• /
• v.10 no.3
• /
• pp.217-223
• /
• 1997

This paper deals with the basic concepts of sensitivity analysis in a time domain for the transient response of a lumped mass system. Sensitivity analysis methods in thme domain for determining the effects of parameter changes on the response of a dynamic system by external excitation are presented. The parametric sensitivity of a lumped mass system in time domain can be investigated using different types of sensitivity functions, including first order standard and percentage sensitivity functions. These sensitivity functions are determined as a function of partial derivatives of system variables taken with respect to system parameters. In addition, we compared the results of the analytical method by direct method and those of numerical methods.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.2
• /
• pp.165-173
• /
• 2010

In this paper, the dynamic stiffness of scaled boundary finite element method(SBFEM) was analytically derived to represent the non-homogeneous space. The non-homogeneous parameters were introduced as an expotential value of power function which denoted the non-homogeneous properties of analysis domain. The dynamic stiffness of analysis domain was asymptotically expanded in frequency domain, and the coefficients of polynomial series were determined to satify the radiational condition. To verify the derived dynamic stiffness of domain, the numerical analysis of the typical problems which have the analytical solution were performed as various non-homogeneous parameters. As results, the derived dynamic stiffness adequatlly represent the features of the non-homogeneous space.

• Structural Engineering and Mechanics
• /
• v.21 no.4
• /
• pp.437-450
• /
• 2005

In this study, a complete analysis of soil-structure interaction problems is presented which includes a modelling of the near surrounding of the building (near-field) and a special description of the wave propagation process in larger distances (far-field). In order to reduce the computational effort which can be very high for time domain analysis of wave propagation problems, a special approach based on similarity transformation of the infinite domain on the near-field/far-field interface is applied for the wave radiation of the far-field. The near-field is discretised with standard Finite Elements, which also allows to introduce non-linear material behaviour. In this paper, a new approach to calculate the involved convolution integrals is presented. This approximation in time leads to a dramatically reduced computational effort for long simulation times, while the accuracy of the method is not affected. Finally, some benchmark examples are presented, which are compared to a coupled Finite Element/Boundary Element approach. The results are in excellent agreement with those of the coupled Finite Element/Boundary Element procedure, while the accuracy is not reduced. Furthermore, the presented approach is easy to incorporate in any Finite Element code, so the practical relevance is high.

• Journal of computational fluids engineering
• /
• v.18 no.4
• /
• pp.41-46
• /
• 2013

The selection of the optimal position of the flap was performed in order to improve the aerodynamic performance during the take-off and landing processes of aircraft. For this, the existing airfoils of the main wing and flap are selected as the baseline model and the lift coefficients (cl) according to angle of attacks (AOA) were calculated with the change of the position of flap airfoil. The objective function was defined as the consideration of the maximum cl, lift to drag ratio and cl at certain AOA. Then, at 121 experimental points within $20mm{\times}20mm$ domain, two dimensional flow simulations with Spalart-Allmaras turbulence model were performed concerning the AOA from 0 to 15 degree. If the optimal position was located at the domain boundary, the domain moved to the optimal position. These processes were iterated until the position was included in the inside of the domain. From these processes, the flow separation at low AOA was removed and cl increased linearly comparing with that of the baseline model.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.35-44
• /
• 2009

This paper describes an application of domain decomposition method for parallel finite element analysis which is required to large scale 3D structural analysis. A parallel finite element method system which adopts a domain decomposition method is developed. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay triangulation method is introduced as a basic tool for element generation. Domain decomposition method using automatic mesh generation system holds great benefits for 3D analyses. Aa parallel numerical algorithm for the finite element analyses, domain decomposition method was combined with an iterative solver, i.e. the conjugate gradient(CG) method where a whole analysis domain is fictitiously divided into a number of subdomains without overlapping. Practical performance of the present system are demonstrated through several examples.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.1
• /
• pp.19-28
• /
• 2007

Discrete topology optimization processes of structures start from an initial design domain which is described by the topology of constant material densities. During optimization procedures, the structural topology changes in order to satisfy optimization problems in the fixed design domain, and finally, the optimization produces material density distributions with optimal topology. An introduction of initial holes in a design domain presented by Eschenauer et at. has been utilized in order to improve the optimization convergence of boundary-based shape optimization methods by generating finite changes of design variables. This means that an optimal topology depends on an initial topology with respect to topology optimization problems. In this study, it is investigated that various optimal topologies can be yielded under constraints of usable material, when partial solid phases are deposited in an initial design domain and thus initial topology is finitely changed. As a numerical application, structural topology optimization of a simple MBB-Beam is carried out, applying partial circular solid phases with varying sizes to an initial design domain.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.13-19
• /
• 2001

The conventional fractal decoding was required a vast amount computational complexity, since every range blocks was implemented to IFS(iterated function system). In order to improve this, it has been suggested that each range block was classified to iterated and non-iterated regions. Non-iterated regions is called data dependency region, and if data dependency region extended, IFS regions are contractive. In this paper, a searched region of the domain is limited to the range regions that is similar with the domain blocks, and the domain region is more overlapped. As a result, data dependency region has maximum region, that is IFS regions can be minimum region. The minimizing method of domain region is defined to minimum domain(MD) which is minimum IFS region. Using the minimizing method of domain region, there is not influence PSNR(peak signal-to-noise ratio). And it can be performed a fast decoding by reducing the computational complexity for IFS in fractal image decoding.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.27-44
• /
• 2001

A fast Poisson solver on irregular domains, based on bound-ary methods, is presented. The harmonic polynomial approximation of the solution of the associated homogeneous problem provides a good practical boundary method which allows a trivial parallel processing for solution evaluation or straightfoward computations of the interface values for domain decomposition/embedding. AMS Mathematics Subject Classification : 65N35, 65N55, 65Y05.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.779-784
• /
• 2008

We show that $\mathbb{Z}[\sqrt{-p}]$ is not a unique factorization domain (UFD) but a factorization domain (FD) with a condition $1\;+\;a^2p\;=\;qr$, where a and p are positive integers and q and r are positive primes in $\mathbb{Z}$ with q < p. Using this result, we also construct several specific non-unique factorization domains which are factorization domains. Furthermore, we prove that an integral domain $\mathbb{Z}[\sqrt{-p}]$ is not a UFD but a FD for some positive integer p.