SEARCH · Search NASA
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.
A congestion management protocol that can be used for small messages in which the last-hop switch determines the congestion of the end point. The last-hop switch drops messages when the end point is congested and schedules a retransmission. A second congestion management protocol transmits small messages in a speculative mode to avoid the overhead caused by reservation handshakes.
Examining coupled renewable-battery power plants (“hybrids”) in congested areas provides insights into a future of increased wind and solar penetration. Our study focuses on two types of congested regions, Variable Renewable Energy (VRE)-rich Areas and Load Centers, and explores likely plant configuration choices for developers and transmission network planners. Here, this paper examines how hybrid value, comprising energy and capacity value, varies by plant configuration and congested region type considering factors such as storage duration, battery degradation, and ability to charge from the grid. We select plant locations from across the seven main U.S. independent system operators (ISOs). Hybrid value for each configuration is computed based on profit-maximizing plant operation given perfect foresight, according to observed wholesale power market real time prices from 2018 to 2021. In VRE-rich Areas, the median increase in energy value from extending storage duration from one to 4h is 29.4% for solar and 26.8% for wind, assuming low battery degradation costs and storage sized to 100% of the plant's nameplate generation capacity. Increasing storage duration beyond 4h does not substantially increase its value from energy markets, even in VRE-rich Areas. We find that solar hybrids reach a 90% capacity credit with 4h of storage, while wind hybrids require 8h of storage, based on the capacity factor of each hybrid during the top 100 net load hours.
In this study, the authors present their efforts in exploring a new type of traffic data, referred to as internet-connected vehicle (ICV) data, for traffic congestion management and operational planning. Most currently manufactured vehicles contain onboard GPS and cellular modules, and they constantly connect to automobile manufacturers' clouds via cellular networks and upload their status. Some automobile manufacturers have recently redistributed the nonpersonal part of such data, such as geolocation, to third-party organizations for innovative applications. Compared with the traditional vehicle GPS data, the ICV data contain high-resolution GPS waypoints accompanied with the vehicles' abnormal moving events (e.g., hard braking). The ICV data also have huge potential in congestion management and operational planning. They explore to identify and analyze traffic congestion on both freeways and arterials using the ICV data. The ICV data adopted for this research are redistributed by Wejo Data Service, representing 10%-15% of all moving vehicles in the Dallas-Fort Worth (DFW) area in Texas. Through one case study for a freeway segment and one for an arterial segment, new traffic performance metrics based on the characteristics of ICV data have been presented. The highlights of these efforts are as follows: (I) queue length and propagation at freeway bottlenecks can be directly measured based on where and when most internet-connected vehicles slow down and join the queue; (II) an internet-connected vehicle's actual delay time on arterials can be directly measured according to its slow movement percentage, without assuming the nondelay travel speed; and (III) the ICV data set are also combined with the high-resolution traffic signal events to generate a ground-truth time-space diagram (TSD) on arterials - a common visualization of arterial signal performance for transportation planning and operations.
he high penetration of inverter-based resources (IBRs) introduces new challenges to power systems due to the complex inverter control. However, IBRs can be configured to maximize their benefits to improve system resilience and reliability. This paper proposes a steady-state optimization model that aims to mitigate transmission congestion in a 100% grid- forming (GFM) IBR-based power system. This goal is achieved by determining the optimal droop settings for the GFM IBRs under different congestion conditions due to renewable energy and load variations. The numerical solution is rigorously verified by a high-fidelity model of the IEEE 39-bus test system with detailed GFM IBR control in the time-domain electromagnetic transient (EMT) simulation tool PSCAD. The numerical solution and simulation results show a significant congestion reduction while meeting all other operating requirements. It is also observed that the numerical solving time is substantially less compared to the EMT simulation time.
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.
Traffic congestion is an ongoing problem of great interest to researchers from different areas in academia. With the emerging technology for inter-vehicle communication, vehicles have the ability to exchange information with predecessors by wireless communication. In this paper, we present an agent-based model of traffic congestion and examine the impact of having CACC (Cooperative Adaptive Cruise Control) embedded vehicle(s) on a highway system consisting of 4 traffic lanes without overtaking. In our model, CACC vehicles adapt their acceleration/deceleration according to vehicle-to-vehicle inter-communication. We analyze the average speed of the cars, the shockwaves, and the evolution of traffic congestion throughout the lifecycle of the model. The study identifies how CACC vehicles affect the dynamics of traffic flow on a complex network and reduce the oscillatory behavior (stop and go) resulting from the acceleration/deceleration of the vehicles.
The Optimized Route Capability (ORC) concept is designed to enable intelligent offloading of congested arrival routes. When ORC predicts arrival route congestion as projected excess arrival meter fix delay, automation offers decision support to traffic managers by identifying candidate flights to strategically reroute to alternate meter fixes and alleviate the congestion. This concept was applied to a model of arrival operations into Houston International Airport. An arrival rush from the Northeast was simulated in fast-time to analyze ORC algorithm behavior. The results demonstrate how strategically rerouting a few flights to alternate meter fixes not only has the potential to manage meter fix delay (and possibly the need for traffic management initiatives applied upstream), but may also increase airport capacity utilization and reduce total flight delay.
This study compares the impacts of delay-, distance-, and cordon-based congestion pricing strategies for Austin, Texas, using the POLARIS agent-based activity-based travel demand simulation model. This approach enables agent-level heterogeneity and realistic choice options (including destination, mode, and activity scheduling) for dynamic traffic assignment and congestion feedbacks across a major metro region, which are features lacking in past work. To ensure comparability, distance-based tolls were set to generate the same revenue as delay-based tolling of $3.5 M/day, averaging $1.17/resident/day or $0.42/vehicle-trip. Delay-based pricing delivers 44% lower network delay and 13% lower VHT compared to the no-toll baseline, levels unmatched by other pricing strategies. At the height of the AM peak, drivers pay up to $0.13/mile on average, though most links in the network remain untolled. Distance-based pricing is the most effective at reducing VMT (by 4%), but VHT reductions (of 6%) primarily stem from drivers selecting closer destinations, achieving only one-fourth the delay reduction of delay-based pricing. Across various implementations of delay- and distance-based pricing, the results suggest that spatial variations of tolls are far more important than temporal variations. Cordon tolls produce minimal impacts at the network-wide level, but offer substantial delay reductions inside the cordon. Other major findings include: 1) delay-based pricing increases trip-making during the PM peak period due to backward shifts in discretionary-activity start times by higher-income residents; and 2) tolls’ spatial impacts, including changes in network flows and tolls paid by residents, vary substantially between delay- and distance-based pricing strategies.
This paper introduces a novel method for multiregional market-to-market (M2M) coordinated congestion management. It identifies shortcomings in existing M2M approaches, where Regional Transmission Organizations (RTOs) exchange shadow prices and relief requests to optimize congestion relief allocations across interconnected regions. Two methods are proposed to enhance flow and price convergence. The first method proposes that both Regional Transmission Organizations (RTOs) use state-estimator flows directly to determine relief requirements, eliminating delays and potential oscillations caused by using market flows calculated from the prior period under existing M2M approach. The second method involves exchanging transmission relief cost curves, enabling each RTOs to integrate other RTOs' relief costs curve into its real-time security-constrained economic dispatch (SCED). This method can effectively extend the coordination to multiple transmission lines and across more than two RTOs. The alternating direction method of multipliers (ADMM) is also applied to the M2M coordination problem and compared with the proposed methods. Case studies on small and large-scale systems demonstrate the effectiveness of these approaches.
In this paper, a day-ahead market-clearing model for smart distribution systems is proposed. Various types of distributed energy resources (DERs), such as distributed energy storage, distributed generators, microgrids, and load aggregators, can bid into the day-ahead distribution-level electricity market. Considering system Volt/VAR control, network reconfiguration, and interactions with the wholesale market, an optimization model is built to clear the day-ahead market, through which the distribution locational marginal pricing (DLMPs) for both active power and reactive power are determined. Through derivations of the Lagrangian function and sensitivity factors, DLMPs are decomposed to five components (i.e., marginal costs for active power, reactive power, congestion, voltage support, and loss), which provide price signals to motivate DERs to contribute to congestion management and voltage support. Finally, case studies demonstrate the effectiveness of the proposed method.
This paper presents a general existence and uniqueness result for mean field games equations on graphs (G-MFG). In particular, our setting allows to take into account congestion effects of almost any form. These general congestion effects are particularly relevant in graphs in which the cost to move from one node to another may for instance depend on the proportion of players in both the source node and the target node. Existence is proved using a priori estimates and a fixed point argument à la Schauder. We propose a new criterion to ensure uniqueness in the case of Hamiltonian functions with a complex (non-local) structure. This result generalizes the discrete counterpart of uniqueness results obtained in Lasry and Lions (C. R. Acad. Sci. Paris 343(10):679–684, 2006). Lions ( http://www.college-de-france.fr/default/EN/all/equ-der/audio-video.jsp http://www.college-de-france.fr/default/EN/all/equ{sub d}er/audio{sub v}ideo.jsp , 2014).
This article proposes a deep learning (DL)-based control algorithm—DL velocity-based model predictive control (VMPC)—for reducing traffic congestion with slowly time-varying traffic signal controls. This control algorithm consists of system identification using DL and traffic signal control using VMPC. For the training process of DL, we established a modeling error entropy loss as the criteria inspired by the theory of stochastic distribution control (SDC) originated by the fourth author. Herein, simulation results show that the proposed algorithm can reduce traffic congestion with a slowly varying traffic signal control input. Results of an ablation study demonstrate that this algorithm compares favorably to other model-based controllers in terms of prediction error, signal varying speed, and control effectiveness.
This work presents a preliminary analysis considering impact of a grid-connected microgrid on network transmission of the power system. The locational marginal prices of the power system are used to strategically place the microgrid to avoid congestion problems. In addition, a Monte Carlo simulation approach is implemented to confirm that network congestion can be attenuated if appropriate price-based signals are set to define the import and export dynamic between the two systems.
This paper addresses the challenges in accurate and realtime traffic congestion prediction with uncertainty by proposing Ising-Traffic, a novel quantum-inspired dual-model Ising based traffic prediction framework which delivers higher accuracy and lower latency than SOTA solutions. While traditional and deep learning methods face the trade-off between algorithm complexity and computational efficiency, our Ising-based method leverages Ising’s inherent and unique capability of finding the state of a system with the lowest energy and applying it to traffic prediction. In this work, traffic prediction under uncertainty is formulated into two separate Ising models: Reconstruct-Ising and Predict-Ising. Reconstruct-Ising is mapped onto modern Ising machine and handles uncertainty in traffic accurately with negligible latency and energy consumption, while Predict-Ising is mapped onto traditional processors and predicts future congestion precisely with only at most 1.8% computational demands of existing solutions. Our evaluation shows Ising-Traffic delivers on average 98× speedups and 5% accuracy improvement over SOTA.
Time shared systems permit the fixed costs of computing resources to be spread over large numbers of users. However, bottleneck results in the theory of closed queueing networks can be used to show that this economy of scale will be offset by the increased congestion that results as more users are added to the system. If one considers the total costs, including the congestion cost, there is an optimal number of users for a system which equals the saturation value usually used to define system capacity.
NASA LeRC is currently investigating a satellite architecture that incorporates on-board packet switching capability. Because of the statistical nature of packet switching, arrival traffic may fluctuate and thus it is necessary to integrate congestion control mechanism as part of the on-board processing unit. This study focuses on the closed-loop reactive control. We investigate the impact of the long propagation delay on the performance and propose a scheme to overcome the problem. The scheme uses a global feedback signal to regulate the packet arrival rate of ground stations. In this scheme, the satellite continuously broadcasts the status of its output buffer and the ground stations respond by selectively discarding packets or by tagging the excessive packets as low-priority. The two schemes are evaluated by theoretical queuing analysis and simulation. The former is used to analyze the simplified model and to determine the basic trends and bounds, and the later is used to assess the performance of a more realistic system and to evaluate the effectiveness of more sophisticated control schemes. The results show that the long propagation delay makes the closed-loop congestion control less responsive. The broadcasted information can only be used to extract statistical information. The discarding scheme needs carefully-chosen status information and reduction function, and normally requires a significant amount of ground discarding to reduce the on-board packet loss probability. The tagging scheme is more effective since it tolerates more uncertainties and allows a larger margin of error in status information. It can protect the high-priority packets from excessive loss and fully utilize the downlink bandwidth at the same time.
Network layer mobility allows transport protocols to maintain connection state, despite changes in a node's physical location and point of network connectivity. However, some congestion-controlled transport protocols are not designed to deal with these rapid and potentially significant path changes. In this paper we demonstrate several distinct problems that mobility-induced path changes can create for TCP performance. Our premise is that mobility events indicate path changes that require re-initialization of congestion control state at both connection end points. We present the application of this idea to TCP in the form of a simple solution (the Lightweight Mobility Detection and Response algorithm, that has been proposed in the IETF), and examine its effectiveness. In general, we find that the deficiencies presented are both relatively easily and painlessly fixed using this solution. We also find that this solution has the counter-intuitive property of being both more friendly to competing traffic, and simultaneously more aggressive in utilizing newly available capacity than unmodified TCP.
Traffic congestion problems provide a unique environment to study how multi-agent systems promote desired system level behavior. What is particularly interesting in this class of problems is that no individual action is intrinsically "bad" for the system but that combinations of actions among agents lead to undesirable outcomes, As a consequence, agents need to learn how to coordinate their actions with those of other agents, rather than learn a particular set of "good" actions. This problem is ubiquitous in various traffic problems, including selecting departure times for commuters, routes for airlines, and paths for data routers. In this paper we present a multi-agent approach to two traffic problems, where far each driver, an agent selects the most suitable action using reinforcement learning. The agent rewards are based on concepts from collectives and aim to provide the agents with rewards that are both easy to learn and that if learned, lead to good system level behavior. In the first problem, we study how agents learn the best departure times of drivers in a daily commuting environment and how following those departure times alleviates congestion. In the second problem, we study how agents learn to select desirable routes to improve traffic flow and minimize delays for. all drivers.. In both sets of experiments,. agents using collective-based rewards produced near optimal performance (93-96% of optimal) whereas agents using system rewards (63-68%) barely outperformed random action selection (62-64%) and agents using local rewards (48-72%) performed worse than random in some instances.