• 제어로봇시스템학회논문지
• /
• 제8권11호
• /
• pp.984-990
• /
• 2002

We propose a new type of nonlinear fixed interval smoother to which an existing nonlinear smoother is modified. The nonlinear smoother is derived from two-filter formulas. For the backward filter. the propagation and the update equation of error states are derived. In particular, the modified update equation of the backward filter uses the estimated error terms from the forward filter. Data fusion algorithm, which combines the forward filter result and the backward filter result, is altered into the compatible form with the new type of the backward filter. The proposed algorithm is more efficient than the existing one because propagation in backward filter is very simple from the implementation point of view. We apply the proposed nonlinear smoothing algorithm to off-line navigation system and show the proposed algorithm estimates position, and altitude fairly well through the computer simulation.

• 한국지능시스템학회논문지
• /
• 제14권1호
• /
• pp.118-124
• /
• 2004

In this paper, we present a indirect adaptive control method using a wavelet neural network (WNN) for the control of chaotic nonlinear systems without precise mathematical models. The proposed indirect adaptive control method includes the off-line identification and on-line control procedure for chaotic nonlinear systems. In the off-line identification procedure, the WNN based identification model identifies the chaotic nonlinear system by using the serial-parallel identification structure and is trained by the gradient-descent method. And, in the on-line control procedure, a WNN controller is designed by using the off-line identification model and is trained by the error back-propagation algorithm. Finally, the effectiveness and feasibility of the proposed control method is demonstrated with applications to the chaotic nonlinear systems.

• Journal of Multimedia Information System
• /
• 제4권3호
• /
• pp.145-150
• /
• 2017

Recently, game companies are having difficulties in exactly figuring out the right consumer groups for their games. To solve this problem, a system algorithm which recommends user-customized games based on the user information entered has been proposed in this study. Game developers will be able to clearly determine the consumer group(s) of both on and off-line games through accumulated data while consumers can find the game they desire. It is expected that the gaming culture will advance further with the proposed algorithm.

• 한국정보통신학회논문지
• /
• 제19권12호
• /
• pp.2981-2986
• /
• 2015

본 논문에서는 브로드캐스트를 수행할 수 있는 m개의 서버가 존재하는 경우에 마감시간이 있는 요청들을 만족시키는 스케줄링 문제를 다룰 것이다. 서버가 어떤 페이지를 브로드캐스트하면 이 페이지를 요구한 모든 요청들은 만족된다. 스케줄링 알고리즘은 매 시간에 서버에서 브로드캐스트 할 페이지를 결정한다. 알고리즘의 목표는 마감시간 안에 만족된 요청들의 가중치 합을 최대로 하는 것이다. 온라인 알고리즘의 성능은 입력을 미리 다 알고 결정을 내리는 최적 오프라인 알고리즘의 성능과 비교된다. 일반적으로 최적 오프라인 알고리즘의 성능이 월등히 뛰어 나기 때문에 온라인 알고리즘이 보다 많은 자원을 이용할 수 있는 자원추가 분석 방법을 사용한다. 본 논문에서는 온라인 알고리즘이 보다 많은 서버를 사용하는 경우를 다룰 것이다.

• 전자공학회논문지B
• /
• 제33B권5호
• /
• pp.127-137
• /
• 1996

In this paper, an algorithm for on-line rightward japanese parsing is proposed. The ambiguity in on-line parsing is accumulated until the input is completely finished, since there is not a space between words in the japanese sentence. Thus the algorithm for morphological analysis, based on modified chart, is used in solving it. And the number of searching a word in dirctionary for morphological analysis is also a puzzling problem. The japanese sentence, consist of N characters, has logically its maximum number of N(N+1)/2 searches in the ordinary on-line analysis, which is nearly twice as many as normal off-line. In this paper, the matter is settled through the modification of dictionary format. In experiment, we can accomplish the rate of analysis which is nearly equal to that of off-line parsing. And it becomes clear that the longer a sentence is, the better an analysis efficiency is.

• 한국정보통신학회논문지
• /
• 제18권12호
• /
• pp.2831-2838
• /
• 2014

