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

도로 교통의 혼잡이 나날이 증가되고 있는 현실 상황에서 이를 해결하기 위한 새로운 도로의 무제한적 건설은 정보의 예산절약, 필요한 도로용지 확보의 어려움, 환경오염 문제 등으로 인해 현실적인 한계에 이르렀다. 따라서, 이러한 도로의 혼잡상황에 효과적으로 대처하기 위해서는 승용차를 이용하고자 하는 수요를 대량수송이 가능한 대중교통 이용수요로 전환시켜야 하며, 이를 위해서는 대중교통의 서비스수준 제고 및 운영 관리 체계 등의 개선이 필요하다. 이를 위한 전략적 및 운영적 측면에서의 대중교통계획은 미래 대중교통수요의 정확한 예측을 전제로 하여 수립되며, 이러한 수요의 예측은 필수적으로 현실을 보다 더 정확하게 묘사해 줄 수 있는 통행배정모형을 필요로 한다. 대중교통 통행배정은 규칙적인 배차시간과 정해진 노선을 운행하는 고정서비스 시스템으로 구성되어 있어서 한 링크 상에서도 여러 개의 운행노선을 고려해야 하기 때문에 승용차 통행배정과는 독립적으로 취급되어 왔으며, 이로 인해 그 동안 많은 연구가 선행되어 있지 않은 실정이다. 본 연구는 교통예측 프로그램 중의 하나인 EMME/2에서 사용하고 있는 대중교통수요 통행배정 모형인 최적전략모형(Optimal Strategy Model)의 단점을 보완하기 위한 것이다. 최적전략모형은 수요 배정시, 최적전략에 속하는 경로들에 대해 단순히 운행횟수에 비례하여 수요를 배정함으로 인해서, 예를 들면 운행횟수는 많지만 환승이 많은 경로에 수요를 많이 배정하는 것과 같은 비현실적인 결과가 발생하기도 한다. 본 연구는 이를 개선하기 위해서, 두 가지 대안을 제시했다. 먼저, 노선배정에 우선되는 최적경로 탐색시 환승노드에서의 환승에 대한 벌점을 그 노선의 운행회수에 줌으로써 환승이 많은 경로에 수요의 배정이 적게 되도록 하는 방법과 두 번째로 수요의 배정시 운행횟수가 아닌 목적지까지의 통행시간과 대시시간에 따른 확률적 배분을 통해 기존 모형의 단점을 보완하고자 했다.

• Journal of Korean Society of Transportation
• /
• v.19 no.5
• /
• pp.85-97
• /
• 2001

In this study, the purpose behind this research is to propose index to be used for classification of functional the urban streets and to select the feasible length of special management link by the index. This special management link help decision makers found a transportation policy. In order to perform functional classification, index such as average traveled distance, link VKT and VKT per length-lane are use at the study. Average traveled distance index is average traveled distance divided by length of Path k and VKT per length-lane is trip volume characteristic considering lanes and length of Path k. Special management links on which major part of the vehicle are selected with using Path-VKT which represents how many long-distance touring vehicles are on the arterial road. The selection of special management links are performed with network composed of 14 paths (arterial roads) in seoul The total distance of special management links resulted from the above analysis is 141km(35.0% of the whole paths length) and total VKT of the special management links is 4,152,475 VKT(45.2% of the whole paths VKT)

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.9
• /
• pp.347-356
• /
• 2015

Due to the rapid development of IoT(Internet of Things) technology, traditional taxis are connected through dispatchers and location systems. Typically, modern taxis have embedded with GPS(Global Positioning System), which aims for obtaining the route information. By analyzing the frequency of taxi trip events, we can find the frequent route for a given query time. However, a scalability problem would occur when we convert the raw location data of taxi trip events into the analyzed frequency information due to the volume of location data. For this problem, we propose a NoSQL based top-K query system for taxi trip events. First, we analyze raw taxi trip events and extract frequencies of all routes. Then, we store the frequency information into hash-based index structure of MongoDB which is a document-oriented NoSQL database. Efficient top-K query processing for frequent route is done with the top of the MongoDB. We validate the efficiency of our algorithms by using real taxi trip events of New York City.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.3
• /
• pp.72-86
• /
• 2018

Schedule-based public transit routing algorithm computes a single route that calculated minimum travel time using the departure and arrival times for each stop according to vehicle operation plan. However, additional factors such as transfer resistance and alternative route choice are not reflected in the path finding process. Therefore, this paper proposes a improved RAPTOR that reflected transfer resistance and multi-path searching. Transfer resistance is applied at the time of transfer and different values can be set according to type of transit mode. In this study, we analyzed the algorithm's before and after results compared with actual route of passengers. It is confirmed that the proposed algorithm reflects the various route selection criteria of passengers.

• The Journal of the Korea Contents Association
• /
• v.6 no.1
• /
• pp.114-125
• /
• 2006

