Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “traffic estimation”

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 37 records · Page 2

Emissions minimization on road networks via Generic Second Order Models

In this paper we consider the problem of estimating emissions due to vehicular traffic on complex networks, and minimizing their effect by regulating traffic at junctions. For the traffic evolution, we consider a Generic Second Order Model, which encompasses the majority of two-equations (i.e., second-order) models available in the literature, and extend it to road networks with merge and diverge junctions. The dynamics on the whole network is determined by selecting a solution to the Riemann Problems at junctions, i.e., the Cauchy problems with constant initial data on each incident road. The latter are solved by assuming the maximization of the flow and assigning a traffic distribution coefficient for outgoing roads of diverges, and a priority rule for incoming roads of merges. A general emission model is considered and its parameters are tuned to the $ {\mathrm{NO_{x}}} $ emission rate. The minimization of emissions is then formulated in terms of the traffic distribution and priority parameters, taking into account travel times. A comparison is provided between roundabouts with optimized parameters and traffic lights, which correspond to time-varying traffic priorities. Our approach can be adapted to manage traffic in complex networks in order to reduce emissions while keeping travel time at acceptable levels.

33 ADVANCED PROPULSION SYSTEMS↗

Modeling the External Effects of Air Taxis in Reducing the Energy Consumption of Road Traffic

Air taxis are currently being demonstrated. Few studies have quantified their external effects in reducing on-road vehicle fuel consumption. The hypothesis of this paper is that air taxis may divert some drivers away from congested traffic corridors, improve traffic speed and fuel economy, and reduce congestion-induced energy consumption. A model is developed that links several key components: mode choice, the relationship between travel demand and traffic speeds, the relationship between traffic speeds and fuel economies, and the heterogenous value of travel time. It is applied to the route from downtown Los Angeles to Los Angeles International Airport, where at peak hours 38,200 vehicles attempt to use the route that has an hourly capacity of 17,200 vehicles. The model estimates that, with conservative assumptions and near-term technologies, diverting 3.2% of the traffic to air taxis could produce a 15% reduction in traffic vehicle fuel use. With optimistic assumptions and mature technologies, the study estimates that diverting 20% of traffic could reduce the traffic vehicle fuel use by about 74%. The key insight is that if a small share of congested travelers switched to air taxis, motivated by private benefits of time savings, significant external benefits for other road travelers (time savings and fuel savings) and to society (reduced energy use and emissions), would ensue creating a win-win-win outcome. Overall, these estimates (which are not intended as predictions because of the stated limitations) strongly suggest the need to consider the external energy effect in future cost-benefit analyses of air taxi technologies.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Connected Traffic Signal Coordination Optimization Framework through Network-Wide Adaptive Linear Quadratic Regulator–Based Control Strategy

Traffic congestion in metropolitan areas causes several significant challenges, such as longer travel times, decreased productivity, increased fuel consumption and vehicle emissions, and even severe injuries during crashes. Traffic signal control is a management approach to reduce traffic congestion and allocate the appropriate right of way for safety and mobility efficiency, both in temporal and spatial domains. Here, this study proposes a network-wide adaptive signal control coordination optimization framework based on the linear quadratic regulator algorithm. The traffic flow conditions driven by signal control inputs are formulated based on their network-wide state-space representation. After modeling traffic control regulation constraints, an adaptive linear quadratic regulator algorithm is designed to maximize the network-wide total throughput under the current conditions. Optimal signal control split time durations for multiple intersections in the network are derived by solving the algebraic Riccati equation. Furthermore, the recursive least square parameter estimation method is employed to quantify dynamic traffic condition changes. To verify the effectiveness of this proposed signal control framework, both simulation and real-world experimental tests are conducted for multiple intersections in downtown Chattanooga, Tennessee, United States. In preparation for real-world experimental tests, pipelines for real-time data processing implementation and historical traffic flow data analysis are conducted. The test results demonstrate that the proposed control framework achieves a decrease in travel time by up to 19.4%, total time spent (TTS) by up to 11.9%, and relative queue balance (RQB) by up to 15.6%. The research findings indicate that the proposed signal control framework can be generalized to handle large scale signal control optimization network-wide.

97 MATHEMATICS AND COMPUTING↗

Implications of stop-and-go traffic on training learning-based car-following control

