SEARCH · Search NASA

Results for “traffic complexity”

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.

SourceResearch connectionFrom yearThrough year

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

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Characterization and Analysis of the Energy-Reporting Accuracy of Connected Devices

Emerging energy-efficient building systems increasingly exhibit greater functionality, often requiring multiple operating modes (e.g. white-tunability for lighting products and data traffic for devices with networked, integrated sensors). This increased functionality makes energy consumption estimates more complex. Given that these functions consume energy, the energy performance of such building systems is dependent on what operating modes they use and how much time they spend in each mode. Devices and systems that can report their own energy consumption mitigate this energy-performance uncertainty. This study explores the energy-reporting accuracy of market-available connected electrical outlets. The study considers two residential-market products (five units each, one outlet per unit) and three commercial-market products (two units each, 18 to 24 outlets per unit) with the ability to report power drawn and/or energy consumed by devices connected to their receptacles. The products were purchased through typical market channels. Pacific Northwest National Laboratory (PNNL) conducted testing in December 2018 at its Connected Lighting Test Bed (CLTB), using a custom-developed test setup and method adapted from industry standards. The setup collected energy-consumption data reported by the outlet devices under test (DUTs) at one-minute intervals and compared that data with measurements taken by a reference meter over a range of test conditions. The residential products reported power draw but not interval or cumulative energy consumption. The commercial products reported both power draw and cumulative energy consumption. Relative reporting error (RRE) was calculated for all measurements, and analysis of the results revealed variations across devices and test conditions. The total number of measurements (50 for each residential product, 60 for each commercial product) offers an appreciable comparison of performance at the make/model level. The average RRE of the residential products derived from reported power draw was -0.02% and -1.20%. The average RRE for two of the three the commercial products derived from reported power draw was worse than those of the residential products (-2.40%, -2.72%, -0.36%). The internal integration of power over time, used to calculate cumulative energy consumption, typically occurs at current and voltage sampling rates much higher than once per minute. This suggests that the average commercial-product RRE derived from reported energy consumption should be very consistent and better than performance based on reported power draw. However, the RRE derived from reported energy consumption varied significantly across the three makes of commercial-market products and was uniformly less accurate than performance based on reported power draw. Subsequent analysis identified a number of root causes for this decrease in performance, most of which were related to reporting resolution. The goals of this study are to generate awareness of building systems capable of reporting their own energy consumption, further interest in the value of energy data for a variety of uses, draw attention to how the accuracy of reported metrics can be characterized, and quantify the performance variation found in marketavailable products. The results of this study and subsequent related work may be relevant to stakeholders in industry-specification and standards-development organizations. The methods this study employs could inform test and measurement procedures and performance classifications for connected outlets, lighting products, and other building systems capable of reporting their own energy consumption. The study concludes with stakeholder recommendations, including the following: • Energy-reporting device and system manufacturers developing products that report energy consumption should characterize the accuracy of reported metrics using a reference meter calibrated by an independent laboratory that was accredited by an ILAC MRA signatory (and whose scope of accreditation explicitly covers energy measurement), and should include this information on product data sheets. • Standards and specification development organizations should develop application-specific performance classifications that end users can understand and relate to their energy-data use needs (e.g., 2% accuracy class for utility streetlight energy billing needs, or 10% accuracy class for ESCO performance verification needs). • Current or potential owners, operators, and specifiers of energy-reporting building systems should rigorously analyze the dependency of current and planned energy-data use cases on accuracy, noting in particular the dependence (or lack thereof) on relative vs. absolute accuracy, and on trueness vs. precision (i.e., repeatability), and should communicate use-case needs to industry standards and specification organizations.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2025

Validation and Calibration of Energy Models with Real Vehicle Data from Chassis Dynamometer Experiments

