• 한국통신학회논문지
• /
• 제41권11호
• /
• pp.1539-1548
• /
• 2016

무인 항공기와 기지국간 통신시 커버리지 확장과 SNR 이득 확보를 위하여 기지국에서의 빔 형성 기법이 효과적이다. 무인 항공기가 이동하는 상황에서는 빔 이득을 유지하기 위하여 기지국에서 무인 항공기를 향한 주기적인 빔 추적이 필요하다. 또한 다수의 무인 항공기가 이동하는 경우에는 기지국에서 빔 추적을 하기 위하여 무인 항공기에서 서로 다른 프리앰블의 전송이 필요하다. 본 논문에서는 이상적인 상호 상관 특성을 갖고 있는 Hadamard 시퀀스를 기반으로 GMSK 통신시스템에서 다수의 무인 항공기를 향한 빔 추적을 위하여 프리앰블 시퀀스 설계 기법을 제안한다. Hadamard 시퀀스를 입력으로 하는 GMSK 통신시스템에서 수신신호의 특성을 분석한 이후에 다수의 무인 항공기와 통신하는 GMSK 시스템에 적합한 프리앰블 시퀀스를 제안한다.

• 정보처리학회논문지C
• /
• 제9C권2호
• /
• pp.257-266
• /
• 2002

3GPP2 방식의 무선 데이터 통신에서는 Macro Mobility 지원을 위하여 Mobile IP가 이용되며 PDSN은 Foreign Agent의 기능을 수행한다. 이때 하나의 PDSN에서 다른 PDSN으로 Mobile Station이 이동할 경우 지원되는 이동성을 Macro Mobility라 한다. 본 논문은 Macro Mobility에서 발생할 수 있는 패킷의 손실 및 순서변경에 대한 가능성을 살펴보고, 이러한 문제점을 보완하기 위한 방법으로 패킷의 Down Stream과 Up Stream의 각 경우에 대하여 Handoff Sequence Control을 적용한 PDSN간의 seamless 핸드오프 알고리즘을 제시한다.

• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2012년도 제38회 춘계학술대회논문집
• /
• pp.123-128
• /
• 2012

작동 시퀀스에 따른 핀틀 노즐의 성능 특성을 비교하였다. 비정상상태 이동격자 수치해석 기법을 이용하여 시간에 따른 핀틀의 위치 변화를 고려하였으며, 다양한 핀틀 형상과 작동 시퀀스에 따른 성능 응답지연 및 민감도 분석을 수행하였다. 연소실 내부의 압력 상승률과 압력진동이 성능에 미치는 영향을 관찰하기 위하여, 노즐 목에 핀틀이 머무르는 시간이 다른 세 가지의 작동 시퀀스를 고려하였다. 핀틀이 노즐 목에 머무르지 않는 경우(case 1), 0.5초 머무를 경우(case 2) 그리고 노즐 목 위치에 계속 정지해 있을 경우(case 3)에 대해 비교하였고, 이를 통해 작동 시퀀스 및 핀틀 형상에 따른 동특성 연구를 수행하여 추력 특성 변화를 도출하였다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권11호
• /
• pp.626-633
• /
• 2003

Theoretical analysis of the depth measurement system with the use of a single camera and a rotating mirror has been done. A camera in front of a rotating mirror acquires a sequence of reflected images, from which depth information is extracted. For an object point at a longer distance, the corresponding pixel in the sequence of images moves at a higher speed. Depth measurement based on such pixel movement is investigated. Since the mirror rotates along an axis that is in parallel with the vertical axis of the image plane, the image of an object will only move horizontally. This eases the task of finding corresponding image points. In this paper, the principle of the depth measurement-based on the relation of the pixel movement speed and the depth of objects have been investigated. Also, necessary mathematics to implement the technique is derived and presented. The factors affecting the measurement precision have been studied. Analysis shows that the measurement error increases with the increase of depth. The rotational angle of the mirror between two image-takings also affects the measurement precision. Experimental results using the real camera-mirror setup are reported.

• 제어로봇시스템학회논문지
• /
• 제21권8호
• /
• pp.788-793
• /
• 2015

