• 자동차안전학회지
• /
• 제11권3호
• /
• pp.30-36
• /
• 2019

This paper suggests a car-following algorithm for urban environment, with multiple target candidates. Until now, advanced driver assistant systems (ADASs) and self-driving technologies have been researched to cope with diverse possible scenarios. Among them, car-following driving has been formed the groundwork of autonomous vehicle for its integrity and flexibility to other modes such as smart cruise system (SCC) and platooning. Although the field has a rich history, most researches has been focused on the shape of target trajectory, such as the order of interpolated polynomial, in simple single-lane situation. However, to introduce the car-following mode in urban environment, realistic situation should be reflected: multi-lane road, target's unstable driving tendency, obstacles. Therefore, the suggested car-following system includes both in-lane preceding vehicle and other factors such as side-lane targets. The algorithm is comprised of three parts: path candidate generation and optimal trajectory selection. In the first part, initial guesses of desired paths are calculated as polynomial function connecting host vehicle's state and vicinal vehicle's predicted future states. In the second part, final target trajectory is selected using quadratic cost function reflecting safeness, control input efficiency, and initial objective such as velocity. Finally, adjusted path and control input are calculated using model predictive control (MPC). The suggested algorithm's performance is verified using off-line simulation using Matlab; the results shows reasonable car-following motion planning.

• 대한공간정보학회지
• /
• 제5권2호
• /
• pp.131-144
• /
• 1997

날로 심각해져 가는 교통체증은 교통량에 비해 도로용량이 부족하여 나타나는 현상이나, 도로부족만이 교통체증의 주요 원인이라고 단정지을 수는 없다. 왜냐하면, 도시의 중추적 기능이 도심에 집중되어 있고 교통수요가 시간대별로 고르게 분포되어 있지 않기 때문이다. 이 연구는 개개의 운전자가 원하는 속도를 유지할 수 있는 통행의 질을 평가하는 주행계획에 있어서, 출발지로부터 목적지까지의 경로선택 시, 교통지체가 가장 적게 발생하는 선을 선택한다는 사실에 착안하여, 복잡한 가로망에 대하여 GIS기법을 이용한 경로를 교통량과 토로용량분석의 경로에 따라 가로별, 교차로별로 분석하여 기하급수적으로 증가하는 토로교통수요에 따라 시시각각 변모하는 토로, 교통, 운전자특성파악에 접근하고자 하며, 또한 가로별, 교차로별로 인접한 교통유발구역에 대한 분석과 같은 네트웍으로 시간당, 일주일의 하루 및 즉시 분류를 다양한 조건하에서 발생하는 교통지체경향에 대한 실제적 최적경로를 획득하고자 하며, 차후 최적경로 선택에 따른 교통의 원활한 배분을 통해 도로이용의 효율성 증대라는 결과를 기대하고, 따라서 교통량 대 도로용량과의 비에 따른 구간분석을 통하여 도로의 확장 및 확충의 적정시기를 결정하는데 있어서 과학적, 객관적이며 타당한 근거를 마련하고자 한다.

• 한국건설관리학회:학술대회논문집
• /
• 한국건설관리학회 2003년도 학술대회지
• /
• pp.509-512
• /
• 2003

Critical Path Mettled(CPM)은 공정을 계획하고 관리하는데 효과적인 도구이다. CPM의 장점 중 한 가기는 여유시간(Float)을 계산할 수 있다는 것이다. 여유시간은 프로젝트 전체의 공기에 영향을 주기 않고 연장할 수 있지만 공정관리 상의 부산물이기 때문에 소유권에 대한 개념과 범위가 명확하지가 않다. 때문에 사업참여자들이 여유시간을 사용할 때에는 이해관계가 얽혀있어 많은 분쟁을 일으켰다. 이를 해결하기 위해 여유시간 분배와 소유권에 대한 연구가 진행되어 왔으나 여유시간 분배의 기준을 전체 공정에 대한 비율에 두고 있어 합리적인 분배가 이루어지기 못했다. 따라서 본 연구에서는 여유시간 활용목적에 대해 분석한 결과를 기반으로 하여 여유시간 분배 기준을 공기지연 리스크로 제시하였고, 소유권의 개념을 적용시키기 위해 사업참여자 주체별로 공기지연 리스크인자를 구분하였다. 또한 공기지연 리스크인자가 전체 공정에 대해 일률적으로 영향을 끼치는 것이 아니기 때문에 공종에 따라 공기지연 리스크인자들의 영향력을 평가하기 위한 Framework을 구축하였고, 평가를 위한 방법과 기준을 활용할 수 있는 분배방법을 제시하였다.