Learning-based car-following control (LCC) of connected and autonomous vehicles (CAVs) is gaining significant attention with the advancement of computing power and data accessibility. While the flexibility and large model capacity of model-free architecture enable LCC to potentially outperform the model-based car-following (CF) model in improving traffic efficiency and mitigating congestion, the generalizability of LCC for traffic conditions different from the training environment/dataset is not well-understood. Herein, this study seeks to explore the impact of stop-and-go traffic in the training dataset on the generalizability of LCC. It uses the characteristics of lead vehicle trajectories to describe stop-and-go traffic, and links the theory of identifiability (i.e., obtaining a unique parameter estimation result using sensor measurements) to the generalizability of behavior cloning (BC) and policy-based deep reinforcement learning (DRL). Correspondingly, the study shows theoretically that: (i) stop-and-go traffic can enable the property of identifiability and enhance the control performance of BC-based LCC in different traffic conditions; (ii) stop-and-go traffic is not necessary for DRL-based LCC to generalize to different traffic conditions; (iii) DRL-based LCC trained with only constant-speed lead vehicle trajectories (not sufficient to ensure identifiability) can be generalized to different traffic conditions; and (iv) stop-and-go traffic increases variance in the training dataset, which improves the convergence of parameter estimation while negatively impacting the convergence of DRL to the optimal control policy. Numerical experiments validate the above findings, illustrating that BC-based LCC entails comprehensive training datasets for generalizing to different traffic conditions, while DRL-based LCC can achieve generalization with simple free-flow traffic training environments. This further suggests DRL as a more promising and cost-effective LCC approach to reduce operational costs, mitigate traffic congestion, and enhance safety and mobility, which can accelerate the deployment and acceptance of CAVs.

33 ADVANCED PROPULSION SYSTEMS↗

Two trillion gallons: Fuel savings from fuel economy improvements to US light-duty vehicles, 1975–2018

Since 1975, the fuel economy of new light-duty vehicles sold in the U.S. has almost doubled. Fuel economy improvements on laboratory tests gradually became real improvements on the road as newer, more efficient vehicles replaced older less efficient ones. Fleet-wide fuel economy gains produced large fuel savings. In this paper, we show that fuel economy gains measured on laboratory test cycles, adjusted for on-road conditions and weighted by the distribution of vehicles by age and their relative use, closely match estimates by the Federal Highway Administration based primarily on traffic counts and motor fuel tax records. Furthermore, adjusting for the rebound effect of fuel economy on vehicle miles traveled, we estimate the fuel savings, CO 2 emissions reductions and dollars saved on fuel due to fuel economy improvements over the past 43 years. Through the end of 2018, estimated cumulative fuel savings amount to approximately 2 trillion gallons of gasoline. We estimate that roughly one-fifth of the savings can be attributed to gasoline price increases over the period and four-fifths to fuel economy and greenhouse gas (ghg) standards.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Machine-learning-aided cognitive reconfiguration for flexible-bandwidth HPC and data center networks [Invited]

