Search NASA⌕ Search

SEARCH · Search NASA

Results for “traffic queue model”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Control of Networked Traffic Flow Distribution - A Stochastic Distribution System Perspective

Networked traffic flow is a common scenario for urban transportation, where the distribution of vehicle queues either at controlled intersections or highway segments reflect the smoothness of the traffic flow in the network. At signalized intersections, the traffic queues are controlled by traffic signal control settings and effective traffic lights control would realize both smooth traffic flow and minimize fuel consumption. Funded by the Energy Efficient Mobility Systems (EEMS) program of the Vehicle Technologies Office of the US Department of Energy, we performed a preliminary investigation on the modelling and control framework in context of urban network of signalized intersections. In specific, we developed a recursive input-output traffic queueing models. The queue formation can be modeled as a stochastic process where the number of vehicles entering each intersection is a random number. Further, we proposed a preliminary B-Spline stochastic model for a one-way single-lane corridor traffic system based on theory of stochastic distribution control.. It has been shown that the developed stochastic model would provide the optimal probability density function (PDF) of the traffic queueing length as a dynamic function of the traffic signal setting parameters. Based upon such a stochastic distribution model, we have proposed a preliminary closed loop framework on stochastic distribution control for the traffic queueing system to make the traffic queueing length PDF follow a target PDF that potentially realizes the smooth traffic flow distribution in a concerned corridor.

Wang, Hong↗

Control of Networked Traffic Flow Distribution: A Stochastic Distribution System Perspective

At signalized intersections, the traffic queues are controlled by traffic signal control settings and effective traffic lights control would realize both smooth traffic flow and minimize fuel consumption. Funded by the Energy Efficient Mobility Systems (EEMS) program of the Vehicle Technologies Office of the US Department of Energy, we performed a preliminary investigation on the modelling and control framework in context of urban network of signalized intersections. In specific, we developed a recursive input-output traffic queueing models. The queue formation can be modeled as a stochastic process where the number of vehicles entering each intersection is a random number. Further, we proposed a preliminary B-Spline stochastic modelling and control for a one-way single-lane corridor traffic system based on theory of stochastic distribution control that shapes the PDF of the queue length.

33 ADVANCED PROPULSION SYSTEMS↗

Modeling and Control Using Stochastic Distribution Control Theory for Intersection Traffic Flow

In this work, we investigated stochastic distribution control theory-based traffic signal optimization to achieve a smooth and uniform flow of vehicles through signalized intersections. In this context, the static and linear dynamic stochastic distribution models were developed to express the relationship between the signal timing and the traffic queue length together with its probability density function. Two stochastic distribution control algorithms were designed to control the signal timing at intersections such that the probability density function of the traffic queue of each intersection road segment is made as narrow and as small as possible. Also, a recursive input-output traffic queue estimation model was proposed, which is data-driven and dynamic in nature, to calculate real-time traffic queue length using traffic signal timings and loop-detector data. The control algorithms were evaluated for a one-signal corridor, two-signal corridor, and 2 x 2 network of signalized intersections. MATLAB simulation examples are provided to demonstrate the use of the proposed algorithms and comparison to the existing widely-used semi-actuated control has been made. Desired results were obtained.

97 MATHEMATICS AND COMPUTING↗

Deep Learning-Based Queue-Aware Eco-Approach and Departure System for Plug-In Hybrid Electric Buses at Signalized Intersections: A Simulation Study

