Intelligent Transportation System

3322 Words14 Pages
Intelligent Transportation System Railway systems DARYN & RYNSORD Table of Contents: 1. Introduction: 2. DARYN (A Distributed Decision-Making Algorithm for Railway Networks) 3. The DARYN approach 4. Example 5. RYNSORD: A Novel, Decentralized Algorithm for Railway with soft reservation: 6. The RYNSORD approach 7. Example 8. Conclusion Introduction Railway networks consist of hundreds of miles of tracks, and locomotives carrying goods and people. The main goal of this railway system will be to allocate tracks to trains at different time interval so that collisions are avoided and resources optimally utilized. In order to achieve the above goals the traditional approach used the principles of centralized scheduling. In centralized scheduling the dispatcher (uniprocessor computer) knows the destination of every train and receives at an interval of time new data including train position, speed, and train status. The dispatcher then analyses these data sequentially and based on a cost function computes the subsequent sub route that every train must take. A permanent communication link is established between the DPU (dispatcher) and the tracks. This communication will allow tracks to send information e.g. status of the track to the DPU which analyses these data and gives new instruction. While moving through tracks toward its destination, a temporary communication link between the train and the DPU is established at a certain interval of time, which is determined thanks to the length of the track, the speed of the train and the communication link delay. . Figure 1: Centralized Scheduling in the traditional approach In Figure 1: * T1, T2, T3 and T4 represent tracks that relate respectively stations A to B, B to C, C to D, and D to A. * R1, R2, and R3 are trains which uses respectively T3, T1, and T2

More about Intelligent Transportation System

Open Document