• 한국ITS학회 논문지
• /
• 제12권6호
• /
• pp.29-36
• /
• 2013

본 연구에서는 구미시 일부지역을 대상으로 소개(疏開, 혹은 대피) 계획(evacuation planning)수립 기초연구를 위해 가능한 한 실제 네트워크 및 교통특성 자료를 기반으로 미시적 교통시뮬레이션을 이용하여 대안별 특성을 분석하였다. 긴급 상황이 발생했을 경우를 가정한 시뮬레이션을 통해 기존 교통신호 체계를 그대로 유지하는 경우에서의 소개시간과 본 연구에서 제안한 차로기반 경로유도(lane-based routing) 방식을 비교한 결과, 긴급 상황이 발생했을 시 기존 신호체계를 그대로 유지하는 경우에 있어 소개명령의 차이는 모든 차량을 소개시키는데 거의 영향을 미치지 않는 것으로 나타났다. 그에 비해 본 연구에서 제시한 차로기반 경로유도 방식의 경우 기존 방식에 비해 소개시간과 총 통행시간에서 각각 28~54%와 82~90%의 단축효과가 있음을 확인하였으며, 특히 소개시간을 짧게 해야 하는 급박한 상황이 발생했을 때 소개를 위한 시간단축을 확인하였다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제5권3호
• /
• pp.193-198
• /
• 2016

Lane change is an important issue in microscopic traffic flow simulations and active safety. Overtaking and changing lanes are dangerous driving maneuvers. This approach presents a lane-changing system based on speed and a minimum gap between vehicles in a vehicular ad hoc network (VANET). This paper proposes a solution to ensure the safety of drivers while changing lanes on highways. Efficient routing protocols could play a crucial role in VANET applications, safeguarding both drivers and passengers, and thus, maintaining a safe on-road environment. This paper focuses on the development of an intelligent transportation system that provides timely, reliable information to drivers and the concerned authorities. A test bed is created for the techniques used in the proposed system, where analysis takes place in an on-board embedded system designed for vehicle navigation. The designed system was tested on a four-lane road in Neemrana, India. Successful simulations were conducted with real-time network parameters to maximize quality of service and performance using Simulation of Urban Mobility and Network Simulator 2 (NS-2). The system implementation, together with the findings, is presented in this paper. Illustrating the approach are results from simulation using NS-2.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.843-845
• /
• 2003

Shortest Path Problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time locationbased service (LBS) environments according to user’s route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. There are major two kinds of cost parameters in route planning. One is static cost parameter which can be pre-computed such as distance and number of traffic-lane. The other is dynamic cost parameter which can be computed in run-time such as number of turns and risk of congestion. In this paper, we propose a new cost modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification. In addition to, describing the details of our shortest path algorithms, we present a location-based service system by using proposed routing algorithms.