Accurate estimation of vehicle fuel consumption typically requires detailed modeling of complex internal powertrain dynamics, often resulting in computationally intensive simulations. However, many transportation applications-such as traffic flow modeling, optimization, and control-require simplified models that are fast, interpretable, and easy to implement, while still maintaining fidelity to physical energy behavior. This work builds upon a recently developed model reduction pipeline that derives physics-like energy models from high-fidelity Autonomie vehicle simulations. These reduced models preserve essential vehicle dynamics, enabling realistic fuel consumption estimation with minimal computational overhead. While the reduced models have demonstrated strong agreement with their Autonomie counterparts, previous validation efforts have been confined to simulation environments. This study extends the validation by comparing the reduced energy model's outputs against real-world vehicle data. Focusing on the MidSUV category, we tune the baseline Autonomie model to closely replicate the characteristics of a Toyota RAV4. We then assess the accuracy of the resulting reduced model in estimating fuel consumption under actual drive conditions. Our findings suggest that, when the reference Autonomie model is properly calibrated, the simplified model produced by the reduction pipeline can provide reliable, semi-principled fuel rate estimates suitable for large-scale transportation applications.

42 ENGINEERING↗

DOE OSTI2020

Collaborative Fault Tolerant Control of Non-Signalized Intersections for Connected and Autonomous Vehicles

With the potential of increased penetration of connected and autonomous vehicles (CAVs), intersectional signal control faces new challenges in terms of its operation and implementation. One possibility is to fully make use of the communication capabilities of CAVs so that intersectional signal control can be realized by CAVs alone – this leads to non-signalized intersectional operation for traffic networks in urban areas. In this paper, the state-of-the-art on collaborative fault tolerant control schemes for complex systems will be briefly described. This is then followed by the formulation of operational fault tolerant control that realizes the collaborative fault tolerance functionality at CAVs operational level in response to possible individual vehicle faults, where detailed modelling using vehicle movement dynamics will be described together with the construction of fast fault diagnosis and a collaborative fault tolerant control algorithm. A simple example will be given as well to demonstrate the proposed algorithm together with the discussions on other issues such as randomness of the system, communication errors and full energy consideration. These leads to several future directions of the research for the traffic flow control of non-signalized intersections with 100% penetration of CAVs.

Wang, Hong↗

DOE OSTI2023

Simulating the Impact of Dynamic Rerouting on Metropolitan-scale Traffic Systems

The rapid introduction of mobile navigation aides that use real-time road network information to suggest alternate routes to drivers is making it more difficult for researchers and government transportation agencies to understand and predict the dynamics of congested transportation systems. Computer simulation is a key capability for these organizations to analyze hypothetical scenarios; however, the complexity of transportation systems makes it challenging for them to simulate very large geographical regions, such as multi-city metropolitan areas. In this article, we describe enhancements to the Mobiliti parallel traffic simulator to model dynamic rerouting behavior with the addition of vehicle controller actors and vehicle-to-controller reroute requests. The simulator is designed to support distributed-memory parallel execution using discrete event simulation and be scalable on high-performance computing platforms. We demonstrate the potential of the simulator by analyzing the impact of varying the population penetration rate of dynamic rerouting on the San Francisco Bay Area road network. Using high-performance parallel computing, we can simulate a day in the San Francisco Bay Area with 19 million vehicle trips with 50 percent dynamic rerouting penetration over a road network with 0.5 million nodes and 1 million links in less than three minutes. We present a sensitivity study on the dynamic rerouting parameters, discuss the simulator’s parallel scalability, and analyze system-level impacts of changing the dynamic rerouting penetration. Furthermore, we examine the varying effects on different functional classes and geographical regions and present a validation of the simulation results compared to real-world data.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Netostat: analyzing dynamic flow patterns in high-speed networks