This paper proposes a path planning algorithm to reduce the inspection time of AOI (Automatic Optical Inspection) machines for SMT (Surface Mount Technology) in-line system. Since the field-of-view of the camera attached at the machine is much less than the entire inspection region of board, the inspection region should be clustered to many groups. The image acquisition time depends on the number of groups, and camera moving time depends on the sequence of visiting the groups. The acquired image is processed while the camera moves to the next position, but it may be delayed if the group includes many components to be inspected. The inspection delay has influence on the overall job time of the machine. In this paper, we newly considers the inspection delay time for path planning of the inspection machine. The unified approach using genetic algorithm is applied to generates the groups and visiting sequence simultaneously. The chromosome, crossover operator, and mutation operator is proposed to develop the genetic algorithm. The experimental results are presented to verify the usefulness of the proposed method.

• 대한임베디드공학회논문지
• /
• 제17권4호
• /
• pp.191-197
• /
• 2022

This study proposes an image-based Pose Intention Network (PIN) algorithm for rehabilitation via patients' intentions. The purpose of the PIN algorithm is for enabling an active rehabilitation exercise, which is implemented by estimating the patient's motion and classifying the intention. Existing rehabilitation involves the inconvenience of attaching a sensor directly to the patient's skin. In addition, the rehabilitation device moves the patient, which is a passive rehabilitation method. Our algorithm consists of two steps. First, we estimate the user's joint position through the OpenPose algorithm, which is efficient in estimating 2D human pose in an image. Second, an intention classifier is constructed for classifying the motions into three categories, and a sequence of images including joint information is used as input. The intention network also learns correlations between joints and changes in joints over a short period of time, which can be easily used to determine the intention of the motion. To implement the proposed algorithm and conduct real-world experiments, we collected our own dataset, which is composed of videos of three classes. The network is trained using short segment clips of the video. Experimental results demonstrate that the proposed algorithm is effective for classifying intentions based on a short video clip.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제15권2호
• /
• pp.121-134
• /
• 2008

A pebbling step on a graph consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The covering cover pebbling number of a graph is the smallest number of pebbles, such that, however the pebbles are initially placed on the vertices of the graph, after a sequence of pebbling moves, the set of vertices with pebbles forms a covering of G. In this paper we find the covering cover pebbling number of n-cube and diameter two graphs. Finally we give an upperbound for the covering cover pebbling number of graphs of diameter d.

• 대한산업공학회지
• /
• 제21권3호
• /
• pp.409-428
• /
• 1995

Job shop scheduling with m different machines and n different jobs is a NP-hard problem of combinatorial optimization. The purpose of the paper is to develop the heuristic method using tabu search for job shop scheduling to minimize makespan or mean flowtime. To apply tabu search to job shop scheduling problem, in this paper we propose the several move methods that employ insert moves in order to generate the neighbor solutions, and present the efficient rescheduling procedure that yields active schedule for a changed operation sequence by a move of operations. We also discuss the tabu search techniques of diversifying the search of solution space as well as the simple tabu search. By experiments, we find the appropriate tabu list size and tabu attributes, and analyze the proposed tabu search techniques with respect to the quality of solutions and the efforts of computation. The experimental results show that the proposed tabu search techniques using long-term memory function have the ability to search a good solution, and are more efficient in the mean flowtime minimization problem than in the makespan minimization.

• 산업공학
• /
• 제10권1호
• /
• pp.155-167
• /
• 1997

The purpose of this study is to develop the program for efficient operation of a multi-functional surface mounting device(SMD) which mount various components on a printed circuit board(PCB). These components are provided by diverse types of feeders such as cassette, stick and tray feeders. The SMD has one or two heads. In the SMD, the positions of PCB and feeders and fixed, and the head moves to pick up a component from a feeder and to mount it on the PCB. The number of lanes occupied by each feeder and the nozzle used for each component can be different. We develop an off-line program to minimize the cycle-time of the SMD by studying the optimal assignment of feeders and the optimal mounting sequence of components. Graphical User Interface(GUI) is also developed. Additionally, we consider the line balancing problem which appears when two SMDs are used sequentially.

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

This paper describes the path planning of an autonomous mobile robot using one camera-based sequence image processing. As an assumption, all objects in front of the mobile robot are located on the same plane where robot moves. Using the moving camera grounded on the autonomous mobile robot, the robot extracts the angular points of obstacle objects, calculates the height using the assumption and discrepancy between two consecutive images. In the image processing, angular points of objects must correspond so that they deliver the size of objects. Thus, the robot passes through if the object has not the height, like the paper or the shadow projected. Otherwise, the robot passes aside if ...