• 대한수학회보
• /
• 제60권2호
• /
• pp.495-505
• /
• 2023

In this note, we study a comparison principle for elliptic obstacle problems of p-Laplacian type with L¹-data. As a consequence, we improve some known regularity results for obstacle problems with zero Dirichlet boundary conditions.

• 한국안전학회지
• /
• 제35권1호
• /
• pp.12-17
• /
• 2020

This paper analyzes functions of component parts of D-Urban Railway's door system along with operation obstacle risks on frequency(the number of occurrences/year) and severity(delay time/the number of occurrences). Based on this, the paper presents improvements and current system's problems after obstacle risks of EMU and door system are appled. The obstacle of door system causes corrosion of main parts such as DCU due to heat problem of operation environment, problems of maintenance methods and deterioration. DCUs on PCBs with more than 50% pattern corrosion cause problems. Even though the number of door system's obstacle occurrences for the last 5 years is 42, along with 104 minutes of operation obstacle, EMU operation obstacle risk is low(Level 1), which indicates there is limit in matrix of railway risks presented by the standard of railway safety management system. Therefore, it is necessary to have railway risk matrix suitable for the field. Finally, the paper deducts the obstacle risks through frequency and severity. Since 2017 when the risks of EMU and door system's obstacle, that of EMU has been 24(47% reduced) and that of door system has been average 9.5 per year(23% reduced).

• 대한수학회지
• /
• 제49권5호
• /
• pp.893-905
• /
• 2012

Kirsi Majava and Xue-Cheng Tai [12] proposed a modified level set method for solving a free boundary problem associated with unilateral obstacle problems. The proximal bundle method and gradient method were applied to solve the nonsmooth minimization problems and the regularized problem, respectively. In this paper, we extend this approach to solve the bilateral obstacle problems and employ Rung-Kutta method to solve the initial value problem derived from the regularized problem. Numerical experiments are presented to verify the efficiency of the methods.

• Journal of applied mathematics & informatics
• /
• 제5권3호
• /
• pp.749-758
• /
• 1998

We investigate some numerical methods for computing approximate solutions of a system of second order boundary value problems associated with obstacle unilateral and contact problems. We show that cubic spline method gives approximations which are better than that computed by higer order spline and finite difference techniques.

• 한국정밀공학회지
• /
• 제15권5호
• /
• pp.120-127
• /
• 1998

Differential inequalities occurring in problems of obstacle contact problems are recast into variational inequalities and analyzed by finite element methods. A new a posteriori error estimator, which is essential in adaptive finite element method, is introduced to capture the errors in finite element approximations of these variational inequalities. In order to construct a posteriori error estimates, saddle point problems are introduced using Lagrange parameters and upper bounds are provided. The global upper bound is localized by a special mixed formulation, which leads to upper bounds of the element errors. A numerical experiment is performed on an obstacle contact problem to check the effectivity index both in a local and a global sense.

• 대한수학회지
• /
• 제56권1호
• /
• pp.239-263
• /
• 2019

The $Calder{\acute{o}}n$-Zygmund type estimate is proved for elliptic obstacle problems in bounded non-smooth domains. The problems are related to divergence form nonlinear elliptic equation with measurable nonlinearities. Precisely, nonlinearity $a({\xi},x_1,x^{\prime})$ is assumed to be only measurable in one spatial variable $x_1$ and has locally small BMO semi-norm in the other spatial variables x', uniformly in ${\xi}$ variable. Regarding non-smooth domains, we assume that the boundaries are locally flat in the sense of Reifenberg. We also investigate global regularity in the settings of weighted Orlicz spaces for the weak solutions to the problems considered here.

• Journal of applied mathematics & informatics
• /
• 제7권1호
• /
• pp.175-181
• /
• 2000

The purpose of this to measure, with explicit constants as small as possible, a priori error bounds for approximation by picewise polynomials. These constants play an important role in the numerical verification method of solutions for obstacle problems by using finite element methods .

• 한국지능시스템학회논문지
• /
• 제19권5호
• /
• pp.635-640
• /
• 2009

실제 시스템 적용에 있어서, 수중비행체(Underwater Flight Vehicle : UFV)의 자율제어(autonomous control)를 위한 장애물회피(obstacle avoidance) 시스템은 다음과 같은 문제점들을 가지고 있다. 즉, 소나(sonar)는 지역적 탐색영역 내의 장애물 정보만을 제공할 수 있으므로 지역적 정보를 가지며, 에너지 소비 및 음향학적 소음이 적은 시스템이 필요하므로 연속적인 제어입력을 요구한다. 나아가, 구조와 파라메터의 관점에 있어서 용이한 설계 절차를 요구한다. 이 문제를 해결하기 위해서 진화 전략(Evolution Strategy : ES) 및 퍼지논리 제어기(Fuzzy Logic Controller : FLC)를 이용하는 지능형 장애물회피 알고리즘이 제안되었다. 제안된 알고리즘의 성능을 검증하기 위해 UFV 장애물회피가 수행되었다. 시뮬레이션 결과는 제안된 알고리즘이 실제 시스템에 존재하는 문제점들을 효과적으로 해결하고 있음을 보여준다.

• 센서학회지
• /
• 제13권2호
• /
• pp.133-138
• /
• 2004

Today, the obstacle detection system has massive size and restrictive detection range. To solve these problems, this paper proposes the capacitance variation detector using the variated capacitance value as a result of the obstacle approaching. If obstacle approaches, the capacitance value of capacitance sensor is increased and the operating frequency of oscillator is decreased. Then this changed frequency appears to the output of the mixer that operate down conversion. The capacitance variation detector is produced by Hynix$0.35{\mu}$ CMOS process. In experiment result, the frequency of final output is 6.81 MHz at no obstacle and 31.45 MHz at approaching obstacle. In conclusion, proposed capacitance variation detector has small size, low power consumption and easiness to set up anywhere. So it is expected to substitute the obstacle detector.

• 전자공학회논문지B
• /
• 제33B권7호
• /
• pp.1-10
• /
• 1996

There are many challenging problems in mobile robot navigation. As an example, a mobile robot may wander around in local minimum and may wiggle when it moves through a narrow corridor. In addition, the real time obstacle avoidance and the posture control of mobile robot are also very improtant problems. To address these problems, a navigation algorithm which is composed o freal time obstacle avoidance algorithm and a global path planner (GPP) that genrates the shortest path is presented. In this paper, the global path planner reduce the calculation time by reducing the dta to be handled. Also it can make a real time obstacle avoidance by using the fuzzy logic inference. So the presented algorithm provide a stable navigastion for the mobile robot when it fall into the unstable navigation.