A Novel Intelligent Traffic Light Control Scheme Cheng Hu, Yun Wang Presented by Yitian Gu.

Slides:



Advertisements
Similar presentations
Travel Time Estimation on Arterial Streets By Heng Wang, Transportation Analyst Houston-Galveston Area Council Dr. Antoine G Hobeika, Professor Virginia.
Advertisements

Artificial Intelligence 13. Multi-Layer ANNs Course V231 Department of Computing Imperial College © Simon Colton.
Driving Assist System for Ecological Driving Using Model Predictive Control Presented by ー M.A.S. Kamal - Fukuoka IST Co-Authors ー Maskazu Mukai - Kyushu.
CSLI 5350G - Pervasive and Mobile Computing Week 3 - Paper Presentation “RPB-MD: Providing robust message dissemination for vehicular ad hoc networks”
Using Dynamic Traffic Assignment Models to Represent Day-to-day Variability Dirck Van Vliet 20 th International EMME Users’ Conference Montreal October.
A. Frank - P. Weisberg Operating Systems Advanced CPU Scheduling.
Introduction to VISSIM
Transportation Engineering
Operating Systems Chapter 6
Operating Systems CPU Scheduling. Agenda for Today What is Scheduler and its types Short-term scheduler Dispatcher Reasons for invoking scheduler Optimization.
Binbin Zhou; Jiannong Cao; Xiaoqin Zeng; Hejun Wu; Dept. of Comput
Analytical derivations of merge capacity: a multilane approach Ludovic Leclercq 1,2, Florian Marczak 1, Victor L. Knoop 2, Serge P. Hoogendoorn 2 1 Université.
CPU Scheduling Algorithms
Chapter 221 Chapter 22: Fundamentals of Signal Timing: Actuated Signals Explain terms related to actuated signals Explain why and where actuated signals.
Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.
02/06/2008CSCI 315 Operating Systems Design1 CPU Scheduling Algorithms Notice: The slides for this lecture have been largely based on those accompanying.
Pricing Granularity for Congestion-Sensitive Pricing Murat Yüksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute, Troy, NY {yuksem, shivkuma}
TRANSPORT MODELLING Lecture 4 TRANSPORT MODELLING Lecture 4 26-Sep-08 Transport Modelling Microsimulation Software.
Chapter 6: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 6: CPU Scheduling Basic.
1 Token Bucket Based CAC and Packet Scheduling for IEEE Broadband Wireless Access Networks Chi-Hung Chiang
Lec 24, Ch.19: Actuated signals and detectors (Objectives) Learn terminology related to actuated signals Understand why and where actuated signals are.
Introduction to Transport
TrafficView: A Scalable Traffic Monitoring System Tamer Nadeem, Sasan Dashtinezhad, Chunyuan Liao, Liviu Iftode* Department of Computer Science University.
Bandwidth Allocation in a Self-Managing Multimedia File Server Vijay Sundaram and Prashant Shenoy Department of Computer Science University of Massachusetts.
Optimal Adaptive Signal Control for Diamond Interchanges Using Dynamic Programming Optimal Adaptive Signal Control for Diamond Interchanges Using Dynamic.
Adaptive Traffic Light Control For Traffic Network.
Applied Transportation Analysis ITS Application SCATS.
CPE 619 2k-p Factorial Design
Transit Priority Strategies for Multiple Routes under Headway-based Operations Shandong University, China & University of Maryland at College Park, USA.
The Science of Prediction Location Intelligence Conference April 4, 2006 How Next Generation Traffic Services Will Impact Business Dr. Oliver Downs, Chief.
GridIS: an Incentive-based Grid Scheduling Lijuan Xiao, Yanmin Zhu, Lionel M. Ni, Zhiwei Xu 19th International Parallel and Distributed Processing Symposium.
Scheduling. Alternating Sequence of CPU And I/O Bursts.
Chapter 20: Actuated Signal Control and Detection
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
1 Evaluation of Adaptive Cruise Control in Mixed Traffic Session
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
Localized Algorithm for Aggregate Fairness in Wireless Sensor Networks Authors : Shigang Chen, Zhan Zhang CISE university of Florida CISE university of.
SYSTEM-OF-SYSTEMS THAT ACT LOCALLY FOR OPTIMIZING GLOBALLY EU FP7 - SMALL/MEDIUM-SCALE FOCUSED RESEARCH PROJECT (STREP) FP7-ICT : ADVANCED COMPUTING,
Chapter 5: Process Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Basic Concepts Maximum CPU utilization can be obtained.
Overload Prediction Based on Delay in Wireless OFDMA Systems E. O. Lucena, F. R. M. Lima, W. C. Freitas Jr and F. R. P. Cavalcanti Federal University of.
1 Real-Time Parking Information on Parking-Related Travel Cost TRIP Internship Presentation 2014 Kory Harb July 24, 2014 Advisor: Dr. Yafeng Yin Coordinator:
June 4, 2003EE384Y1 Demand Based Rate Allocation Arpita Ghosh and James Mammen {arpitag, EE 384Y Project 4 th June, 2003.
Multi-Power-Level Energy Saving Management for Passive Optical Networks Speaker: Chia-Chih Chien Advisor: Dr. Ho-Ting Wu Date: 2015/03/25 1.
A New Traffic Kinetic Model Considering Potential Influence Shoufeng Lu Changsha University of Science and Technology.
1 University of Zagreb, Faculty of EE & C SWAN'06 Department of Control and Computer Engineering Arlington, USA, Decembe 7-9, 2006 Laboratory for Robotics.
Hcm 2010: BASIC CONCEPTS praveen edara, ph.d., p.e., PTOE
6.1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
Bluetooth: Quality of Service Reference: “QoS based scheduling for incorporating variable rate coded voice in Bluetooth”; Chawla, S.; Saran, H.; Singh,
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Congestion.
1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
SCATS Congestion Improvement Program. The Scope of the SCATS Congestion Improvement Program.
TRAFFIC LIGHT CONTROL PROGRESS REPORT YITIAN GU ADITI BHAUMICK VIPUL SINGH LIYAN SUN Professor Nicholas F. Maxemchuk.
Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
Modeling the Optimization of a Toll Booth Plaza By Liam Connell, Erin Hoover and Zach Schutzman Figure 1. Plot of k values and outputs from Erlang’s Formula.
Location Models For Airline Hubs Behaving as M/D/C Queues
A Multi-Airport Dynamic Network Flow Model with Capacity Uncertainty
CPU SCHEDULING.
Non-recurrent Congestion & Potential Solutions
Motion Planning for Multiple Autonomous Vehicles
Harm van Seijen Bram Bakker Leon Kester TNO / UvA UvA
Multi-Hop Broadcast from Theory to Reality:
Operating System Concepts
Miguel Sepulcre, Javier Gozalvez, Onur Altintas, and Haris Kremo
The Tragedy of the Commons in Traffic Routing and Congestion
Outline Scheduling algorithms Multi-processor scheduling
Shortest-Job-First (SJR) Scheduling
A section-based queueing-theoretical traffic model for congestion and travel time analysis in networks Sandro Huber
Presentation transcript:

A Novel Intelligent Traffic Light Control Scheme Cheng Hu, Yun Wang Presented by Yitian Gu

Objective Propose a novel control scheme, in which both the upstream and downstream information are taken into account and traffic light states are dynamically reasoned and adaptively adopt real-time traffic conditions To reduce average waiting time at a road cross

Results Proposed control scheme vs. fixed-time control First scenario: All upstream lanes have the same arrival rate

Results Proposed control scheme vs. fixed-time control Second scenario: arrival rates are all set to 0.35 at first, then increased according to a vector for n times Vector: (0.02, -0.01, -0.01, -0.02, 0.03, -0.01, 0.02, -0.01, -0.01, -0.02, 0.03, -0.01)

Outline III. Intelligent Traffic Light Control Scheme A.The Crossroad Model -Two-way, three lanes each direction, i.e. 12 upstream lanes and 12 downstream lanes -Each upstream L i with corresponding downstream lane L j together forms a serial lane, denoted by L ij -12 predefined states of a traffic light, each state s x allows vehicles in two serial lanes L ij and L mn to go through

Outline III. Intelligent Traffic Light Control Scheme A.The Crossroad Model B.The Control Scheme 1)Weight of a Serial Lane -Defines the weight function of a serial lane using both the upstream and downstream information including arrival rate, departure rate and spaces vacant -Basic idea is to choose the state which contains as many cars as possible in upstream, and as few cars as possible in downstream -Considers the Starvation problem 2)Selection and Duration of Traffic Light States -Selects the state that has the largest sum of weight -Each selected state has minimum green time t 0, if the state remains the same as the previous one, a time slice Δt is added.

