Adaptive Traffic Control

Slides:



Advertisements
Similar presentations
ACS-Lite Offset Tuning Algorithm. Collect data from advance detectors on coordinated approaches Develop a Statistical Flow Profile correlated to the phase.
Advertisements

Binbin Zhou; Jiannong Cao; Xiaoqin Zeng; Hejun Wu; Dept. of Comput
Progressive Signal Systems. Coordinated Systems Two or more intersections Signals have a fixed time relationship to one another Progression can be achieved.
CTC-340 Signals - Basics. Terms & Definitions (review) Cycle - Cycle Length - Interval -. change interval - clearance interval- change + clearance = Yi.
Computational Modelling of Road Traffic SS Computational Project by David Clarke Supervisor Mauro Ferreira - Merging Two Roads into One As economies grow.
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
Chapter 17: Basic principles of intersection signalization (objectives) Chapter objectives: By the end of this chapter the student will be able to: Explain.
Adaptive Traffic Light Control with Wireless Sensor Networks Presented by Khaled Mohammed Ali Hassan.
Adaptive Traffic Light Control For Traffic Network.
Transportation Engineering
Applied Transportation Analysis ITS Application SCATS.
Unit 1 Understanding Numeric Values, Variability, and Change 1.
Chapter 20: Actuated Signal Control and Detection
+ Simulation Design. + Types event-advance and unit-time advance. Both these designs are event-based but utilize different ways of advancing the time.
Transit Signal Priority (TSP). Problem: Transit vehicles are slow Problem: Transit vehicles are effected even more than cars by traffic lights –The number.
Uniform Distributions and Random Variables Lecture 23 Sections 6.3.2, Mon, Oct 25, 2004.
Traffic Light Simulation Lynn Jepsen. Introduction and Background Try and find the most efficient way to move cars through an intersection at different.
TRAFFIC LIGHT CONTROL PROGRESS REPORT YITIAN GU ADITI BHAUMICK VIPUL SINGH LIYAN SUN Professor Nicholas F. Maxemchuk.
1/31 July 8, 2016 Designing Control Programs Chapter 6 Control programs for vehicle actuated control of complex intersections.
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.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 3 Polynomial and Rational Functions Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Introduction to Machine Learning, its potential usage in network area,
Thinking Inside the Box
Outline Sensys SensMetrics Solution SensMetrics Performance Measures
Lecture Slides Elementary Statistics Twelfth Edition
Red Line Customer Capacity Update
Dan C. Marinescu Office: HEC 439 B. Office hours: M, Wd 3 – 4:30 PM.
MOVA Traffic Signal Control Trial
Topics discussed in this section:
Edward Andert, Mohammad Khayatian, Aviral Shrivastava
Uniform Distributions and Random Variables
Chapter 5a: CPU Scheduling
POAD Book: Chapter 8 POAD: Analysis Phase
Agent Based Traffic Simulator for Autonomous Vehicle
Towards Traffic Light Control through a Multiagent Cooperative System:
2.7: Simulation.
Green Software Engineering Prof
Applied Technology and Traffic Analysis Program(ATTAP) MIDCAP & MUID
* Topic 7 Field Operations
Chapter 6: CPU Scheduling
Chapter 6: CPU Scheduling
Multi-Agent Exploration
Signalized Intersections
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Transportation Engineering Basic Queuing Theory February 18, 2011
Aggressiveness Protective Fair Queuing for Bursty Applications
COMP60611 Fundamentals of Parallel and Distributed Systems
Chapter 6: CPU Scheduling
CPU SCHEDULING.
Chapter 5: CPU Scheduling
Calibration and Validation
COMP60621 Fundamentals of Parallel and Distributed Systems
Transportation Engineering Fancy intersections March 7, 2011
○ Hisashi Shimosaka (Doshisha University)
Traffic Light Simulation
COMP60621 Designing for Parallelism
School of Civil Engineering
Operating System , Fall 2000 EA101 W 9:00-10:00 F 9:00-11:00
SKTN 2393 Numerical Methods for Nuclear Engineers
Traffic Light Simulation
Chapter 6: CPU Scheduling
Chapter 4: Simulation Designs
Chapter 5: CPU Scheduling
Module 5: CPU Scheduling
COMP60611 Fundamentals of Parallel and Distributed Systems
The number in each lane indicates
Module 5: CPU Scheduling
Definition: Characteristics Examples Additional Notes: Draw Examples:
Presentation transcript:

