• Proceedings of the KOR-KST Conference
• /
• 1998.10b
• /
• pp.297-297
• /
• 1998

고속도로의 교통혼잡을 관리하기 위해서는 근본적으로 혼잡지점 상류부의 진입교통량을 제어해야 한다. 이를 위한 효과적인 램프미터링 운영전략이나 고속도로 교통정보제공방안을 수립하기 위해서는 혼잡영향권(대기행렬길이)에 관한 신뢰성 있는 데이터가 반드시 필요하다. 고속도로의 대기행렬길이를 산정하기 위해 일반적으로 충격파이론과 Queueing이론을 제시하고 있다. 그러나, 기존의 충격파 이론을 포물선형의 교통량-밀도관계식을 근거로 하고 있어 충격파간에 발생하는 부수적인 충격파를 해석하는 과정이 수학적으로 불가능하여 실질적인 목적으로 사용할 수 없음은 이미 잘 알고 있는 사실이다. 최근에 이러한 한계를 극복할 수 있는 새로운 방법으로 교통량 밀도간의 관계식을 삼각형으로 가정하고 교통량 대신에 누적교통량을 사용하는 Simplified Theory of Kinematic Waves In Highway Traffic이 개발(Newell, 1993)되었지만, 이 방법을 적용하기 위해서는 기본적으로 대상 고속도로 구간의 교통량-밀도관계식을 규명해야 하는 어려움이 있다.(사실 실시간으로 밀도데이터를 수집하기란 불가능하다.) Queueing이론에서 제시하는 대기행렬은 모두 대기차량이 병목지점에 수직으로 정렬하여 도로를 점유하지 않는 Point Queue(혹은 Vertical stack Queue)로서 실제로 도로상에 정렬된 대기행렬(Real Physical Queue)과는 전혀 다르다. 이미 입증된 바 있어, Queueing이론을 이용함은 타당성이 없다. 이러한 사실에 근거하여 본 연구는 고속도로 대기행렬길이를 산정할 수 있는 모형개발을 위한 기초연구로서 혼잡상태의 연속류 특성을 분석하는데 목적이 있다. 이를 위해, 본 연구에서는 서울시 도시고속도로에서 수집한 실제 데이터를 이용하여 진입램프지점의 혼잡상태에서 대기행렬의 증가 또는 감소하는 과정을 분석하였다. 주요 분석결과는 다음과 같다. 1. 혼잡초기의 대기행렬은 다른 혼잡시기에 비해 상대적으로 급속한 속도로 증가함. 2. 혼잡초기의 대기행렬의 밀도는 다른 혼잡시기에 비해 비교적 낮음. 3. 위의 두 결과는 서로 관계가 있으며, 혼잡시 운전자의 행태(차두간격)과 혼잡기간중에도 변화함을 의미함. 4. 교통변수 중에서 대기행렬길이를 산정하는데 적합한 교통변수를 교통량과 밀도로 판단됨. 5. Queueing이론에서 제시하는 대리행렬길이 산정방법인 대기차량대수$\times$평균차두간격은 대기행렬내 밀도가 일정하지 않아 부적합함을 재확인함. 6. 혼잡초기를 제외한 혼잡기간 중 대기행렬길이는 밀도데이터 없이도 혼잡 상류부의 도착교통량과 병목지점 본선통과교통량만을 이용하여 추정이 가능함. 7. 이상에 연구한 결과를 토대로, 고속도로 대기행렬길이를 산정할 수 있는 기초적인 도형을 제시함.

• Aerospace Engineering and Technology
• /
• v.3 no.1
• /
• pp.170-178
• /
• 2004

This paper deals with six degree-of-freedom HILS(hardware-in-the-loop-simulation) of KSR-III rocket using a TAFMS(three axis flight motion simulator). This TAFMS HILS test is accomplished before main HILS tests in order to verify the control stability in the presence of TAFMS dynamic effects. The TAFMS HILS test includes initial attitude holding tests for INS initial alignment procedures, timer synchronization tests with an auxiliary lift-off signal, real-time calibration tests using an external thermal recorder, open-loop TAFMS operating tests, and final closed-loop TAFMS HILS tests using the TAFMS attitude measurements as inputs to the closed control loop. The HILS tests are accomplished for several flight conditions composed with nominal flight condition, TWD effect added condition, slosh modes and/or bending modes existing condition, and windy condition, etc.

• Korean Journal of Optics and Photonics
• /
• v.34 no.1
• /
• pp.22-30
• /
• 2023