Eco-Approach and Departure (EAD) has been considered as a promising eco-driving strategy for vehicles traveling in an urban environment, where information such as signal phase and timing (SPaT) and geometric intersection description is well utilized to guide vehicles passing through intersections in the most energy-efficient manner. Previous studies formulated the optimal trajectory planning problem as finding the shortest path on a graphical model. While this method is effective in terms of energy saving, its computation efficiency can be further enhanced by adopting machine learning techniques. In this paper, we propose an innovative deep learning-based queue-aware eco-approach and departure (DLQ-EAD) system for a plug-in hybrid electric bus (PHEB), which is able to provide an online optimal trajectory for the vehicle considering both the downstream traffic condition (i.e. traffic lights, queues) and the vehicle powertrain efficiency. Based on optimal solutions obtained from the graph-based trajectory planning algorithm (GTPA), a deep neural network (DNN) is developed to learn the optimal vehicle speed for the next time step given its current state. It is demonstrated that the trained DNN can provide energy-efficient trajectories with high computational efficiency and high flexibility adopting to dynamic changes in the surrounding environment. To address the impact of downstream traffic, a queue prediction model is further developed using data from radars and connected vehicles (CVs), as well as signal timing data from SPaT messages. A comprehensive simulation study in the microscopic traffic modeling software PTV VISSIM shows that the proposed DLQ-EAD can achieve 18.7%-24.0% energy efficiency improvements for a single PHEB on various traffic congestion levels. The proposed queue prediction model can be of practical significance even at low penetration rates of CVs. Specifically, additional energy savings of 2.0%-8.2% can be further achieved with 20% vehicles in the network.

Ye, Fei↗

Traffic Flow Analysis for Package Delivery Drones using a Queueing Model

A key component of the small unmanned aircraft systems traffic management ecosystem is the design of scalable algorithms for strategic deconfliction of drones prior to takeoff. In this work, we focus on efficient flow management of drones on a network of intersecting edges subject to two kinds of spacing constraints: 1) between any two adjacent vehicles on an edge and 2) between any two vehicles on two different edges arriving one after the other at an intersection. The spacing is designed to enable non-intersection of operational volumes corresponding to two different vehicles thereby properly separating the vehicles inside each volume. For simplicity, we assume a constant ground speed for the drones and fixed dimensions for the operational volume blocks. The deconfliction is managed by adjusting the takeoff time of the drones, thereby regulating their arrival time at various crossing waypoints in the network. This framework allows us to study the maximum flow (throughput) of vehicles on a network of edges connecting depots to drop off sites subject to the temporal spacing constraints. The departure scheduling of individual drones results in a combinatorial optimization problem. To alleviate this, we solve a max-flow formulation and use queueing theory to simplify the analysis and provide upper bounds to the underlying optimization problem for individual drone departure scheduling. Our results indicate that throughput drops rapidly after the density of drones in the network passes the max-flow limits.

Alexey A Munishkin↗

Modeling and Control of Airport Queueing Dynamics under Severe Flow Restrictions

Based on field observations and interviews with controllers at BOS and EWR, we identify the closure of local departure fixes as the most severe class of airport departure restrictions. A set of simple queueing dynamics and traffic rules are developed to model departure traffic under such restrictions. The validity of the proposed model is tested via Monte Carlo simulation against 10 hours of actual operations data collected during a case-study at EWR on June 29,2000. In general, the model successfully reproduces the aggregate departure congestion. An analysis of the average error over 40 simulation runs indicates that flow-rate restrictions also significantly impact departure traffic; work is underway to capture these effects. Several applications and what-if scenarios are discussed for future evaluation using the calibrated model.

Carr, Francis↗

A new traffic control design method for large networks with signalized intersections

The paper presents a traffic control design technique for application to large traffic networks with signalized intersections. It is shown that the design method adopts a macroscopic viewpoint to establish a new traffic modelling procedure in which vehicle platoons are subdivided into main stream queues and turning queues. Optimization of the signal splits minimizes queue lengths in the steady state condition and improves traffic flow conditions, from the viewpoint of the traveling public. Finally, an application of the design method to a traffic network with thirty-three signalized intersections is used to demonstrate the effectiveness of the proposed technique.

Leininger, G. G.↗

NCC Simulation Model: Simulating the operations of the network control center, phase 2