Since wireless Internet services and small mobile communication devices come into wide use as well as the use of GPS is rapidly growing, researches on moving object, whose location information shifts sequently in accordance with time interval, are being carried out actively. Especially, the researches on vehicle moving object are applied to Advanced traveler information system, vehicle tracking system, and distribution transport system. These systems are very useful in searching previous positions, predicted future positions, the optimum course, and the shortest course of a vehicle by managing historical data of the vehicle movement. In addition, vehicle historical data are used for distribution transport plan and vehicle allocation. Vehicle historical data are stored at regular intervals, which can have a pattern. For example, a vehicle going repeatedly around a specific section follows a route very similar to another. If historical data of the vehicle with a repeated route course are stored at regular intervals, many redundant data occur, which result in much waste of storage. Therefore this thesis suggest a vehicle historical data store scheme for vehicles with a repeated route course using similar trajectory which efficiently store vehicle historical data.

• Spatial Information Research
• /
• v.20 no.3
• /
• pp.83-93
• /
• 2012

Recent environmental concerns have made interest in environment-friendly transportation means such as walking, biking, and public transportation. However, since it is difficult to move long distance by walking or biking, their scope of application is rather limited. On the other hand, public transportation can solve traffic congestion, a recent social issue, though its usability may depend on its time schedule. Currently available information services on public transportation in the Web do not reflect well such traits of the public transportation; thus, in some cases, they may provide wrong information to end users. To solve such problems and provide information based on timetable of public transportations, this paper proposes a STP(Space Time Point) data model. Unlike existing space-time data models, this model recognizes the bottommost element of an object as a point and structures these points in hierarchical way to define an object. In particular, It can make it possible to implement a variety of dynamic spatial objects changing object information according to time. An objective of this study is to design a STP model for bus and subway based on timetables of public transportation in Daejeon area and builds a system to provide path navigation. With the designed navigation function, a path from the Daejeon National Cemetery to Hannam University was searched by time slot. The result showed that the system provided different paths by time, as the system guided different paths when bus operation was limited in midnight. As existing data model could not provide such results, it is confirmed that the system can provide path navigation based on real-time traffic information. It is expected that based on such functionality, it is possible to provide additional functionalities by applying diverse data models such as real-time transport information or traffic history information.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.38 no.6
• /
• pp.957-965
• /
• 2018

This study presents a geographic information system based dump truck route exploring system (DRES) which provides construction managers and hauling operators with efficient route information that can improve earthmoving productivity by reducing hauling time. The system is comprised of Network Analyst from Esri as a route exploring engine and a network data model. The network data model includes information on weight limit of bridges, height limit of pedestrian overpasses, and one way that impedes dump trucks' hauling efficiency. A construction manager is expected to input origin and destination point in the user interface, and the system generates an efficient route that avoids bridges with weight limit or pedestrian overpasses with height limit. The system was applied to a real earthmoving project to test its applicability, and it was found that the system functions as intended.

• Electronics and Telecommunications Trends
• /
• v.34 no.3
• /
• pp.43-54
• /
• 2019

Currently, the use of unmanned aerial vehicles (UAVs) is spreading from recreational purposes to the public- and commercial-use product areas. Various efforts are being made worldwide to ensure the safety of UAVs and expand their service applications and convenience, because autonomous flights are becoming increasingly popular. In order for a UAV to perform autonomous flight and mission without operator assistance, environmental perception technology, path planning technology, and flight control technology are needed. In this article, we present recent trends in these technologies.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.1258-1261
• /
• 2017

1급 발암물질인 미세먼지 중 44.3%를 차지하고 있는 도로 비산먼지는 효과적인 미세먼지 농도 저감 대책의 방안 중 하나이다. 도로 비산먼지 제거는 일반적으로 특수 차량을 이용, 정해진 경로와 주기에 따라 운행된다. 이러한 운행방식은 도로의 오염 현황에 따른 효과적 경로 선정 및 운영이 어렵다. 본 논문에서는 도로 비산먼지 제거의 효율적인 경로 제안을 위해 대구지역에 분포된 KISTI 이동형 도시센싱 테스트베드에서 수집되는 고해상도의 실시간 지역별 오염 현황 데이터를 활용하여 실시간 오염도를 분석하고, LSTM(LONG SHORT-TERM MEMORY) 알고리즘을 활용하여 미래의 미세먼지 농도를 예측하였다. 기존 연구와 달리 지역별 상황을 고려한 데이터를 사용하여 선형 회귀 분석을 수행하였다. 실험 결과, 시간 속성을 고려한 LSTM이 MLP 보다 평균 제곱근 오차 값이 경우에 따라 최대 30% 더 작음을 확인했다. 본 연구를 기반으로 고해상도 사물 데이터 기반 예측 연구의 가능성을 보였으며, 미세먼지 예측 결과를 활용 유연하고 효과적인 도로 청소차량의 운행 경로를 설정에 활용될 수 있을 것으로 기대한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.4
• /
• pp.53-62
• /
• 2010

In VANETs (Vehicular Ad hoc NETwork), conditional anonymity must be provided to protect privacy of vehicles while enabling authorities to identify misbehaving vehicles. To this end, previous systems provide a mechanism to revoke the anonymity of individual messages. In VANET, if we can trace the movement path of vehicles, it can be useful in determining the liability of vehicles in car accidents and crime investigations. Although route tracing can be provided using previous message revocation techniques, they violate privacy of other vehicles. In this paper, we provide a route tracing technique that protects privacy of vehicles that are not targeted. The proposed method can be employed independently of the authentication mechanism used and includes a mechanism to prevent authorities from abusing this new function.