논문에서는 정규화된 우세한 기울기 벡터들을 기반으로 직선 획들을 추출하고, 직선 획들의 교차영역의 형태와 세기에 의한 변형에 강건한 오프라인 필기 순서도 기호인식 알고리즘을 제안한다. 제안된 알고리즘에서는 먼저 곡선으로만 구성되는 연결기호들을 별도의 특징을 사용하여 인식하고, 직선 획들이 있는 다른 기호들은 정규화된 우세한 기울기 벡터 군집의 최소 외접사각형들을 구하여 직선 획들을 추출하고, 이들 사각형들의 교차영역 형태와 세기를 구하여 순서도 기호를 인식한다. 제안된 알고리즘의 타당성을 확인하기 위하여 컴퓨터 프로그램의 순서도에 주로 사용되는 10종류의 순서도 기호 198개를 취득하여 실험한 결과 99.5%의 인식률을 얻었고, 변형에 강건하게 순서도 기호들이 인식됨을 알 수 있어서 제안된 알고리즘이 오프라인 필기 순서도 기호인식에 매우 효과적임을 확인하였다.

• 한국산학기술학회논문지
• /
• 제7권3호
• /
• pp.385-392
• /
• 2006

본 논문은 오프라인 필기체 한글 인식을 위한 요소 기술의 하나인 자소 분할을 위한 새로운 자획 추출법을 제안한다. 수평 런 길이를 이용하여 자소의 자획을 수직, 경사, 수평으로 구분 분리한다. 수직 자획이나 경사 자획의 수평 런 길이는 자획 두에가 되며, 수평 자획의 수평 런의 개수가 자획 두께가 된다. 수평 자획을 분리 추출한 후, 끊어진 수직, 경사 자획을 자획 두께의 수평 런으로 연결하여 분리한 자획들이 문자의 특징을 나타내게 한다. 추출된 자획들은 온라인 필기체 한글 인식 시스템에서 개발 사용되고 있는 자획 사전 정합을 통해 문자 인식을 할 수 있다.

• 제어로봇시스템학회논문지
• /
• 제20권10호
• /
• pp.1044-1050
• /
• 2014

Robots used for pipe inspection have been studied for a long time and many mobile mechanisms have been proposed to achieve inspection tasks within pipelines. Localization is an important factor for an inpipe robot to perform successful autonomous operation. However, sensors such as GPS and beacons cannot be used because of the unique characteristics of inpipe conditions. In this paper, an inpipe localization algorithm based on elbow detection is presented. By processing the projected marker images of laser pointers and the attitude and heading data from an IMU, the odometer module of the robot determines whether the robot is within a straight pipe or an elbow and minimizes the integration error in the orientation. In addition, an off-line positioning algorithm has been performed with forward and backward estimation and Procrustes analysis. The experimental environment has consisted of several straight pipes and elbows, and a map of the pipeline has been constructed as the result.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.113.2-113
• /
• 2001

In this paper, we present a robot off-Line programming system with collision detection. The collision detection is a very important factor of robot oft-line programming system for collision avoidance, path planning, and so on. The System developed in this paper, basically using an algorithm for the minimum distance calculation between general polyhedra. The proposed system shows an exact and interactive result in static and dynamic environments.

• 전기학회논문지
• /
• 제65권6호
• /
• pp.955-961
• /
• 2016

Fault location estimation is an important element for rapid recovery of power system when fault occur in transmission line. In order to calculate line impedance, most of fault location algorithm uses by measuring relaying waveform using DFT. So if there is a calculation error due to the influence of phasor by DC offset component, due to large vibration by line impedance computation, abnormal and non-operation of fault locator can be issue. It is very important to implement the robust fault location algorithm that is not affected by DC offset component. This paper describes an enhanced fault location algorithm based on the DC offset elimination filter to minimize the effects of DC offset on a long transmission line. The proposed DC offset elimination filter has not need any erstwhile information. The phase angle delay of the proposed DC offset filter did not occurred and the gain error was not found. The enhanced fault location algorithm uses DFT filter as well as the proposed DC offset filter. The behavior of the proposed fault location algorithm using off-line simulation has been verified by data about several fault conditions generated by the ATP simulation program.