Dynamic Mode Decomposition Type Algorithms for Modeling and Predicting Queue Lengths at Signalized Intersections with Short Lookback

Abstract

This Article Explores a Novel Data-Driven Approach based on Recent Developments in Koopman Operator Theory and Dynamic Mode Decomposition (DMD) for Modeling Signalized Intersections. on Signalized Intersections, Vehicular Flow and Queue Formation Have Complex Nonlinear Dynamics, Making System Identification, Modeling, and Controller Design Challenging. We Employ a DMD-Type Approach to Transform the Original Nonlinear Dynamics into Locally Linear Infinite-Dimensional Dynamics. the Data-Driven Approach Relies Entirely on Spatio-Temporal Snapshots of the Traffic Data. We Investigate Several Key Aspects of the Approach and Provide Insights into the Usage of DMD-Type Algorithms for Application in Adaptive Signalized Intersections. to Validate the Obtained Linearized Dynamics, We Perform Prediction of the Queue Lengths at the Intersection and Compare the Results with the Benchmark Methods Such as ARIMA and Long Short Term Memory (LSTM). the Case Study Involves Intersection Pressure and Queue Lengths at Two Orlando Area Signalized Intersections during the Morning and Evening Peaks. It is Observed that DMD-Type Algorithms Are Able to Capture Complex Dynamics with a Linear Approximation to a Reasonable Extent. the Merits Include Faster Computation Times and Significantly Less Requirement for a "Lookback" (Training) Window.

Department(s)

Computer Science

Keywords and Phrases

adaptive signalized intersection; dynamic mode decomposition; Koopman operator theory; queue length prediction; system identification

International Standard Serial Number (ISSN)

1547-2442; 1547-2450

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2023 Taylor and Francis Group; Taylor and Francis, All rights reserved.

Publication Date

01 Jan 2023

Link to Full Text

Share

 
COinS