• 한국항행학회논문지
• /
• 제16권5호
• /
• pp.744-751
• /
• 2012

항공교통관리란 항공교통흐름을 안전하고 신속하며, 질서 있게 소통시키는 것이다. 효율적인 항공교통관리를 위해서는 비행계획 및 비행정보를 이용하여 항공기의 경로 및 거리를 최대한 신속하고 정확하게 탐색하는 능력이 필요하다. 특히 시간에 민감한 항공운송에 있어서 효율적인 항공교통흐름 관리는 필수적이라 할 수 있다. 따라서 본 논문에서는 웨이포인트 및 항로를 네트워크화 하여 최적의 항로를 동적으로 탐색할 수 있는 동적 항로탐색 알고리즘을 제안한다. 기존의 방식은 정적 알고리즘인 다익스트라 알고리즘을 이용하는 방법으로써 일부의 항로가 기상 등의 이유로 폐쇄되었을 때 전체 항로를 다시 계산하는 문제점이 있었다. 동적 항로탐색 알고리즘은 항로의 가중치가 변경되었을 때, 해당 항로와 관련이 있는 부분만 재계산하기 때문에 기존의 방법에 비해 신속하고 정확하게 최적의 항로를 찾을 수 있다. 성능비교 결과, 동적 항로탐색 알고리즘이 기존의 방법에 비해 성능이 우수한 것으로 나타났다.

• 경영과학
• /
• 제23권2호
• /
• pp.161-174
• /
• 2006

In this paper, we consider a network optimization problem arising from the deployment of BcN access network. BcN convergence services requires that access networks satisfy QoS meausres. BcN services have two types of traffics : stream traffic and elastic traffic. Stream traffic uses blocking probability as a QoS measure, while elastic traffic uses delay factor as a QoS measure. Incorporating the QoS requirements, we formulate the problem as a nonlinear mixed-integer Programming model. The Proposed model seeks to find a minimum cost dimensioning solution, while satisfying the QoS requirement. We propose two local search heuristic algorithms for solving the problem, and develop a network design system that implements the developed heuristic algorithms. We demonstrate the computational efficacy of the proposed algorithm by solving a realistic network design problem.

• 제어로봇시스템학회논문지
• /
• 제5권8호
• /
• pp.907-913
• /
• 1999

For an automated transportation system like PRT(Personal Rapid Transit) system or IVHS, an efficient vehicle-merging algorithm is required for smooth operation of the network. For management of merging, collision avoidance between vehicles, ride comfort, and the effect on traffic should be considered. This paper proposes an unmanned vehicle-merging algorithm that consists of two procedures. First, a longitudinal control algorithm is designed to keep a safe headway between vehicles in a single lane. Secondly, 'vacant slot and ghost vehicle' concept is introduced and a decision algorithm is designed to determine the sequence of vehicles entering a converging section considering energy consumption, ride comfort, and total traffic flow. The sequencing algorithm is based on fuzzy rules and the membership functions are determined first by an intuitive method and then trained by a learning method using a neural network. The vehicle-merging algorithm is shown to be effective through simulations based on a PRT model.

• 한국도로학회논문집
• /
• 제15권1호
• /
• pp.155-161
• /
• 2013

PURPOSES: This study is to develop a road traffic sign recognition and automatic positioning for road facility management. METHODS: In this study, we installed the GPS, IMU, DMI, camera, laser sensor on the van and surveyed the car position, fore-sight image, point cloud of traffic signs. To insert automatic position of traffic sign, the automatic traffic sign recognition S/W developed and it can log the traffic sign type and approximate position, this study suggests a methodology to transform the laser point-cloud to the map coordinate system with the 3D axis rotation algorithm. RESULTS: Result show that on a clear day, traffic sign recognition ratio is 92.98%, and on cloudy day recognition ratio is 80.58%. To insert exact traffic sign position. This study examined the point difference with the road surveying results. The result RMSE is 0.227m and average is 1.51m which is the GPS positioning error. Including these error we can insert the traffic sign position within 1.51m CONCLUSIONS: As a result of this study, we can automatically survey the traffic sign type, position data of the traffic sign position error and analysis the road safety, speed limit consistency, which can be used in traffic sign DB.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3551-3567
• /
• 2016

The Low Earth Orbit satellite network has the unique characteristics of the non-uniform and time-variant traffic load distribution, which often causes severe link congestion and thus results in poor performance for delay-sensitive flows, especially when the network is heavily loaded. To solve this problem, a novel adaptive routing algorithm, referred to as the delay-oriented adaptive routing algorithm (DOAR), is proposed. Different from current reactive schemes, DOAR employs Destination-Sequenced Distance-Vector (DSDV) routing algorithm, which is a proactive scheme. DSDV is extended to a multipath QoS version to generate alternative routes in active with real-time delay metric, which leads to two significant advantages. First, the flows can be timely and accurately detected for route adjustment. Second, it enables fast, flexible, and optimized QoS matching between the alternative routes and adjustment requiring flows and meanwhile avoids delay growth caused by increased hop number and diffused congestion range. In addition, a retrospective route adjustment requesting scheme is designed in DOAR to enlarge the alternative routes set in the severe congestion state in a large area. Simulation result suggests that DOAR performs better than typical adaptive routing algorithms in terms of the throughput and the delay in a variety of traffic intensity.

• 대한교통학회지
• /
• 제27권3호
• /
• pp.71-77
• /
• 2009