This paper proposes a machine-learning (ML)-aided cognitive approach for effective bandwidth reconfiguration in optically interconnected datacenter/high-performance computing (HPC) systems. The proposed approach relies on a Hyper-X-like architecture augmented with flexible-bandwidth photonic interconnections at large scales using a hierarchical intra/inter-POD photonic switching layout. We first formulate the problem of the connectivity graph and routing scheme optimization as a mixed-integer linear programming model. A two-phase heuristic algorithm and a joint optimization approach are devised to solve the problem with low time complexity. Then, we propose an ML-based end-to-end performance estimator design to assist the network control plane with intelligent decision making for bandwidth reconfiguration. Numerical simulations using traffic distribution profiles extracted from HPC applications traces as well as random traffic matrices verify the accuracy performance of the ML design estimator ( < <#comment/> 9 % <#comment/> error) and demonstrate up to 5 × <#comment/> throughput gain from the proposed approach compared with the baseline Hyper-X network using fixed all-to-all intra/inter-portable data center interconnects.

Chen, Xiaoliang (ORCID:0000000278056237)↗

Mitigating Traffic Congestion Through Visual Cues: Advancing Transportation Safety and Efficiency

While humans have an innate ability to estimate speed and distance, this capability is inherently imprecise. This imprecision has significant implications for traffic systems, which are highly sensitive to fluctuations in movement. Even small variations in velocity and following distances between travelers can create congestion in high-traffic environments. The absence of an effective and widely adopted solution creates significant transportation inefficiency. However, emerging technologies offer promising ways to help mitigate this issue. This paper will analyze the effectiveness of visual cues in reducing traffic congestion. Specifically, this paper presents an experiment using addressable LEDs to evaluate their effectiveness in influencing pedestrian behavior. These programmable lights enable individual control over each LED in a strip, allowing for dynamic lighting effects that serve as useful visual cues. The goal of this paper is to demonstrate that visual cues, such as addressable LED guidance, can effectively influence traveler behavior and contribute to reducing traffic congestion.

33 ADVANCED PROPULSION SYSTEMS↗

Network-Wide Traffic Signal Control Using Bilinear System Modeling and Adaptive Optimization

This study proposes a new multi-input multi-output optimal bilinear signal control method in which a bilinear dynamic model approximation is used to capture the nonlinear dynamics of the urban traffic networks. With signal green time splits as the control input and traffic delay changes as the output for each intersections in the network, a bilinear system model was developed, which, on the basis of linear system modeling, takes interactions among traffic delays and signal timing splits into consideration. Based on the bilinear system modeling framework, we conducted two steps in each time interval to derive traffic control strategies: (1) we used the normalized least-squared algorithm to estimate system parameters; and (2) we solved an online optimization problem to obtain the updated traffic control inputs for the signal timing that minimizes future traffic delays. We evaluated the proposed method in a microscopic traffic simulation environment (VISSIM) with a 35-intersection network of Bellevue city in Washington. Two different traffic demand patterns: (1) normal traffic demands; and (2) time-varying traffic demands were simulated to compare the performance of different control strategies. Experimental results show that (1) the proposed bilinear system model can better describe traffic system dynamics than linear-model based methods, such as our previously developed linear-quadratic regulator control; and (2) the proposed method outperforms the state-of-the-art signal control strategies, namely the max-pressure and the self-organizing traffic light control methods. We have also shown that the proposed method is applicable to all other possible network layouts and signal controller phasing structures.

42 ENGINEERING↗

RouteE API

This is the API endpoint for RouteE energy prediction, which can be used to get both single vehicle link or route energy estimates and transportation network-wide energy consumption estimates for a variety of vehicles. This enables external researchers and transportation engineers to access and utilize NREL's growing library of pre-trained vehicle models for prediction of transportation energy consumption. This API provides three endpoints: • /route: Energy estimation of a vehicle over a planning link or sequence of links (route). • /network: Network-wide estimation of energy consumption for all vehicle traffic in the desired area. • /compass: Energy-optimal “eco-routing” between input origin and destination coordinates (Currently in beta for Denver metro area only).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

RouteE API

This is the API endpoint for RouteE energy prediction, which can be used to get both single vehicle link or route energy estimates and transportation network-wide energy consumption estimates for a variety of vehicles. This enables external researchers and transportation engineers to access and utilize NREL's growing library of pre-trained vehicle models for prediction of transportation energy consumption. This API provides three endpoints: - /route: Energy estimation of a vehicle over a planning link or sequence of links (route). - /network: Network-wide estimation of energy consumption for all vehicle traffic in the desired area. - /compass: Energy-optimal “eco-routing” between input origin and destination coordinates (Currently in beta for Denver metro area only).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

RouteE API

This is the API endpoint for RouteE energy prediction, which can be used to get both single vehicle link or route energy estimates and transportation network-wide energy consumption estimates for a variety of vehicles. This enables external researchers and transportation engineers to access and utilize NLR's growing library of pre-trained vehicle models for prediction of transportation energy consumption. This API provides three endpoints: - /route: Energy estimation of a vehicle over a planning link or sequence of links (route). - /network: Network-wide estimation of energy consumption for all vehicle traffic in the desired area. - /compass: Energy-optimal “eco-routing” between input origin and destination coordinates (Currently in beta for Denver metro area only).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Probabilistic Data Association for Orbital-Element Estimation Using Multistage Expectation–Maximization

Tracking space objects is important for managing space traffic and predicting collisions, but is difficult in part due to data association and orbit model uncertainty. Expectation–maximization (EM) is a commonly used tracking method that has not been widely considered for tracking space objects. The technique consists of iteratively computing data association probabilities with a set of current element estimates, and updating estimates of the elements by solving a nonlinear weighted least-squares regression problem where the weights are the data association probabilities. In this paper, we demonstrate the use of EM for probabilistic data association and orbital-element estimation by applying the technique to simulated data from two angles-only tracking scenarios. In both scenarios, EM provides correct data associations and accurate maximum likelihood estimates of orbital elements. One scenario considers tracking a single object in clutter and quantifies the improvement of the orbital-element estimates and data associations as the detection probability increases. However, standard application of EM requires knowing the number of objects or may fail when a large number of objects are present. To address these issues, this paper employs a multistage version of EM that is applicable when there are a large and possibly unknown number of objects.

97 MATHEMATICS AND COMPUTING↗

Simulation Evaluation of a Large-Scale Implementation of Virtual-Phase Link-Based Model Predictive Control

Traffic congestion is a serious problem in the US, and traffic signal control is one of the effective solutions to congestion. Previous research on model predictive control (MPC)-based traffic signal control showed substantial benefits over conventional methods. This study focused on implementing MPC over a large-scale network with complex intersections and the impact of cycle length, network size, and imperfect state estimation on performances. This study implemented a virtual phase link (VPL)-based model predictive control method which used the number of vehicles in each VPL as input state variables and was suitable for National Electrical Manufacturing Association (NEMA) ring-barrier control. To test the impact of network size, the performance of distributed MPC (36 intersections in the network are divided into five subnetworks) was compared with that of MPC over the full network for a set of cycle lengths. To test the impact of imperfect state estimation, we synthetically infused estimation error and developed two scenarios, MPC-error and MPC-error narrow, which had higher and lower estimation errors, respectively. The performance of these MPC methods was compared with that of the existing time-of-day (TOD) method and an offline method that used Webster's method for split and MULTIBAND for cycle length and offset optimization. Trajectory and linkwise signal performance measures were collected from the simulation to evaluate performance. The distributed MPC method with perfect state estimation had the lowest delay and highest energy efficiency of all the methods. The performance of MPC decreased as the prediction inaccuracy increased. MPC-error had 7% and 11% more delay than MPC-error narrow in the morning and evening peaks, respectively. Overall, simulation results suggest that even with imperfect state estimation, MPC methods will outperform offline methods significantly.

large-scale simulation↗

Recommendations for an Applicant to Calculate Activity Data for Greenhouse Gases Estimates

In 2009, the U.S. Nuclear Regulatory Commission (NRC) directed the NRC staff to address climate change issues and consider the impacts of the emissions of carbon dioxide (CO 2 ) and other greenhouse gases (GHGs) in its environmental reviews for major licensing actions (NRC 2009b). To implement this direction from the Commission, the staff issued guidance in 2011 and updated guidance in 2014 in Attachment 1 to Interim Staff Guidance COL/ESP-ISG-026 (NRC 2011; NRC 2014). This guidance provides a simpler method than the method described in RG 4.2 Rev. 3, that an applicant can use to meet the plant parameter envelope (PPE) value from the Generic Environmental Impact Statement for Licensing of New Nuclear Reactors (NR GEIS). NRC staff estimated the 97-year lifecycle GHG emissions from a reference 1000 megawatt electrical (MWe) light-water reactor (LWR) for various activities associated with construction, operation (including uranium fuel cycle), and decommissioning of nuclear power plants and presented the results in Appendix H of the NR GEIS. Appendix H of the NR GEIS includes estimates of direct emissions from construction equipment and emergency diesel engines in a nuclear facility and indirect emissions from workforce vehicular traffic, fuel transportation and the uranium fuel cycle. The NR GEIS Section 3.3 extended the estimates in Appendix H for the installation of two 1000 MWe nuclear reactors on the same site. Scaling factors were used to extrapolate the GHG emissions of a reference 1000 MWe reactor to a two-unit nuclear reactor plant (each reactor unit generating 1000 MWe). GHG emission estimates for building, operation, decommissioning and safe storage (SAFSTOR) for a two-unit nuclear reactor plant would be based on the plant’s physical size, and therefore estimates for these source categories were assumed to be twice the value of the reference 1000 MWe reactor. However, GHG emissions from the fuel cycle (including fuel transportation) were scaled upward by a factor of 3, based on plant efficiencies greater than the 80 percent assumption in Appendix H. Table 1 below shows the PPE emissions for two 1000 MWe nuclear reactors as provided in NR GEIS. The total GHG emissions for two 1000 MWe reactors were calculated as 2,534,000 metric tons (MT) of CO 2 equivalent (CO 2 (e)) based on a 97 year GHG life cycle period. The GHG emissions lifetime of 97 years for a reference nuclear reactor includes a 7-year building phase, 40 years of operation, 10 years of active decommissioning, and 40 years of SAFSTOR operations (NRC 2024). Construction equipment and vehicular traffic from workers commute would contribute to the GHG emissions during a 7-year building phase. Uranium fuel cycle, vehicular traffic, fuel and waste transportation, and testing of standby diesel generators would contribute to GHG emissions during the 40-year operations phase. While NRC’s regulations allow up to 60 years of reactor facility decommissioning, Appendix H estimated that most of the GHGs would occur over an estimated 10-year period during which to the licensee would engage in significant demolition and earth-moving activities, as discussed in Supplement 1 to NUREG-0586 (NRC 2002). Vehicular traffic by the workforce during a 40-year SAFSTOR period would additionally contribute GHG emissions. The carbon footprint for a 40-year SAFSTOR period was separately analyzed from the decommissioning activities as provided in Table YYYY-2 of the staff issued guidance in 2011 (NRC 2011).

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Cost of a potential hydrogen-refueling network for heavy-duty vehicles with long-haul application in Germany 2050

Long-distance road-freight transport emits a large share of Germany's greenhouse gas (GHG) emissions. A potential solution for reducing GHG emissions in this sector is to use green hydrogen in fuel cell electric vehicles (FC-HDV) and establish an accompanying hydrogen refueling station (HRS) network. In this paper, we apply an existing refueling network design model to a HDV-HRS network for Germany until 2050 based on German traffic data for heavy-duty trucks and estimate its costs. Comparing different fuel supply scenarios (pipeline vs. on-site), the on-site scenario results show a network consisting of 137 stations at a cost of 8.38 billion € per year in 2050 (0.40 € per vehicle km), while the centralized scenario with the same amount of stations shows a cheaper cost with 7.25 billion euros per year (0.35 € per vehicle km). Finally, the hydrogen cost (LCOH) varies from 5.59 €/kg (pipeline) to 6.47 €/kg (on-site) in 2050.

08 HYDROGEN↗

An Online Approach to Solve the Dynamic Vehicle Routing Problem with Stochastic Trip Requests for Paratransit Services

Many transit agencies operating paratransit and microtransit services have to respond to trip requests that arrive in real-time, which entails solving hard combinatorial and sequential decision-making problems under uncertainty. To avoid decisions that lead to significant inefficiency in the long term, vehicles should be allocated to requests by optimizing a non-myopic utility function or by batching requests together and optimizing a myopic utility function. While the former approach is typically offline, the latter can be performed online. We point out two major issues with such approaches when applied to paratransit services in practice. First, it is difficult to batch paratransit requests together as they are temporally sparse. Second, the environment in which transit agencies operate changes dynamically (e.g., traffic conditions can change over time), causing the estimates that are learned offline to become stale. To address these challenges, we propose a fully online approach to solve the dynamic vehicle routing problem (DVRP) with time windows and stochastic trip requests that is robust to changing environmental dynamics by construction. We focus on scenarios where requests are relatively sparse—our problem is motivated by applications to paratransit services. We formulate DVRP as a Markov decision process and use Monte Carlo tree search to evaluate actions for any given state. Accounting for stochastic requests while optimizing a non-myopic utility function is computationally challenging; indeed, the action space for such a problem is intractably large in practice. To tackle the large action space, we leverage the structure of the problem to design heuristics that can sample promising actions for the tree search. Our experiments using real-world data from our partner agency show that the proposed approach outperforms existing state-of-the-art approaches both in terms of performance and robustness.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

On the Impact of Bus Dwelling on Macroscopic Fundamental Diagrams

Network macroscopic fundamental diagrams (MFDs) have recently been shown to exist in real-world urban traffic networks. When present, MFDs can be used to model traffic dynamics within an urban network by dividing the network into a set of spatially compact homogeneous regions and tracking the average level of congestion in each region. Existing analytical methods to estimate MFD mostly focus on the behavior of a single type of vehicle and do not capture the patterns of mixed traffic (e.g., cars and buses). The existence of buses matters since a bus will block the movements of other vehicles when it dwells at the bus stop. This paper proposes an analytical method to estimate the impact of bus dwelling on a network’s MFD based on the network’s geometric features, traffic control strategies, and bus operation parameters, and validates the performance of the proposed method using simulations based on microscopic traffic models. Comparisons of the analytical and simulation results show that the proposed analytical method can generally provide a good estimate of the lower bound and upper bound of the network’s MFD.

Xu, Guanhao↗