• Title/Summary/Keyword: Dynamic Route Guidance System

Search Result 26, Processing Time 0.035 seconds

A Proposal of the Real time Optimal Route Algorithm With Window mechanism (윈도우 매커니즘을 이용한 실시간 최적경로 추출 알고리즘 제안)

  • 이우용;하동문;신준호;김용득
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.737-740
    • /
    • 1999
  • This paper deals with a real time optimization algorithm within real time for DRGS(Dynamic Route Guidance System) and evaluate the algorithm. A pre-developed system offers the optimal route in using only static traffic information. In using real-time traffic information, Dynamic route guidance algorithm is needed. The serious problem in implementing it is processing time increase as nodes increase and then the real time processing is impossible. Thus, in this paper we propose the optimal route algorithm with window mechanism for the real-time processing and then evaluate the algorithms.

  • PDF

A Study on Telecommunication Media and Dynamic Route Guidance Systems for Intelligent Transport System (지능형교통시스템을 위한 정보통신 매체와 동적경로 유도체계 확립에 관한 연구)

  • Kim, Sung-Soo
    • IE interfaces
    • /
    • v.11 no.1
    • /
    • pp.33-40
    • /
    • 1998
  • The objective of this paper is to help organizations select a suitable telecommunications media and dynamic route guidance system (DRGS) for an intelligent transport system (ITS) taking into account both cost and functionality. The media selection criteria and wireless communications for an ITS are discussed along with various DRGS. We describe which kind of telecommunication media and DRGS are suitable. The strategy of an ITS in Korea is described in regards to telecommunication media and DRGS.

  • PDF

Signal Control and Dynamic Route Guidance in ITS (지능형 교통체계에서의 신호제어와 동적 경로안내)

  • 박윤선
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.22 no.50
    • /
    • pp.333-340
    • /
    • 1999
  • An ideal traffic control system should consider simultaneously both route guidance of vehicles and signal policies at intersection of a traffic network. It is known that an iterative procedure gives an optimal route to each vehicle in the network. This paper presents an iterative procedure to find an optimal signal plan for the network. We define the optimal solution as a signal equilibrium. From the definition of signal equilibrium, we prove that the fixed point solution of the iterative procedure is a signal equilibrium, when optimal signal algorithms are implemented at each intersection of the network. A combined model of route guidance and signal planning is also suggested by relating the route guidance procedure and the signal planning procedure into a single loop iterative procedure.

  • PDF

Development of Dynamic Route Guidance System for Multiple Shortest Paths Using Genetic Algorithm (유전자알고리듬을 사용하여 다수최적경로를 제공할 수 있는 동적경로유도시스템의 개발)

  • Kim, Sung-Soo;Jeong, Jong-Du;Lee, Jong-Hyun
    • IE interfaces
    • /
    • v.14 no.4
    • /
    • pp.374-384
    • /
    • 2001
  • The objective of this paper is to design the dynamic route guidance system(DRGS) and develop a genetic algorithm(GA) for finding the multiple shortest paths in real traffic network. The proposed GA finds a collection of paths between source and destination considering turn-restrictions, U-turn, and P-turn that are genetically evolved until an acceptable solution is reached. This paper also shows the procedure to find the multiple shortest paths in traffic network of Seoul.

  • PDF

Ant Algorithm for Dynamic Route Guidance in Traffic Networks with Traffic Constraints (회전 제약을 포함하고 있는 교통 네트워크의 경로 유도를 위한 개미 알고리즘)

  • Kim, Sung-Soo;Ahn, Seung-Bum;Hong, Jung-Ki;Moon, Jae-Ki
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.5
    • /
    • pp.185-194
    • /
    • 2008
  • The objective of this paper is to design the dynamic route guidance system(DRGS) and develop an ant algorithm based on routing mechanism for finding the multiple shortest paths within limited time in real traffic network. The proposed ant algorithm finds a collection of paths between source and destination considering turn-restrictions, U-turn, and P-turn until an acceptable solution is reached. This method can consider traffic constraints easily comparing to the conventional shortest paths algorithms.