Outline IV. Simulation and Analysis A.Effects of Arriving Rate First scenario: -Proposed scheme increases slower as the arrival rate increases -Comparatively, average waiting time of proposed scheme is around 1/3 of that of the fixed scheme Second scenario: -Given a fixed sum of arrival rates, the greater difference of the arrival rates, the more benefits of the intelligent control scheme

Outline IV. Simulation and Analysis B.Effects of Vehicle Speed, Vehicle Length, Vehicle Margin and Lane Length C.Effects of Minimum Green Light Duration -With the increase of minimum green time, the average waiting time increases D.Effects of Beta -When Beta increases, the average waiting time decreases

Outline V. Conclusion and Future Work Work has done: -Describe a road cross model -Propose an intelligent control scheme -Do simulations to explore scheme’s features -In general the average waiting time is significantly less than that of the fixed-time scheme Future work: -Take into account the influence of acceleration, pedestrian and etc. -Extend to control a traffic network

Control Scheme Weight of a Serial Lane n 0 : target vehicle number of lane L j when there is no congestion n(t) : current vehicle number of lane L j fin k : arrival rate of upstream lane L k fout j : departure rate of downstream lane L j P, Q : controllable parameters

Control Scheme Weight of a Serial Lane i.P is inversely proportional to Q ii.If a downstream is congested, the current traffic status has more effects iii.If a downstream is empty, the historical status has more effects P and Q : k : current queue length K : queue capacity

Control Scheme Weight of a Serial Lane Problem: State Starvation If some serial lane’s upstream is always low arrival rate and its downstream is always full, certain traffic light states may not be tuned for a long time Solution: Ageing function t 0 : the minimum green time β : a positive real number Final weight of a serial lane:

Control Scheme Selection and Duration of Traffic Light States Each state s i contains two serial lanes L mn and L pq with their final weights w mn and w pq, thus s i is assigned W i = w mn + w pq When the duration of state s(t) comes to an end, a new state is launched, which holds the largest value among those of all the serial lanes at present. i.e. If s ( t +1) = s ( t ), a time slice Δt is added to the current state’s duration Otherwise, the current state is switched to s(t+1), and its duration is set to t 0

Reference Cheng Hu and Yun Wang, “A Novel Intelligent Traffic Light Control Scheme,” in th International Conference on Grid and Cooperative Computing (GCC), 2010, pp. 372–376.

The End