• Current Optics and Photonics
• /
• 제5권4호
• /
• pp.362-369
• /
• 2021

Absolute position sensors are widely used in machine tools and precision measuring instruments because measurement errors are not accumulated, and position measurements can be performed without initialization. The laser speckle-based absolute position sensor, in particular, has advantages in terms of simple system configuration and high measurement accuracy. Unlike traditional absolute position sensors, it does not require an expensive physical length scale; instead, it uses a laser speckle image database to measure a moving surface position. However, there is a problem that a huge database is required to store information in all positions on the surface. Conversely, reducing the size of the database also decreases the accuracy of position measurements. Therefore, in this paper, we propose a new method to measure the surface position with high precision while reducing the size of the database. We use image stitching and approximation methods to reduce database size and speed up measurements. The absolute position error of the proposed method was about 0.27 ± 0.18 ㎛, and the average measurement time was 25 ms.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
• /
• pp.400-404
• /
• 1994

In this paper, we will investigate the position estimation problem for autonomous mobile robots. Formulating this as a state estimation problem for nonlinear SISO system, then we will apply several types of nonlinear observers. Simulation results of observer-based navigation control will be also provided.

• 산업경영시스템학회지
• /
• 제38권3호
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

• 한국통신학회논문지
• /
• 제33권12B호
• /
• pp.1075-1082
• /
• 2008

그리디 포워딩(Greedy forwarding) 기법은 주변 노드들의 정보만을 이용해 패킷을 전달하는 기법으로, 전체 라우팅 경로를 유지해야 하는 다른 애드혹 라우팅 프로토콜에 비해 경로 유지가 쉽기 때문에 토폴로지가 자주 변하는 차량간 애드혹 네트워크에 적합한 방식이라고 할 수 있다. 그리디 포워딩 기법에서는 주기적인 비콘 전송을 통해 이웃 노드들의 위치를 획득하고, 패킷을 전달할 때 수신 노드와 가장 가까운 노드를 전달 노드로 선택한다. 이러한 그리디 포워딩의 성능을 떨어뜨리는 주요 원인 중 하나는 이웃 노드가 원래의 위치에서 벗어나면서 발생하는 링크 단절 문제이다. 본 논문에서는 그리디 포워딩 기반의 라우팅 프로토콜인 Greedy Perimeter Stateless Routing (GPSR) 프로토콜을 바탕으로 링크 단절 문제를 해결하기 위한 새로운 알고리즘을 제안한다. 제안하는 알고리즘은 이웃 노드의 위치와 비콘을 수신한 시간 등을 고려해 효율적이면서도 안정적인 라우팅 경로를 찾는 것을 목표로 한다. 다양한 환경에서의 실험 결과를 통해 우리는 제안하는 알고리즘이 GPSR과 기존의 연구 결과들에 비해 더 뛰어난 성능을 보이는 것을 확인하였다.

• 대한안전경영과학회지
• /
• 제23권4호
• /
• pp.55-60
• /
• 2021

This study is to check waterproof by number of twists of fire hose and measure the first waterproof time to analyze the relationship between twists of fire hose and first waterproof time and waterproof by position of twists so as to suggest the efficient plan to prevent twists of fire hose. Ordinary fire hose did not make waterproof in case that position of twists was near the nozzle with twists 5 times or more, while anti-twist fire hose had no problem for waterproof only with delayed time. Like ordinary fire hose, anti-twist fire hose also showed the tendency to increase the waterproof time in proportion to the number of twists. In case that the position of twists was near waterproof port even with 10 times of twists in anti-twist fire hose, the first waterproof time was increase by 0.63 seconds on average without any problem for waterproof, which was somewhat faster than that in ordinary fire hose. With respect to the position of twists, waterproof of anti-twist fire hose was affected more as the number of twists was increased more near the nozzle rather than near the waterproof port, like ordinary fire hose. In summary, anti-twist fire hose equipped with anti-twist tool at the middle connection port and the nozzle showed a good waterproof performance with delayed waterproof time regardless of number of twists, as a solution for the twist problem of ordinary fire hose.

• 대한조선학회논문집
• /
• 제55권4호
• /
• pp.297-305
• /
• 2018

