• Title/Summary/Keyword: boundary method

Search Result 7,444, Processing Time 0.05 seconds

Local Path Plan for Unpaved Road in Rough Environment (야지환경의 비포장도로용 지역경로계획)

  • Lee, Young-Il;Choe, Tok Son;Park, Yong Woon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.6
    • /
    • pp.726-732
    • /
    • 2013
  • It is required for UGV(Unmanned Ground Vehicle) to have a LPP(Local Path Plan) component which generate a local path via the center of road by analyzing binary map to travel autonomously unpaved road in rough environment. In this paper, we present the method of boundary estimation for unpaved road and a local path planning method based on RANGER algorithm using the estimated boundary. In specially, the paper presents an approach to estimate road boundary and the selection method of candidate path to minimize the problem of zigzag driving based on Bayesian probability reasoning. Field test is conducted with scenarios in rough environment in which bush, tree and unpaved road are included and the performance of proposed method is validated.

Free vibration analysis of beams with various interfaces by using a modified matched interface and boundary method

  • Song, Zhiwei;Li, Wei;He, Xiaoqiao;Xie, De
    • Structural Engineering and Mechanics
    • /
    • v.72 no.1
    • /
    • pp.1-17
    • /
    • 2019
  • This paper proposes a modified matched interface and boundary (MMIB) method to analyze the free vibration of beams with various interfaces caused by steps, intermediate rigid and elastic supports, intermediate concentrated masses and spring-mass systems, etc. A new strategy is developed to determine the parameters in the iterative computation of MMIB. The MMIB procedures are established to deal with boundary conditions and various interface conditions, which overcomes the shortcoming of the traditional MIB. A number of examples are utilized to illustrate the performance of MMIB method. Numerical results indicate that the MMIB method is a highly accurate and convergent approach for solving interface problems.

COMPUTATIONAL METHOD FOR SINGULARLY PERTURBED PARABOLIC REACTION-DIFFUSION EQUATIONS WITH ROBIN BOUNDARY CONDITIONS

  • GELU, FASIKA WONDIMU;DURESSA, GEMECHIS FILE
    • Journal of applied mathematics & informatics
    • /
    • v.40 no.1_2
    • /
    • pp.25-45
    • /
    • 2022
  • In this study, the non-standard finite difference method for the numerical solution of singularly perturbed parabolic reaction-diffusion subject to Robin boundary conditions has presented. To discretize temporal and spatial variables, we use the implicit Euler and non-standard finite difference method on a uniform mesh, respectively. We proved that the proposed scheme shows uniform convergence in time with first-order and in space with second-order irrespective of the perturbation parameter. We compute three numerical examples to confirm the theoretical findings.

An Immersed-Boundary Finite-Volume Method for Simulation of Heat Transfer in Complex Geometries

  • Kim, Jungwoo;Park, Haecheon
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.6
    • /
    • pp.1026-1035
    • /
    • 2004
  • An immersed boundary method for solving the Navier-Stokes and thermal energy equations is developed to compute the heat transfer over or inside the complex geometries in the Cartesian or cylindrical coordinates by introducing the momentum forcing, mass source/sink, and heat source/sink. The present method is based on the finite volume approach on a staggered mesh together with a fractional step method. The method of applying the momentum forcing and mass source/sink to satisfy the no-slip condition on the body surface is explained in detail in Kim, Kim and Choi (2001, Journal of Computational Physics). In this paper, the heat source/sink is introduced on the body surface or inside the body to satisfy the iso-thermal or iso-heat-flux condition on the immersed boundary. The present method is applied to three different problems : forced convection around a circular cylinder, mixed convection around a pair of circular cylinders, and forced convection around a main cylinder with a secondary small cylinder. The results show good agreements with those obtained by previous experiments and numerical simulations, verifying the accuracy of the present method.

Investigation on Method Avoiding Non-uniqueness of Direct Boundary Element Method in Acoustic Wave Radiation Problem (음향방사문제에서 직접경계요소법의 비유일성 회피방법에 관한 고찰)

  • Kim, Kook-Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.7
    • /
    • pp.2328-2333
    • /
    • 2010
  • A direct boundary element method(DBEM) is widely applied for various acoustic wave problems. But this method has numerically non-unique solutions around the eigenfrequencies of the interior Dirichlet problem for the region enveloped with the acoustic boundary. A CHIEF method had been generally adopted to resolve the non-uniqueness problem and a new technique called ICA-Ring method has been suggested recently. In this paper, the characteristics of two techniques for avoiding the non-uniqueness of DBEM are examined and numerical codes embodying both techniques are developed. Numerical calculations are also carried out for an uniformly pulsating sphere, of which the results are investigated by including the comparisons with theoretical solutions.