The simulation of the network control center (NCC) is in the second phase of development. This phase seeks to further develop the work performed in phase one. Phase one concentrated on the computer systems and interconnecting network. The focus of phase two will be the implementation of the network message dialogues and the resources controlled by the NCC. These resources are requested, initiated, monitored and analyzed via network messages. In the NCC network messages are presented in the form of packets that are routed across the network. These packets are generated, encoded, decoded and processed by the network host processors that generate and service the message traffic on the network that connects these hosts. As a result, the message traffic is used to characterize the work done by the NCC and the connected network. Phase one of the model development represented the NCC as a network of bi-directional single server queues and message generating sources. The generators represented the external segment processors. The served based queues represented the host processors. The NCC model consists of the internal and external processors which generate message traffic on the network that links these hosts. To fully realize the objective of phase two it is necessary to identify and model the processes in each internal processor. These processes live in the operating system of the internal host computers and handle tasks such as high speed message exchanging, ISN and NFE interface, event monitoring, network monitoring, and message logging. Inter process communication is achieved through the operating system facilities. The overall performance of the host is determined by its ability to service messages generated by both internal and external processors.

Benjamin, Norman M.↗

A Queuing Theory Approach to Pilot-Controller Coordination for m:N Operations

In recent years, attention and interest by industry and researchers has grown in a control paradigm for remotely piloted aircraft termed “m:N operations.” In an m:N operation, a team of m remote pilots in command (RIPCs) collaboratively manage the flights of N aircraft. A consequence of an m:N concept of operations is that the RPICs will have to switch attention from one aircraft to another and from one task to another. Previous research in m:N operations has focused on the workload experienced by an RPIC and their level of situation awareness on their flights. Researchers have found that RPIC workload and situation awareness are generally sensitive to increasing N, although NASA’s Multi-Vehicle (m:N) Working Group has suggested that the driver of workload/situation awareness is the number of exceptions requiring human intervention as opposed to the value of N itself. In any case, a natural antecedent of workload is task load. In this paper, queueing theory is applied to a 1:N Urban Air Mobility (UAM) air taxi operation in order to estimate pilot task load for managing radio communications with air traffic controllers (ATCs) under increasing N. An M/M/1 queueing system is used to model the RIPC’s servicing of calls and clearance requests (e.g., departure, arrival, or airspace transition) to ATC for the N aircraft. Important parameters for the queueing model are the task arrival rate and the average service time for task completion. Radio communication times from past human-in-the-loop simulation studies are used to measure service times for a 1:4 and 1:12 UAM operation and to interpolate service times for 4 < N < 12. A Monte Carlo method is then employed, using the measured and interpolated service times, to estimate arrival rate and related queueing statistics. The paper concludes by considering the estimated queuing statistics, particularly the RPIC’s utilization (i.e., proportion of time actively servicing tasks), the length of the task queue over time, and the implications for task-balanced system design.

task load↗

Fast simulation of packet loss rates in a shared buffer communications switch

This paper describes an efficient technique for estimating, via simulation, the probability of buffer overflows in a queueing model that arises in the analysis of ATM (Asynchronous Transfer Mode) communication switches. There are multiple streams of (autocorrelated) traffic feeding the switch that has a buffer of finite capacity. Each stream is designated as either being of high or low priority. When the queue length reaches a certain threshold, only high priority packets are admitted to the switch's buffer. The problem is to estimate the loss rate of high priority packets. An asymptotically optimal importance sampling approach is developed for this rare event simulation problem. In this approach, the importance sampling is done in two distinct phases. In the first phase, an importance sampling change of measure is used to bring the queue length up to the threshold at which low priority packets get rejected. In the second phase, a different importance sampling change of measure is used to move the queue length from the threshold to the buffer capacity.

Chang, Cheng-Shang↗

Offline Arterial Signal Timing Optimization for Closely Spaced Intersections