• 한국통신학회논문지
• /
• 제31권1A호
• /
• pp.23-29
• /
• 2006

무선 센서네트워크(Sensor Network)에서는 많은 수의 센서 노드를 영구적으로 사용하기 보다는 일회성의 목적으로 사용하기 때문에 센서 네트워크를 구성하는 노드들의 수명을 장시간 유지시키는 것이 매우 중요하다. 이를 위해서 본 논문에서는 무선 센서네트워크의 연결 유지 시간(network lifetime)을 연장시키기 위한 EASR(Energy Aware Source Routing) 프로토콜을 제안한다. 제안하는 EASR 기법은 기존의 EAR(Energy Aware Routing)처럼 다중 경로 중에 확률에 의해 결정되는 단일 경로로만 데이터 트래픽을 전송하여 에너지 소비를 분산시키는 방법을 사용한다. 하지만 제안하는 EASR 기법에서는 기존의 SMR(Split Multipath Routing)에서 사용되는 다중 경로 선정 기법을 개선한 방법으로서 센서 노드들의 에너지 소비를 최소화 하기 위하여 다중 경로간의 overhearing 지수를 정의하고 이를 근거로 overhearing 현상에 의한 에너지 소비를 최소로 하는 다중 경로를 설정하는 기법이다. 제안하는 EASR기법이 무선 센서네트워크 환경에서 노드의 수명을 장시간 유지시키고 합리적인 데이터 전송 지연시간을 갖는다는 것을 시뮬레이션 분석을 통해 확인하였다.

• 농촌계획
• /
• 제11권1호
• /
• pp.1-8
• /
• 2005

The purpose of this study is to develop a simulation model of rural road path for infrastructure of green-tourism and public service in rural areas. This study makes an objective function for moving cost minimization considering car travel time according to road characteristics, which can route the optimal shortest road paths between the center places and all rear villages, based on GIS coverages of road-village network for connecting between center places and rural villages as input data of the model. In order to verify the model algorithm, a homogeneous hexagonal network, assuming distribution of villages with same population density and equal distance between neighborhood villages on a level plane area, was tested to simulate the optimal paths between the selected center nodes and the other rear nodes, so that the test showed reasonable shortest paths and road intensity defined in this study. The model was also applied to the actual rural area, Ucheon-myun, which is located on Hoengsung-gun, Kangwon-do, with 72 rural villages, a center village (Uhang, 1st center place) in the area, a county conte. (Hoengsung-eup, 2nd center place), and a city (Wonju, 3rd center place), as upper settlement system. The three kinds of conte. place, Uhang, Hoengsung-eup, and Wonju, were considered as center places of three scenarios to simulate the optimal shortest paths between the centers and rural villages, respectively. The simulation results on the road-village network with road information about pavement and width of road show that several spans having high intensity of road are more important that the others, while some road spans have low intensity of road.

• Nuclear Engineering and Technology
• /
• 제56권1호
• /
• pp.132-140
• /
• 2024