Depth-map Preprocessing Algorithm Using Two Step Boundary Detection for Boundary Noise Removal (경계 잡음 제거를 위한 2단계 경계 탐색 기반의 깊이지도 전처리 알고리즘)

  • Pak, Young-Gil;Kim, Jun-Ho;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.12
    • /
    • pp.555-564
    • /
    • 2014
  • The boundary noise in image syntheses using DIBR consists of noisy pixels that are separated from foreground objects into background region. It is generated mainly by edge misalignment between the reference image and depth map or blurred edge in the reference image. Since hole areas are generally filled with neighboring pixels, boundary noise adjacent to the hole is the main cause of quality degradation in synthesized images. To solve this problem, a new boundary noise removal algorithm using a preprocessing of the depth map is proposed in this paper. The most common way to eliminate boundary noise caused by boundary misalignment is to modify depth map so that the boundary of the depth map can be matched to that of the reference image. Most conventional methods, however, show poor performances of boundary detection especially in blurred edge, because they are based on a simple boundary search algorithm which exploits signal gradient. In the proposed method, a two-step hierarchical approach for boundary detection is adopted which enables effective boundary detection between the transition and background regions. Experimental results show that the proposed method outperforms conventional ones subjectively and objectively.

Efficient flexible boundary algorithms for DEM simulations of biaxial and triaxial tests

  • Liu, Donghai;Yang, Jiaqi
    • Geomechanics and Engineering
    • /
    • v.23 no.3
    • /
    • pp.189-206
    • /
    • 2020
  • The accurate modeling of boundary conditions is important in simulations of the discrete element method (DEM) and can affect the numerical results significantly. In conventional triaxial compression (CTC) tests, the specimens are wrapped by flexible membranes allowing to deform freely. To accurately model the boundary conditions of CTC, new flexible boundary algorithms for 2D and 3D DEM simulations are proposed. The new algorithms are computationally efficient and easy to implement. Moreover, both horizontal and vertical component of confining pressure are considered in the 2D and 3D algorithms, which can ensure that the directions of confining pressure are always perpendicular to the specimen surfaces. Furthermore, the boundaries are continuous and closed in the new algorithms, which can prevent the escape of particles from the specimens. The effectiveness of the proposed algorithms is validated by biaxial and triaxial simulations of granular materials. The results show that the algorithms allow the boundaries to deform non-uniformly on the premise of maintaining high control accuracy of confining pressure. Meanwhile, the influences of different lateral boundary conditions on the numerical results are discussed. It is indicated that the flexible boundary is more appropriate for the models with large strain or significant localization than rigid boundary.

Extracting The Prostate Boundary Using Direction Features of Prostate Boundary On Ultrasound Prostate Image

  • Park, Jae Heung;Seo, Yeong Geon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.11
    • /
    • pp.103-111
    • /
    • 2016
  • Traditionally, in the hospital the doctors saw the TRUS images by their eyes and manually segmented the boundary between the prostate and nonprostate. But the manually segmenting process not only needed too much time but also had different boundaries according to the doctor. To cope the problems, some automatic segmentations of the prostate have been studied to generate the constant segmentation results and get the belief from patients. Besides, on detecting the boundary, the ones in the middle of all images are easy to find the boundary but the base and apex of the images are hard to do it since there are lots of uncertain boundary. Accurate detection of prostate boundaries is a challenging and difficult task due to weak prostate boundaries, speckle noises and the short range of gray levels. In this paper, we propose the method that extracts a prostate boundary using features of its directions on prostate image. As a result of our experiments, it shows that the boundary never falls short of the existing methods or human expert's segmentation. And also, its searching speed is too fast because the method searches a smaller area that other methods.

A Study on the Enhancement of the Solution Accuracy of Meshless Particle Method (무요소절점법의 수치해 정도 향상을 위한 연구)

  • 이상호;김상효;강용규;박철원
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1997.04a
    • /
    • pp.3-10
    • /
    • 1997
  • Meshless particle method is a numerical technique which does not use the concept of element. This method can easily handle special engineering problems which cause difficulty in the use of finite element method, however it has a drawback that essential boundary condition is not satisfied. In this paper, several studies for satisfying essential boundary conditions and enhancing the accuracy of solutions are discussed. Particular emphasis is placed on a new numerical technique in which finite elements are used on the boundaries to satisfy the essential boundary conditions and meshless particle method is used in the interior domain. For coupling of the two methods interface elements are introduced into the zone between the subdomains using meshless particle method and finite element method. The shape functions and the approximated displacement functions of the interface element are derived with the ramp function based on the shape function of finite elements. The whole numerical procedures are formulated by Galerkin method. Several numerical examples for enhancing the accuracy of solution in the meshless particle method and a new coupling method are presented.

  • PDF

An Efficient Shape-Feature Computing Method from Boundary Sequences of Arbitrary Shapes (임의 형상의 윤곽선 시퀀스 정보로부터 형상 특징의 효율적인 연산 방법)

  • 김성옥;김동규;김민환
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.3
    • /
    • pp.255-262
    • /
    • 2002
  • A boundary sequence can be a good representation of arbitrary shapes, because it can represent them simply and precisely. However, boundary sequences have not been used as a representation of arbitrary shapes, because the pixel-based shape-features such as area, centroid, orientation, projection and so forth, could not be computed directly from them. In this paper, we show that the shape-features can be easily computed from the boundary sequences by introducing the cross-sections that are defined as vertical (or horizontal) line segments in a shape. A cross-section generation method is proposed, which generates cross-sections of the shape efficiently by tracing the boundary sequence of the shape once. Furthermore, a boundary sequence extraction method is also proposed, which generates a boundary sequence for each shape in a binary image automatically The proposed methods work well even if a shape has holes. Eventually, we show that a boundary sequence can be used effectively for representing arbitrary shapes.

  • PDF