The stop-and-go driving behavior at a busy arterial causes a significant amount of fuel waste and emissions that could be reduced. For closely spaced intersections, the traditional bottom-up signal timing approach could fail under high volumes when the queues reach the upstream intersections. A well-coordinated arterial should manage the queue length to prevent the control from failing. Traditionally, coordination among signalized intersections for an arterial means finding the good offsets for each intersection. The control of the intersections along an arterial can also be coordinated by optimizing splits. Splits impact the capacity of an intersection. Similar to the highway, the capacity drop could cause growing queues. This work is based on the Virtual Phase-Link (VPL) model, a street traffic model designed for online traffic model predictive control, to obtain a top-down offline arterial signal timing. The VPL-based model can guarantee capacity consistency in intersections along an arterial. We, therefore, adopted the VPL-based model and developed an offline signal timing optimization approach. The proposed timing derived from the VPL-based offline signal timing optimization showed very good results in simulation. We also collected field experiment data, which demonstrated overall energy reductions and speed improvements on some sections of the study arterial.

47 OTHER INSTRUMENTATION↗

Rate-based congestion control in networks with smart links, revision

The author uses a network simulator to explore rate-based congestion control in networks with smart links that can feed back information to tell senders to adjust their transmission rates. This method differs in a very important way from congestion control in which a congested network component just drops packets - the most commonly used method. It is clearly advantageous for the links in the network to communicate with the end users about the network capacity, rather than the users unilaterally picking a transmission rate. The components in the middle of the network, not the end users, have information about the capacity and traffic in the network. The author experiments with three different algorithms for calculating the control rate to feed back to the users. All of the algorithms exhibit problems in the form of large queues when simulated with a configuration modeling the dynamics of a packet-voice system. However, the problems are not with the algorithms themselves, but with the fact that feedback takes time. If the network steady-state utilization is low enough that it can absorb transients in the traffic through it, then the large queues disappear. If the users are modified to start sending slowly, to allow the network to adapt to a new flow without causing congestion, a greater portion of the network's bandwidth can be used.

Heybey, Andrew Tyrrell↗

Queueing models for token and slotted ring networks

Currently the end-to-end delay characteristics of very high speed local area networks are not well understood. The transmission speed of computer networks is increasing, and local area networks especially are finding increasing use in real time systems. Ring networks operation is generally well understood for both token rings and slotted rings. There is, however, a severe lack of queueing models for high layer operation. There are several factors which contribute to the processing delay of a packet, as opposed to the transmission delay, e.g., packet priority, its length, the user load, the processor load, the use of priority preemption, the use of preemption at packet reception, the number of processors, the number of protocol processing layers, the speed of each processor, and queue length limitations. Currently existing medium access queueing models are extended by adding modeling techniques which will handle exhaustive limited service both with and without priority traffic, and modeling capabilities are extended into the upper layers of the OSI model. Some of the model are parameterized solution methods, since it is shown that certain models do not exist as parameterized solutions, but rather as solution methods.

Peden, Jeffery H.↗

Input-Output Modeling and Control of the Departure Process of Congested Airports

A simple queueing model of busy airport departure operations is proposed. This model is calibrated and validated using available runway configuration and traffic data. The model is then used to evaluate preliminary control schemes aimed at alleviating departure traffic congestion on the airport surface. The potential impact of these control strategies on direct operating costs, environmental costs and overall delay is quantified and discussed.

Pujet, Nicolas↗

Integrating vehicle trajectory planning and arterial traffic management to facilitate eco-approach and departure deployment