Understanding flow traffic patterns in networks, such as the Internet or service provider networks, is crucial to improving their design and building them robustly. However, as networks grow and become more complex, it is increasingly cumbersome and challenging to study how the many flow patterns, sizes and the continually changing source-destination pairs in the network evolve with time. Here, we present Netostat, a visualization-based network analysis tool that uses visual representation and a mathematics framework to study and capture flow patterns, using graph theoretical methods such as clustering, similarity and difference measures. Netostat generates an interactive graph of all traffic patterns in the network, to isolate key elements that can provide insights for traffic engineering. We present results for U.S. and European research networks, ESnet and GEANT, demonstrating network state changes, to identify major flow trends, potential points of failure, and bottlenecks.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

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↗

DOE OSTI2021

Proton Traffic Jam: Effect of Nanoconfinement and Acid Concentration on Proton Hopping Mechanism

Abstract The properties of the water network in concentrated HCl acid pools in nanometer‐sized reverse nonionic micelles were probed with TeraHertz absorption, dielectric relaxation spectroscopy, and reactive force field simulations capable of describing proton hopping mechanisms. We identify that only at a critical micelle size of W 0 =9 do solvated proton complexes form in the water pool, accompanied by a change in mechanism from Grotthuss forward shuttling to one that favors local oscillatory hopping. This is due to a preference for H + and Cl − ions to adsorb to the micelle interface, together with an acid concentration effect that causes a “traffic jam” in which the short‐circuiting of the hydrogen‐bonding motif of the hydronium ion decreases the forward hopping rate throughout the water interior even as the micelle size increases. These findings have implications for atmospheric chemistry, biochemical and biophysical environments, and energy materials, as transport of protons vital to these processes can be suppressed due to confinement, aggregation, and/or concentration.

Adams, Ellen M.↗

DOE OSTI2021

Proton Traffic Jam: Effect of Nanoconfinement and Acid Concentration on Proton Hopping Mechanism

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Hybrid Recurrent Neural Network Modeling for Traffic Delay Prediction at Signalized Intersections Along an Urban Arterial

This paper studies the traffic delay prediction modeling for multiple signalized intersections along the Ala Moana Boulevard and Nimitz Highway in Hawaii. Several machine learning (ML) based approaches have been studied in the literature, and most of them focused on prediction accuracy rather than the end use of real-time control and implementation. These ML models tend to be very complex and non-linear in nature, making it challenging to achieve fast inferences and are computationally heavy for real-time signal control implementation. As such, in this paper, a simple yet accurate hybrid modeling method is proposed to predict traffic delay one-step ahead with the model made suitable for real-time implementation to control traffic flow. Since real-time road-side measurements are recorded in unstructured form, the paper also discusses other issues related to data extraction and the pre-processing process. Finally, a simple signal control loop is developed to demonstrate the proposed modeling approach, which has shown advantages in model accuracy and computation efficiency compared against several existing modeling methods.

42 ENGINEERING↗

DOE OSTI2023

Model Predictive Control-Based Trajectory Shaper for Safe and Efficient Adaptive Cruise Control

Recent studies show that commercially-available adaptive cruise control (ACC) systems are string-unstable, indicating that ACC-driven vehicles amplify speed fluctuations from downstream traffic and induce stop-and-go waves. Moreover, it is challenging to revise the original control algorithm of an ACC system to achieve string stability due to its internal complexity and powertrain uncertainties. To achieve desired control performance given a string-unstable ACC system and circumvent revising the original control algorithm, this study proposes a model predictive control-based trajectory shaper (MPC-TS), which only modifies the sensor-measured trajectory information (i.e., position and speed) of the preceding vehicle. The proposed MPC-TS leverages the input shaping technique to generate reference trajectory to improve string stability, while incorporating tracking errors and vehicle acceleration/deceleration magnitude in the MPC cost function and constraining fluctuations of vehicle speed and spacing to ensure desired car-following performance. Numerical experiments validate the control performance of ACC with the proposed MPC-TS in terms of string stability, safety, traffic efficiency, and comfort.

Zhou, Anye↗

DOE OSTI2022

Modeling Electric Vehicle Charging Station Siting Suitability with a Focus on Equity