In a shipyard, block lifting is an important process in the production of ships and offshore structures. Block lifting is a sensitive process because lifting blocks have to be erected with exact positions and orientations. If we use a numerical method for the process, it is important to find tensions of wires and positions of equalizers to maintain the initial equilibrium position of the block. At this time, equations of motion of the block should be solved to calculate the initial equilibrium position of the block. Because the solving technique changes according to the number of equalizers, a suitable equation for the corresponding problem is required. In this study, three types of equations are proposed to find the initial equilibrium position of the block according to the number of equalizers. The Newton-Raphson's method is used to solve nonlinear simultaneous equations and the optimization method is used to determine the appropriate solution to the undetermined problem. To evaluate the applicability of the proposed methods, the dynamic simulations are performed using the tensions calculated from the proposed methods, and the results are discussed. The results show that the proposed methods can be effectively used to determine initial equilibrium position of the block for the block lifting.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.583-585
• /
• 2004

In this paper we will deal with a calibration method for low cost motion capture system using psd(position sensitive detection) optical sensor. To measure the incident direction of the light from LED emitted marker, the PSD is used the output current ratio on the electrode of PSD is proportional with the incident position of the light focused by lens. In order to defect the direction of the light, the current output is converted into digital voltage value by opamp circuits peak detector and AD converter with the digital value the incident position is measured. Unfortunately, due to the non-linearly problem of the circuit poor position accuracy is shown. To overcome such problems, we compensated the non-linearly by using least-square fitting method. After compensated the non-linearly in the circuit, the system showed more enhanced position accuracy.

• 한국지능시스템학회논문지
• /
• 제7권5호
• /
• pp.51-59
• /
• 1997

본 논문에서는 퍼지신경망 제어기를 이용하여 직류서보 모터의 위치제어를 실행한다. 위치 제어를 위하여 인공지능 제어기중 설계가 간단한 퍼지제어기를 사용한다.그러나 퍼지 제어기 설계시 문제가 되는 삼각 소속함수의 형태를 신경망의 BP학습법을 이용하여 설정한다. 퍼지신경망 제어기의 위치제어 성능을 펑가하기 위하여 특성이 다른 가상 플랜트를 제어시켜 보았다.그리고 실시간 실험으로 퍼지신경망 제어기에 의한 직류서보 모터 위치제어를 실시하였다.

• 한국CDE학회논문집
• /
• 제6권1호
• /
• pp.31-39
• /
• 2001

Presented in this paper are algorithms to compute the positions of vertices and equations of edges of the Voronoi diagram of a circle set. The circles are located in a Euclidean plane, the radii of the circles are not necessarily equal and the circles are not necessarily disjoint. The algorithms correctly and efficiently work when the correct topology of the Voronoi diagram was given. Given three circle generators, the position of the Voronoi vertex is computed by treating the plane as a complex plane, the Z-plane, and transforming it into another complex plane, the W-plane, via the Mobius transformation. Then, the problem is formulated as a simple point location problem in regions defined by two lines and two circles in the W-plane. And the center of the inverse-transformed circle in Z-plane from the line in the W-plane becomes the position of the Voronoi vertex. After the correct topology is constructed with the geometry of the vertices, the equations of edge are computed in a rational quadratic Bezier curve farm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2042-2047
• /
• 2005

Many service robots which is interacting with human at home and in buildings have been developed. Few of them are shown in of the United States and of Japan. These robots are supposed to have a powerful indoor navigation performance in places where human beings live and work. The overall capability of service robots to move around in this environment is called environment correspondence, in which localization problem to find the accurate position and orientation is the most critical problem. While users set up a proper or a best environment for industrial robots, but for services robots at home and in buildings, it is very difficult to change the environment for robots. The expanded workspace due to mobility is difficult to be covered by means of those used for industrial robots because the cost increases and human beings do not want their environment to be changed for robots. This fact has made many researchers study efficient and effective environment correspondence problems. Among these problems, localization is the most difficult. Goal of localization study includes (1) Accurate detection of position and orientation (2) Minimum cost of the additional devices (3) Minimum change of human environment. In this study, as a solution of the above, we propose "Artificial Stars" which are attached on room ceiling as landmarks. In addition, we solve an adoption problem raised when a robot is delivered to a customer site and before it can perform its full navigation capability. We call this as "Initialization Problem" of service robots. We solve the initialization problem for both cases of environment with the map and without map. The proposed system is experimented and has shown how well it handles the initialization problem.