In the event of a severe accident in Sodium Cooled Fast Reactors (SFR), the sodium combustion aerosols along with fission product aerosols would migrate to the environment through leak paths of the Reactor Containment Building (RCB) concrete wall under positive pressure. Understanding the characteristics of sodium aerosol transport through concrete leak paths is important as it governs the environmental source term. In this context, experiments are conducted to study the influence of various parameters like pressure, initial mass concentration, leak path diameter, humidity etc., on the transport and deposition of sodium aerosols in straight leak paths of concrete. The leak paths in concrete specimens are prepared by casting and the diameter of the leak path is measured using thermography technique. Aerosol transport experiments are conducted to measure the transported and plugged aerosol mass in the leak paths and corresponding plugging times. The values of differential pressure, aerosol concentration and relative humidity taken for the study are in the ranges 10-15 kPa, 0.65-3.04 g/m³ and 30-90% respectively. These observations are numerically simulated using 1-Dimensional transport equation. The simulated values are compared with the experimental results and reasonable agreement among them is observed. From the safety assessment view of reactor, the approach presented here is conservative as it is with straight leak paths.

• 한국정밀공학회지
• /
• 제14권4호
• /
• pp.56-63
• /
• 1997

Sealing of lubricant-air mixture in the high performance machining center is one of most the important characteristics to carry out enhanced lubrication. High speed spindle requires non-contact type of sealing mechanism. Evaluating an optimum seal design to minimize leakage is concerned in the aspect of flow control. Effect of geometry and leakage path are evaluated according to variation of sealing geometry. Velocity, pressure, turbulence intensity of profile is calculated to find more efficient geometry and variables. This offers a methodological way of enhancement seal design for high speed spindle. The working fluid is regarded as two phases that are mixed flow of oil phase and air phase. It is more reasonable to simulate an oil jet or oil mist type high speed spindle lubrication. Turbulence and compressible flow model are used to evaluate a flow characteristic. This paper considers a design effect of sealing capability of non- contact type seals for high speed spindle and analyzes leakage characteristics to minimize a leakage 7 on the same sealing area.

• 한국경영과학회지
• /
• 제24권2호
• /
• pp.81-94
• /
• 1999

ATM network design procedure is different from the current circuit or packet networks design procedure because of the variety of the offered services and the variability of requested bandwidth for each connection of ATM network. A number of optimization models for the link dimensioning of ATM network design have been proposed in the literature. However, most of the literature did not consider the modularity of resources allocated to a transmission path and the non-bifurcation of a VP link over the more than one TP, which are standardized in recent ITU-T Recommendations. In thIs paper, we propose a mathematical model for link dimensioning of ATM networks, based on the network synthesis method and a generalized bin-packing problem. The suggested model satisfies the constraints mentioned in the ITU-T Recommendations. We also propose efficient and practical algorithms for the suggested model. Computational experiment shows that the suggested algorithm gives efficient solutions even for moderate and large-sized networks within reasonable time.

• 한국농공학회논문집
• /
• 제47권7호
• /
• pp.13-22
• /
• 2005

Main purpose of this article is to classify reservoirs corresponding to their physical characteristics, for example, dam height, dam width, age, repair-works history. First of all, data set of 13,976 reservoirs was analyzed using k means and self organized maps. As a result of these analysis, lots of reservoirs have been classified into four clusters. Factors and their critical values to classify the reservoirs into four groups have been founded by generating a decision tree. The path rules to each group seem reasonable since their survivor function showed unique pattern.

• 한국경영과학회지
• /
• 제21권1호
• /
• pp.147-161
• /
• 1996

Generally the Multiprocessor Scheduling (MPS) problem is difficult to solve because of the precedence of the tasks, and it takes a lot of time to obtain its optimal solution. Though Genetic Algorithm (GA) does not guarantee the optimal solution, it is practical and effective to solve the MPS problem in a reasonable time. The algorithm developed in this research consists of a improved GA and GP/MISF (Critical Path/Most Immediate Successors First). An efficient genetic operator is derived to make GA more efficient. It runs parallel CP/MISF with GA to complement the faults of GA. The solution by the developed algorithm is compared with that of CP/MISF, and the better is taken as a final solution. As a result of comparative analysis by using numerical examples, although this algorithm does not guarantee the optimal solution, it can obtain an approximate solution that is much closer to the optimal solution than the existing GA's.