유비쿼터스 교통환경이 구현되면 기존 ITS 환경에서는 불가능하였던, 개별차량 위치, 속도 등 미세한 데이터 수집이 가능해 지며, V2V(Vehicle-to-Vehicle), V2I(Vehicle-to-Infra) 양방통신이 가능해 짐에 따라 개별차량 혹은 차량군 단위의 미세 제어가 가능해 진다. 이러한 유비쿼터스 교통 환경의 장점에 입각하여 교통류 안정성을 지표로 하는 연속류 정체예방관리 방안이 선행연구에서 제시된 바 있다. 본 연구에서는 유비쿼터스 교통환경에서 정체예방관리를 실현함에 있어 제기된 쟁점사항들에 대하여, VISSIM 시뮬레이션 실험결과에 입각하여 해답을 제시하였다. 교통류 안정성을 명시적으로 교통류 관리에 적용할 수 있도록, 유비쿼터스 교통환경에서 수집 가능한 차량군 길이와 간격으로 도출하였다. 또한 교통상황에 따라 차별화된 운영관리가 필요하다는 타당성을 도출하고, 교통상황 구분 및 상황별 운영관리 방안을 제시하였다. 마지막으로 이러한 관리를 수행하였을 때 어떠한 잠재적 이익이 있는가를 보여주었다. 본 연구 결과는, 제반 제약조건으로 말미암아 제한적인 시뮬레이션 실험을 통해 도출되었다. 그러나 유비쿼터스 교통환경에서 새로운 개념의 교통관리를 시행하는 데 있어 그 타당성은 보여줄 수 있었다고 판단된다. 향후 보다 포괄적인 현장실험을 통해 제반 결과들이 확정되어야 할 것이다.

• 한국자동차공학회논문집
• /
• 제15권1호
• /
• pp.71-77
• /
• 2007

Dangerous driving is a major cause of traffic accidents in Korea. It becomes more serious for commercial vehicles due to higher fatality rates. The Safe Driving Management System (SDMS), developed in this research, is a comprehensive solution that monitors and stores driving conditions of vehicles, detects dangerous driving situations, and analyzes the results in real time. The Safe Driving Management System consists of a vehicle movement information controller, a dangerous driving detection algorithm and a vehicle movement data report and analysis program. The dangerous driving detection algorithm detects and classifies dangerous driving conditions into representative cases such as sudden acceleration, sudden braking, sudden lane change, and sudden turning. Both computer simulation and vehicle test have been conducted to develop and verify the algorithm. The Safe Driving Management System has been implemented on commercial buses to verify its reliability and objectivity. It is expected that the system can contribute to prevention of traffic accidents, systemization of safe driving management and reduction of commercial vehicle operation costs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.2774-2796
• /
• 2015

Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권6호
• /
• pp.575-596
• /
• 2009

Facing limited network resources such as bandwidth and processing capability, the Internet will have congestion from time to time. In this paper, we propose a scheme to maximize the total utility offered by the network to the end user during congested times. We believe the only way to achieve our goal is to make the scheme application-aware, that is, to take advantage of the characteristics of the application. To make our scheme scalable, it is designed to be class-based. Traffic from applications with similar characteristics is classified into the same class. We adopted the RED queue management mechanism to adaptively control the traffic belonging to the same class. To achieve the optimal utility, the traffic belonging to different classes should be controlled differently. By adjusting link bandwidth assignments of different classes, the scheme can achieve the goal and adapt to the changes of dynamical incoming traffic. We use the control theoretical approach to analyze our scheme. In this paper, we focus on optimizing the control on two types of traffic flows: TCP and Simple UDP (SUDP, modeling audio or video applications based on UDP). We derive the differential equations to model the dynamics of SUDP traffic flows and drive stability conditions for the system with both SUDP and TCP traffic flows. In our study, we also find analytical results on the TCP traffic stable point are not accurate, so we derived new formulas on the TCP traffic stable point. We verified the proposed scheme with extensive NS2 simulations.

• 한국ITS학회 논문지
• /
• 제16권2호
• /
• pp.23-35
• /
• 2017

교대통행은 2차로 도로에서 한 차로를 점용한 공사 시, 다른 한 차로를 교대로 사용하여 교통류를 처리하는 공사구간 교통관리기법이다. 신호수를 이용한 교대통행 교통관리 방안은 작업자의 안전문제와 방향별 통과 교통수요에 능동적으로 대처하는데 한계가 있다. 이런 잠재적 문제점을 해결하기 위한 하나의 방안으로 이동식 교대통행 운영시스템을 개발 적용하는 것이다. 본 연구에서는 이 시스템의 교통제어 기법을 개발하였다. 검지기에서 수집되는 방향별 교통량을 이용하여 공사구간 교대통행에 적용 가능한 교통제어 운영변수를 도출하고, 공사구간 내 차량의 존재 유무를 고려한 알고리즘을 설계하였다. 또한 교대통행 제어시스템의 운영효율성 극대화를 위하여 제어변수 최적화를 실시하였다. 최적화방안으로 유전알고리즘 기법을 적용하였으며, 적용 유무에 따른 지체시간을 산출하여 운영효율성을 평가하였다. 그 결과, 최적화를 시행했을 때 총 지체시간과 차량 한 대당 지체시간 모두 감소하는 것으로 나타났다. 본 연구에서 제시한 교대통행 동적제어 알고리즘을 통하여 교대통행 공사구간을 통과하는 차량에게 지체시간 감소효과를 기대할 수 있다.