Eco-approach and departure (EAD) enable continuous vehicle motion in urban signalized corridors. Since such a motion can extend to the EAD vehicles’ followers, it makes EAD a promising technology to benefit the traffic flow where automated vehicles and conventional vehicles coexist. Most existing EAD studies envision an ideal setting that neglects real-world operational conditions such as lane changes, multi-movement intersection configuration, partially automated fleet, and/or limited traffic state awareness. This study aims to fill the gap by designing an EAD algorithm considering real-world traffic operation constraints. The proposed algorithm uses a model predictive controller to minimize vehicle speed reduction and variation based on the real-time traffic signal control plan and measured queues at the intersection. The required inputs are readily available at many modern intersections. We observed that the proposed controller’s performance might degrade because of lane-changing maneuvers and lead-left turn traffic signals. These observations motivated our development of a lane change management strategy and a signal control implementation strategy to facilitate the EAD implementation. The lane change management strategies separate the EAD operations and lane-changing maneuvers in time and space. The signal control implementation strategy applies lag-left turn signals to enable EAD operation for both the through and left-turn vehicles. Compared to the non-EAD case, our EAD approach produces 2.5% to 7.8% energy savings while keeping similar intersection mobility. Notably, this approach brings about 2.5% to 3.6% energy savings in a 2% CAV case. This result demonstrates the feasibility of deploying EAD at low connected automated vehicle penetration rates.

Arterial corridor management↗

Network-Level Traffic Signal Cooperation: A Higher-Order Conflict Graph Approach

Traffic signal control and cooperation are extremely important to alleviate traffic congestion in a large traffic network. This study develops a higher-order conflict graph approach for network-wide traffic signal control and cooperation. A conflict graph is applied to model the traffic signal configurations, which identifies the conflict and unconflicted movements for each intersection. In conflict graph, the node represents each movement. The weight of each node can be defined as traffic volume, queue length, fuel consumption, or any weighted combinations of these measurements. The calculation of the optimal green light duration and green light sequence (for different movements) is equivalent to sequentially finding the maximum weight independent set (MWIS) in the conflict graph. The conflict graph also provides a uniform and efficient way to connect traffic signal operations among nearby intersections spatially. Then, we introduced the concept of the k -th order neighborhood to model the degree of connectivity between each movement to the movements at upstream or downstream intersections. The weight of each node in the higher-order conflict graph not only represents its own congestion level, but also relates to the traffic conditions of nearby intersections. Through this approach, the cooperation of multiple intersections can be realized by incorporating their spatial connectivity into conflict graph and solving the MWIS problem. A simulation network is built in SUMO to test the effectiveness of the proposed method. Results suggested that the proposed model outperformed other state-of-the-art signal control methods. Also, the scheme maintains good performance under varying traffic demands.

42 ENGINEERING↗

A computerized traffic control algorithm to determine optimal traffic signal settings

An algorithm was developed to optimally control the traffic signals at each intersection using a discrete time traffic model applicable to heavy or peak traffic. Off line optimization procedures were applied to compute the cycle splits required to minimize the lengths of the vehicle queues and delay at each intersection. The method was applied to an extensive traffic network in Toledo, Ohio. Results obtained with the derived optimal settings are compared with the control settings presently in use.

Seldner, K.↗

Dynamic Queue Prediction at Signalized Intersections with Fusing Sensory Information and Connected Vehicles

Queue length is one of the most essential metrics for indicating traffic conditions at signalized intersections. Most existing studies mainly focus on queue length estimation in a retrieving way which cannot effectively predict the future state of vehicle in queue. This paper proposes an innovative dynamic queue prediction model in a vehicle-infrastructure cooperative way. The proposed dynamic queue predictor can customize the queue prediction using the trajectories of preceding vehicles from radar detection with varying information from loop detectors and connected vehicles (CVs). The dynamic queue prediction accuracy can be further improved with at least one present CV in the same cycle. With the accurate dynamic queue prediction, we present a case study of Queue-Aware Eco-Approach and Departure (QEAD) to provide an online optimal vehicle trajectory considering both the signal status and preceding vehicle's future status in queue. The proposed framework and algorithms are of pragmatic significance and one of its advanced features is the ability to work under low penetration rate of CVs. The test using Next Generation SIMulation (NGSIM) dataset and a case study in VISSIM microscopic simulation show promising results.

Ye, Fei↗