Adaptive Traffic Control Brian Dong & Graham Roff

Motivation Traffic Jams: gridlock at rush hour, urban sprawl Current implementation: Fixed-cycle or even fixed-interval, environment insensitive design Optimizing every intersection is not practical: requires collection of data at each intersection in the city to analyze traffic patterns at all hours of day Would be nice if a traffic light controller could figure this out all on its own…

Design Challenges Goal: Develop an adaptive algorithm and embedded traffic controller that can optimize traffic flow without any a priori information other than which lanes can be green simultaneously. Algorithm complexity: how to weigh the various factors/parameters affecting the intersection lanes (previous wait times, traffic volume, current cars waiting) Simulation: how to create a reasonably accurate representation of cars arriving at an intersection

System Design Modular design: intersection module contains lane modules, each containing a hardware interface Simulator communicates by triggering the hardware (car sensor) and responding to hardware state changes (light changed) Intersection module controls changing state (lights) of intersection Decisions based on state “metric delta”

System Diagram

Algorithm Design Decisions based on state “metric” for each lane A given state causes a change of metric over time: The metric delta is evaluated over every possible next state State with best reduction in metric is chosen

Algorithm Challenges Time: how to determine t in the above equations Lanes go green until idle or max timeout expires Red light time for other lanes is minimum time light will be red for based on light concurrency Simultaneous lanes: multiple lanes may be green at the same time, and light changes are asynchronous Algorithm must handle switching the first idle lane vs. waiting for all green lanes to go idle before switching to new state

Simulator Design Needs to represent the bursty nature of traffic: groups of cars arrive sequentially at an intersection, there are time delays between these groups/bursts. Solution: Use two Gaussian random variables of different means and variances. First variable determines the time delta between cars during a burst Second variable determines the time delta between the bursts Use a uniformly distributed random variable to determine when the burst occurs Interface with TLC controller: Generate test vectors using Matlab and compile into SystemC. Simulator module actuates the TLC hardware sensors based on the delta-queue created in Matlab

Example and Demonstration

Results Three different control algorithms were implemented for comparison Fixed time Fixed cycle “Optimum” Measured the mean and variance of the waiting time, and the percentage of stopped cars A basic four-way intersection with eight lanes (four straight and four left) was used for analysis Number of traffic scenarios examined, including: All lanes equally busy All straight lanes busy North/south straight lanes busy

Results - 2 The results for the equally busy intersection are shown below:   Fixed Interval Fixed Cycle Optimum Wait time mean 67.0 52.2 42.1 Wait time variance 42.7 36.2 35.2 Stopped cars 94% 92% Fixed interval is worst performer, followed by fixed cycle Optimum intersection performs the best Relatively small difference between fixed cycle and optimum – however optimum requires no additional state change configuration Plot of lane queue length versus time is also generated to examine algorithm behavior

Results - 3

Future Directions Basic principle is proven, further testing remains Support for pedestrians, emergency vehicles, etc…is not included as these are not relevant to algorithm efficiency Further improvement could be obtained by allowing intersection communication – beyond the scope of this project

Conclusions Complex problem: Traffic light control is more complicated than one might expect Many possible algorithms: Impossible to declare one algorithm “optimal” as there is no real definition of optimum Our general “metric” based approach allows easy tweaking of details to optimize the system for a given algorithm For a simple waiting time evaluation this algorithm performs the best of the three tested and is simplest to configure Testing: Biggest concern in a production environment is testing – any solution needs to be tested across every possible scenario

Questions?