• Journal of the Korean Professional Engineers Association
• /
• v.30 no.6
• /
• pp.40-58
• /
• 1997

교통정보의 지능화처리에 따라 교통 체계에서의 변화가 전개되고 있다. 특히 전세계적으로 지능화된 첨단 교통 시스템으로 ITS(Intelligent Transportation System)가 등장하여 표준화된 첨단교통 정보의 체계가 진척되고 있다. 본고에서는 ITS 분야 중에서 첨단 여행자 정보 분야인 ATIS(Advanced Traveller Information Service)에 대하여 주행 및 여행자 정보 서비스의 기능 규격을 정리하고 이의 실현 방안으로 검토되고 있는 다양한 무선 데이터 통신망의 적용을 위한 기술을 검토하고자 한다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.3 no.1 s.4
• /
• pp.97-107
• /
• 2004

As one of the most serious urban problems, routine city traffic congestion causes not only unpleasantness but also damage with increases of road tolls. Recently, many TDM plans are being improved along with plans to more effectively utilize established facilities and maximize the effect. To achieve the purpose of Intelligent Transport Systems(ITS). Recently, the core of ITS is Advanced Traveler information Systems (ATIS.) that are activity researched. A development of various muti-media system is very important of road guideline. First of all a business processing for offering travel information and give a consideration to the United states of various muti-media systems.

• Journal of Korean Society of Transportation
• /
• v.19 no.4
• /
• pp.85-96
• /
• 2001

This paper discusses the problem of finding the Origin-Destination(O-D) shortest path in urban road networks that have variable special qualifies such as time windows for passing as well as geometrical special qualities such as U-turn and left-turn prohibition. The focus of this paper is motivated by the problem of finding minimum travel time paths for an advanced traveler information system (ATIS) in the context of intelligent transportation system(ITS) application. The transportation network with variable and geometrical special qualities is a more realistic representation of the urban road network in the real word. But, the traditional and existing shortest path algorithms can not search practical shortest path that variable special quality is reflected. This paper presents a shortest path algorithm which can search reasonable shortest path information for the urban ATIS application within a real time. The algorithm is based on genetic algorithm(GA). The high performance of the proposed algorithm is demonstrated by computer simulations.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.789-798
• /
• 2001

ITS (Intelligent Transport Systems) is comprised of a number of advanced technologies, including information processing, communications, control, and electronics. Joining these technologies to the transportation system will save lives more safely, save time, and save money more efficiently. The National ITS Architecture provides a common framework for planning, defining, and integrating intelligent transportation systems. Most ITS projects are being designed and implemented in accordance with the National ITS Architecture, a reference framework that spans all of standards activities. Recently, as software technology is rapidly improved and stabilized, there are some needs to reuse pre-developed and powerful ITS technology. ITS standardization based on components and open interfaces becomes a way to solve these reusability of current ITS technology. This paper focuses on how could we design and implement the ITS component based on the National ITS Architecture. Furthermore, design and analysis of UML (Unified Modeling Language) was made through the ATIS (Advanced Traveller Information System) component development task and this UML methodology is expected to provide a standardized model for newly developed ITS components.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.187-189
• /
• 2001

이동 컴퓨팅(Mobile Computing)의 상업적인 응용분야로서, 지능형 교통정보시스템(ITS)에서의 첨단 여행자 정보시스템(ATIS)이 있다. ATIS에서 가장 중요한 이동 컴퓨팅 태스크는 현재 위치에서 목적지까지의 최단 경로를 계산하는 일이다. 본 논문에서는 최단 경로 재 계산 문제에 대해서 연구하였다. 이 문제는 전자 수치 지도(topological digital road map)상의 간선(edge) 비용이 동적인 교통 상태에 따라 빈번하게 갱신되고 있는 ATIS의 동적 경로 안내 시스템(URGS)에서 발생한다. 지금까지 제안된 방법들은 처음부터 최단 경로를 재계산하거나, 또는 단지 비용의 변화가 일어난 간건 상에 있는 양 끝 노드 사이에 대해서 최단 경로를 재계산할 뿐이다. 본 논문에서는 앞서 계산된 최단 경로에 대한 정보를 이용하는 효율적인 적응형 슬라이딩 윈도우 기반의 근접 최단 경로 재 계산 방법을 제안한다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.5D
• /
• pp.597-607
• /
• 2008