As adoption of electric vehicles increases, the infrastructure to charge them must keep pace. Determining where to add new charging infrastructure is a complex process subject to many factors, including electrical service availability, vehicle dwell time, the type(s) of drivers and vehicles the stations will serve, traffic levels and timing, and land ownership. In addition, advancing social equity is a current priority of federal efforts to invest in electric vehicle charging infrastructure. Conducting Multi-criteria Decision Analysis (MCDA) within Argonne’s Energy Zones Mapping Tool (EZMT) is a useful method for analyzing many of the factors that influence how suitable a location is for potentially adding new charging infrastructure, and we show how equity metrics can be included in the analysis. However, data limitations impose challenges to using MCDA to evaluate and prioritize locations. We use three examples to demonstrate how to use publicly available data and MDCA to analyze different siting objectives. Each example starts with defining a specific objective and ends with how to use the results to identify specific potential locations that could be investigated further. This analysis demonstrates how interested stakeholders can use the EZMT to run the example MCDA models defined in this study, modify them to suit their needs, or create new MCDA models.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2023

New trends in photonic switching and optical networking architectures for data centers and computing systems [Invited]

The rapid increases in data traffic coupled with user preferences are driving the data center and computing system service providers to offer energy-efficient, intelligent, flexible, cost-effective, high-capacity, and low-latency data services without added complexity to the users. Disaggregated heterogeneous reconfigurable computing systems realized by photonic switching and interconnects can enhance throughput and energy efficiency for artificial intelligence/machine learning (AI/ML) workloads, especially when aided by the AI/ML-enhanced control plane. Photonic switching and new optical networking architectures are expected to solve many of these challenging problems. This paper discusses new trends in photonic switching and optical network architectures for future data centers and computing systems summarized as follows: (1) flat reconfigurable disaggregated computing enabled by high-radix photonic switching and interconnects in data centers; (2) chiplet-based computing architectures empowered by embedded photonics toward heterogeneous reconfigurable computing; (3) nanosecond-scale photonic switching in data centers and computing systems; (4) AI/ML in self-driving, application-aware, and situation-aware data centers; (5) the emergence of flexible networking for cloud computing, edge computing, and split computing, as well as flexible networking for 5G/6G RF-optical networks; and (6) the deployment of embedded co-designed silicon photonics being considered for future data centers.

Yoo, S. J. Ben (ORCID:0000000274201871)↗

DOE OSTI2024

DS-GL: Advancing Graph Learning via Harnessing the Power of Nature within Dynamic Systems

With the rapid digitization of the world, an increasing number of real-world applications are turning to nonEuclidean data, modeled as graphs. Due to their intrinsic high complexity and irregularity, learning from graph data demands tremendous computational power. Recently, CMOS-compatible Ising machines, i.e., dynamic systems composed of CMOS components, have emerged as a new approach that harnesses the inherent power of natural annealing within dynamic systems to efficiently resolve binary optimization problems and have been adopted for traditional graph computation, such as max-cut. However, when performing complex Graph Learning (GL) tasks, Ising machines face significant hurdles: (i) they are inherently binary and thus ill-suited for real-valued problems; (ii) their expensive all-to-all coupling network that guarantees effective natural annealing poses daunting scalability concerns. To address these challenges, this paper proposes a nature-powered graph learning framework dubbed DS-GL, which is the first effort to transform the process of solving graph learning problems into the natural annealing process within a parameterized dynamic system embodied as a CMOS chip. To tackle the two major hurdles, DS-GL first augments the Ising machine architecture to modify the self-reaction term of its Hamiltonian function from linear to quadratic, effectively serving as an energy regulator. This adjustment maintains the system’s original physical interpretation while enabling it to process continuous, real-valued data. Second, to address the scaling issue, DS-GL further upgrades the real-valued dense Ising machine by decomposing it into a mesh-based multi-PE dynamic system that supports efficient distributed spatial-temporal co-annealing across different PEs through sparse interconnects. By exploiting the inherent sparsity and component structures in real-world graphs, DS-GL is able to map complex graph learning tasks onto the scalable dynamic system while maintaining high accuracy. Evaluations with three diverse GL applications across six real-world datasets, including traffic flow and COVID-19 prediction, show that DS-GL can deliver from 102× to 106× speedups and 500× energy reduction over Graph Neural Networks on GPUs, with 5% - 20% accuracy enhancement.