Dynamic Charncteristics for Laternl Strong Wind on Bimodal Tram (바이모달 트램의 횡풍에 대한 동적특성 해석)

  • Kim, Yeon-Su;Lim, Song-Gyu;Mok, Jai-Kyun;Kim, Myoung-Gyu
    • Proceedings of the KSME Conference
    • /
    • 2008.11a
    • /
    • pp.979-983
    • /
    • 2008
  • A bi-modal tram can travel in not only dedicated way but also road so as to reduce construction costs and increase vehicle operation efficiency, whose passenger capacity is 2,500 to 7,000 persons/direction/hour. A bi-modal has an electronic guidance system that knows the location and route of the vehicle, and uses magnetic markers in the road surface for reference. Since a bi-modal tram will be operated in the downtown area, there is some possibility that strong wind occurred between high-rise buildings can produce sudden lateral movement (displacement) of the vehicle to influence its automatic operation controlled by electronic guidance system. For bi-modal tram in the automatic operation mode, lateral movements occurred by strong wind were calculated and analyzed in the dynamic model developed by using the ADAMS. Some useful relations among vehicle speeds, wind speeds, and lateral behaviors were discussed in this paper.

  • PDF

A Multi-Resolution Database Model for Management of Vector Geodata in Vehicle Dynamic Route Guidance System (동적 경로안내시스템에서 벡터 지오데이터의 관리를 위한 다중 해상도 모델)

  • Joo, Yong-Jin;Park, Soo-Hong
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.18 no.4
    • /
    • pp.101-107
    • /
    • 2010
  • The aim of this paper is to come up with a methodology of constructing an efficient model for multiple representations which can manage and reconcile real-time data about large-scale roads in Vector Domain. In other words, we suggested framework based on a bottom-up approach, which is allowed to integrate data from the network of the lowest level sequentially and perform automated matching in order to produce variable-scale map. Finally, we applied designed multi-LoD model to in-vehicle application.

Development of Optimal Path Algorithm for Advanced Traveler Information System (첨단교통정보시스템의 최적경로 알고리즘 개발)

  • Kim, Sung-Soo;Cha, Young-Min
    • Journal of Industrial Technology
    • /
    • v.21 no.A
    • /
    • pp.241-249
    • /
    • 2001
  • The objective of this paper is to develop the optimal path algorithm for dynamic route guidance system in advanced traveler information system (ATIS). The travel time is forecasted in each path between network nodes. Floyd-Warshall algorithm is used to find the optimal route based on this forecasted travel time in dynamic traffic network. This algorithm is modified to apply the real traffic network that has left-turn restriction, U-turn, and P-turn. A big value is assigned to one of arcs in turn restriction and a virtual node is used to consider U-turn and P-turn for Floyd-Warshall algorithm.

  • PDF

Effective Real-Time Information Control Algorithm Using Ad Hoc Relaying System for Car Navigation Systems (차량 항법 시스템 환경에서 Ad Hoc Relaying System을 이용한 효과적인 실시간 정보 제어 기법)

  • 변계섭;임성화;김재훈
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.346-348
    • /
    • 2002
  • 차량 항법 시스템(Car Navigation System)은 요즘 많은 발전을 거듭하여 차량 이용시 사용자가 가고자하는 목적지까지의 길을 쉽게 안내하고 있다. 이런 기술의 발전은 단순한 정적인 길 안내(Static Route Guidance) 뿐만 아니라. 동적인 길 안내(Dynamic Route Guidance)를 함으로써 자동차 운전자가 쉽고 빠른 길을 안내 받을 수 있게 되었다. 그러나 이러한 교통정보는 매우 변화가 심하므로 최초로 경로를 전송 받은 후 그 경로상에 교통정보가 변화하였다면, 이미 전송 받은 경로는 실시간으로 적극적으로 대응할 수 없고 실제 막히는 길로 안내할 수 있다. 목적지까지의 거리가 먼 경우 이런 현상이 더욱 심하게 나타날 수 있다. 이런 경우 운전자는 실제로는 막히는 길로 안내 받을 수 밖에 없다. 이런 문제점을 해결하기 위해 교통정보를 수집하는 기존의 시스템에 Ad Hoc 네트워킹이 가능한 시스템을 탑재한 교통정보 수집 차량(Probe Car)을 이용한다. 정보 수집 차량이 극심한 정체를 발견하면 근처를 지나는 경로를 가진 차량에게 이를 전달하여 새로운 경로를 다운받을 수 있도록 한다. 이런 방법은 Ad Hoc Relaying System〔l〕을 이용하여 가능하며, 센터에 수집되고 가공되는 시간을 최대한 줄일 수 있으며, 센터의 통신 오버헤드를 최소화할 수 있다. 또한 기지국에 호가 집중되어 call blocking이 발생함 경우에 이를 해결할 수 있다.

  • PDF