ATIS(Advanced Traffic Information System) provide valuable information as the travel time and traffic congestion, detour, traffic accident information to drivers, so it is being in the spotlight. But so far, the study on the consumer satisfaction with providing traffic information is incomplete. So, this study run a Canonical discriminant analysis and a Canonical correlation analysis by a QuantificationIItheory based on a Traffic Information Satisfaction image data through questionnaires, and found out the factors with influence on the consumer satisfaction. And this study definitely found out the correlation between consumer's recognition and traffic information satisfaction through understanding the change on the recognition about traffic information satisfaction by a QuantificationItheory. Finally, this study found out the change on the sensibility recognition of drivers by running the principal component anlysis, developed the traffic information satisfaction evaluation model considering the change on the recognition by using the structural equation model.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.37 no.6
• /
• pp.1033-1041
• /
• 2017

Path travel time based on departure time (PTTDP) is key information in advanced traveler information systems (ATIS). Despite the necessity, forecasting PTTDP is still one of challenges which should be successfully conquered in the forecasting area of intelligent transportation systems (ITS). To address this problem effectively, a methodology to dynamically predict PTTDP between motorway interchanges is proposed in this paper. The method was developed based on the relationships between traffic demands at motorway tollgates and PTTDPs between TGs in the motorway network. Two different data were used as the input of the model: traffic demand data and path travel time data are collected by toll collection system (TCS) and dedicated short range communication (DSRC), respectively. The proposed model was developed based on k-nearest neighbor, one of data mining techniques, in order for the real applications of motorway information systems. In a feasible test with real-world data, the proposed method performed effectively by means of prediction reliability and computational running time to the level of real application of current ATIS.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.2 s.7
• /
• pp.45-52
• /
• 2005

Sketch-Planning based ITS Deployment Analysis System is an analysis tool for determining the impacts, benefits, and costs of various intelligent transportation system (ITS) deployments. This methodology offers one tool that systematically assesses ITS scenarios to facilitate the integration of such scenarios into the ongoing transportation planning process. Sketch-planting based methodology can estimate relative impacts, benefits, and costs for more than 60 types of ITS investments deployed in isolation or in any combination defined by the user.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.296-309
• /
• 2003

One of commercial applications of mobile computing is ATIS(Advanced Traveler Information Systems) in ITS(Intelligent Transport Systems). In ATIS, a primary mobile computing task is to compute the shortest path from the current location to the destination. In this paper, we have studied the shortest path re-computation problem that arises in the DRGS(Dynamic Route Guidance System) in ATIS where the cost of topological digital road map is frequently updated as traffic condition changes dynamically. Previously suggested methods either re-compute the shortest path from scratch or re-compute the shortest path just between the two end nodes of the edge where the cost change occurs. However, these methods we trivial in that they do not intelligently utilize the previously computed shortest path information. In this paper, we propose an efficient approximate shortest path re-computation method based on the dynamic window scheme. The proposed method re-computes an approximate shortest path very quickly by utilizing the previously computed shortest path information. We first show the theoretical analysis of our methods and then present an in-depth experimental performance analysis by implementing it on grid graphs as well as a real digital road map.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.3 no.1 s.4
• /
• pp.31-44
• /
• 2004

The study of Estimation model for the short-term travel time prediction. There is a different solution which has predicted the link travel time to solve this problem. By using this solution, the link travel time is predicted based on link conditions from time to time. The predicated link travel time is used to search the shortest path. Before providing a dynamic shortest path finding, the prediction model should be verified. To verify the prediction model, three models such as Kalman filtering, Stochastic Process, ARIMA. The ARIMA model should adjust optimal parameters according to the traffic conditions. It requires a frequent adjustment process of finding optimal parameters. As a result of these characteristics, It is difficult to use the ARIMA model as a prediction. Kalman Filtering model has a distinguished prediction capability. It is due to the modification of travel time predictive errors in the gaining matrix. As a result of these characteristics, the Kalman Filtering model is likely to have a non-accumulative errors in prediction. Stochastic Process model uses the historical patterns of travel time conditions on links. It if favorably comparable with the other models in the sense of the recurrent travel time condition prediction. As a result, for the travel time estimation, Kalman filtering model is the better estimation model for the short-term estimation, stochastic process is the better for the long-term estimation.