Song, Ruibing↗

DOE OSTI2020

Connected Vehicle-Based Traffic Signal Coordination

This study presents a connected vehicles (CVs)-based traffic signal optimization framework for a coordinated arterial corridor. The signal optimization and coordination problem are first formulated in a centralized scheme as a mixed-integer nonlinear program (MINLP). The optimal phase durations and offsets are solved together by minimizing fuel consumption and travel time considering an individual vehicle’s trajectories. Due to the complexity of the model, we decompose the problem into two levels: an intersection level to optimize phase durations using dynamic programming (DP), and a corridor level to optimize the offsets of all intersections. In order to solve the two-level model, a prediction-based solution technique is developed. The proposed models are tested using traffic simulation under various scenarios. Compared with the traditional actuated signal timing and coordination plan, the signal timing plans generated by solving the MINLP and the two-level model can reasonably improve the signal control performance. When considering varies vehicle types under high demand levels, the proposed two-level model reduced the total system cost by 3.8% comparing to baseline actuated plan. MINLP reduced the system cost by 5.9%. It also suggested that coordination scheme was beneficial to corridors with relatively high demand levels. For intersections with major and minor street, coordination conducted for major street had little impacts on the vehicles at the minor street.

42 ENGINEERING↗

DOE OSTI2021

Applications of Digital Twin System in a Smart City System with Multi-Energy

With the increasing number of electric vehicles (EV), the smart transportation system is becoming more closely related to the smart energy system in a smart city. However, because of the high complexity, dynamics, and large-scale of these two systems, it is challenging to study their operation problems systematically, especially in severe conditions, e.g., the 2021 winter Texas power traffic crisis. With artificial intelligence, federated learning, edge computing, and automatic control, a digital twin based smart city is proposed in this paper and it focuses on two applications: smart transportation and smart energy grid. Both systems are presented in a structured design manner with several components in the digital twin system, which also contains many real-implementations of different scenarios. The proposed digital twin of a smart city provides a potential clue for the problems mentioned above.

artificial intelligence↗

DOE OSTI2020

A matrix-free approach for finite-strain hyperelastic problems using geometric multigrid

This paper investigates matrix-free algorithms for problems in quasi-static finite-strain hyperelasticity. Iterative solvers with matrix-free operator evaluation have emerged as an attractive alternative to sparse matrices in the fluid dynamics and wave propagation communities because they significantly reduce the memory traffic, the limiting factor in classical finite element solvers. Specifically, we study different matrix-free realizations of the finite element tangent operator and determine whether generalized methods of incorporating complex constitutive behavior might be feasible. Furthermore, in order to improve the convergence behavior of iterative solvers, we also propose a method by which to construct level tangent operators and employ them to define a geometric multigrid preconditioner. Additionally, the performance of the matrix-free operator and the geometric multigrid preconditioner is compared to the matrix-based implementation with an algebraic multigrid (AMG) preconditioner on a single node for a representative numerical example of a heterogeneous hyperelastic material in two and three dimensions. We find that matrix-free methods for finite-strain solid mechanics are very promising, outperforming linear matrix-based schemes by two to five times, and that it is possible to develop numerically efficient implementations that are independent of the hyperelastic constitutive law.

42 ENGINEERING↗

DOE OSTI2021

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

pnnl/FLOWER

Network FLOW analyzER - Network bi-directional deep packet header inspection. This software is designed to generate custom network flow records by monitoring bi-directional traffic from a span port, tap or other source. This function is independent of proprietary hardware or software solutions. This tool solves the problem of existing COTS solutions being either too complex or too slow.

Curtis, Darren↗