The use of segmented mirrors is one of the ways to make the primary mirror of a spaceborne satellite larger, where several small mirrors are combined into a large monolithic mirror. To align multiple segmented mirrors as one large mirror, there must be no discontinuity in the x, y-axis (tilt) and axial alignment error (piston) between adjacent mirrors. When the tilt and piston are removed, we can collect the light in one direction and get an expected clear image. Therefore, we need a precise wavefront sensor that can measure the alignment error of the segmented mirrors in nm scale. The tilt error can be easily detected by the point spread image of the segmented mirrors, while the piston error is hard to detect because of the absence of apparent features, but makes a downgraded image. In this paper we used an optical testing interferometer such as a Fizeau interferometer, which has various advantages when aligning the segmented mirror on the ground, and focused on measuring the axial displacement error of a segmented mirror as the basic research of measuring the piston errors between adjacent mirrors. First, we calculated the relationship between the axial displacement error of the segmented mirror and the surface defocus error of the interferometer and verified the calculated formula through experiments. Using the experimental results, we analyzed the measurement uncertainty and obtained the limitation of the Fizeau interferometer in detecting axial displacement errors.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.10
• /
• pp.593-602
• /
• 2004

A new surface reconstruction scheme for approximating the surface from a set of unorganized 3D points is proposed. Our method, called shrink-wrapped boundary face (SWBF) algorithm, produces the final surface by iteratively shrinking the initial mesh generated from the definition of the boundary faces. Proposed method surmounts the genus-0 spherical topology restriction of previous shrink-wrapping based mesh generation technique, and can be applicable to any kind of surface topology. Furthermore, SWBF is much faster than the previous one since it requires only local nearest-point-search in the shrinking process. According to experiments, it is proved to be very robust and efficient for mesh generation from unorganized points cloud.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.429-434
• /
• 2017

In a graph G=(V, E) with n vertices, there is an unique box which is finally laid on each vertex. Thus each vertex and box is both numbered from 1 to n and the box i should be laid on the vertex i. But, the box ${\pi}$(i) is initially located on the vertex i according to a permutation ${\pi}$. In each step, the robot can walk along an edge of G and can carry at most one box at a time. Also when arriving at a vertex, the robot can swap the box placed there with the box it is carrying. The problem is to minimize the total step so that every vertex has its own box, that is, the shuffled boxes are sorted. In this paper, we shall find an upper bound of the minimum number of steps and show that the movement of the robot is found in $O(n^2)$ time when G is a cycle.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.9
• /
• pp.9-17
• /
• 2003

In this paper, the weight tare calculation method including translation of initial loads is proposed to remove the internal balance component readings due to model weight. If the balance calibration equations are applied directly to the wind-on data without taking account these initial loads, then incorrect data will be obtained for all wind-on data calculations. The calculated model weights were compared with the actual model weights to verify the reliability of the proposed calculation technique. Also, discussions of the effects of the initial loads are given.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.29-33
• /
• 1993

This paper suggests Kalman filter formulation using by precision GINS output angle for SDINS initial transfer alignment of missile. The Kalman filter model was derived from quaternion parameters and the transfer alignment system by angle matching method satisfies azimuth observability in horizontal angular motion. The estimated error of SDINS attitude settles to less 3mrad(1.sigma.) in 200 seconds at proper sea state.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.136-141
• /
• 1991

An Overlapping Decomposed Filter(ODF) accomplishing an initial alignment of an INS is proposed in this paper. The proposed filter improves the observable condition and reduces the filtering computation time. Its good performance has been verified by simulation. Completely observable and controllable conditions of INS error model derived from psi-angle approach are introduced under varying sensor characteristics vary. The east components of gyro and accelerometer have to be the first order markov process and the rest of them are the characteristics of the random walk or first order markov process.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.98-98
• /
• 2000

In this paper, we present a Multiheading Method for INS initial. The system is not observable for initial alignment however using pseudo tilt angles and pseudo sensor errors become observable. We suggest a new Multiple Method to find the real sensor errors by using the converted system dynamics. The results show that we can find the sensor errors very accurately by the proposed method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.6
• /
• pp.2269-2275
• /
• 2010

The performance of Genetic Algorithms (GA) is affected by various factors such as parameters, genetic operators and strategies. The traditional approach with random initial population is efficient however the whole initial population may contain many infeasible solutions. Thus it would take a long time for GA to produce a good solution. The GA have been modified in various ways to achieve faster convergence and it was particularly recognized by researchers that initial population greatly affects the performance of GA. This study proposes modified GA with sorted initial population and applies it to solving Travelling Salesman Problem (TSP). Normally, the bigger the initial the population is the more computationally expensive the calculation becomes with each generation. New approach allows reducing the size of the initial problem and thus achieve faster convergence. The proposed approach is tested on a simulator built using object-oriented approach and the test results prove the validity of the proposed method.