Search NASA⌕ Search

Engineering topics

Nazir, Mohammad Nawaf

Publications and source records attributed to Nazir, Mohammad Nawaf.

Tracing U.S. fuel life-cycle greenhouse gas emissions in a multi-sector dynamics model using LC-GCAM

Model-based analysis of fuel pathways is essential for informing energy and environmental policy. Two major model types are typically used: multi-sector dynamics models, which capture the broader energy-economy, such as GCAM (Global Change Analysis Model), and life cycle assessment models, such as GREET (Greenhouse Gases, Regulated Emissions, and Energy Use in Transportation). Each has distinct strengths and limitations, and recent studies increasingly adopt hybrid approaches to harness the advantages of both. However, such integration is often time-consuming and complicated by inconsistencies in system boundaries and technology definitions. We present LC-GCAM, a new tool that enables estimation of life-cycle greenhouse gas emissions and primary energy use for any fuel pathway represented in GCAM. We apply LC-GCAM to 300 scenarios designed to explore key uncertainties affecting the life-cycle performance of future fuel options in the U.S. freight sector. To evaluate LC-GCAM, we compare its results with those from GREET for nine fuel types in a 2030 reference scenario. When input assumptions are modestly aligned, LC-GCAM and GREET estimates typically agree within 10% (absolute sum-based mean absolute percentage error). LC-GCAM offers a flexible and efficient approach to generating life-cycle metrics within an integrated modeling framework, supporting robust policy analysis across a wide range of interacting energy system uncertainties.

Wolfram, Paul↗

Evaluating the impacts of Variable Message Signs on Airport Curbside Performance Using Microsimulation

Curbs play a vital role in facilitating vehicle access and egress for individuals at airports. Inefficiently allocating this resource hinders airport accessibility and productivity, resulting in congestion, longer travel times, and increased pollution. As airport demand fluctuates throughout the day and grows over time, airports face intensified curbside pressure. Yet, curb management research is significantly less robust at airports than in urban areas. Given the unbalanced nature of airport demand—riders tend to arrive simultaneously at specific entrances at certain hours—Variable Message Sign (VMS) arises as a cost-effective technology to divert vehicles from congested to underutilized curbs. Still, VMS implementation faces a significant challenge. Historically, airports have managed VMS heuristically and by intuition rather than an evidence-based approach. This research investigates the impacts of implementing VMS on curb performance at airports. By considering different driver compliance rates (DCR), we aim to determine when the sign should be turned on and off to diverge traffic to avoid undesired externalities while enhancing curb performance. Using a validated agent-based microsimulation model, VISSIM, we analyzed the Seattle-Tacoma (SeaTac) Airport as a case study. We modeled sixteen VMS management scenarios and a baseline where the message sign is not displayed, diverging vehicles between the departures and arrivals access levels at four different moments (early morning, morning, afternoon, and late night). We quantified the effects of VMS using seven metrics, including curb productivity index (CPI), curb accessibility (CA), queue length, queue duration, delay, vehicle counts, and emissions. The results of each scenario were compared against the baseline using absolute and relative changes and Repeated Measures ANOVA. Overall, VMS improved curb performance and traffic conditions at the airport, reducing emissions by 14.8% to 8.9%. Moreover, significant reductions in queue length (1,150 ft to 100 ft) and duration (15 to 144 minutes) were observed in the sending link under all VMS policies. However, impacts on the receiving link varied based on congestion, with significant increases in queue duration (9.8 to 24 min) when congested but no substantial changes in free flow. Notably, diverging vehicles to congested links resulted in non-significant results, and activating late and deactivating late VMS affected curb productivity (-5.8% to -61.4%), curb accessibility (-16.5% to -25.8%), cumulative counts (-33.4% to -59.4%), and vehicle delay (95.98% to 594.3%). Activating VMS before congestion begins in the sending link and deactivating before a queue forms in the receiving link yield the most significant improvements: 8.1% to 10.1% in CPI, 9.4% to9.6% in CA, -29.3% to -77.9% in total delay, -11.6% to -13.9% in total emissions, and 101% to 103% in cumulative counts. As the analysis was made with a wide range of time periods, access levels, driver compliance rates, and scenarios, we believe our findings can provide valuable insights into how airports should manage VMS. Our work introduces a novel approach to the scientific airport literature, as some of our metrics were previously unexplored. Additionally, we propose a methodology that other airports can adopt to maximize their curb performance.

Gutierrez, Jorge D.↗

Finding MIDDLE Ground: Scalable and Secure Distributed Learning

Edge computing methods allow devices to efficiently train a high-performing, robust, and personalized model for predictive tasks. However, these methods succumb to privacy and scalability concerns such as adversarial data recovery and expensive model communication. Furthermore, edge computing methods unrealistically assume that all devices train an identical model. In practice, edge devices have varying computational and memory constraints which may not allow certain devices to have the space or speed to train a specific model. To overcome these issues, we propose MIDDLE: a model independent distributed learning algorithm which allows heterogeneous edge devices to assist each other’s training while communicating only non-sensitive information. MIDDLE unlocks the ability for edge devices, regardless of computational or memory constraints, to assist each other even with completely different model architectures. Furthermore, MIDDLE does not require model or gradient communication which greatly reduces communication size and time. We prove that MIDDLE attains the optimal convergence rate O(1/sqrt(TM)) of stochastic gradient descent for convex and non-convex smooth optimization (for total iterations T and batch size M). Finally, our experimental results demonstrate that MIDDLE (even in non-IID data settings) attains robust and high-performing models without model or gradient communication.

Bornstein, Marc I.↗

Improved microgrid resiliency through distributionally robust optimization under a policy-mode framework

Critical energy infrastructure are constantly under stress due to the ever increasing disruptions caused by wildfires, hurricanes, other weather related extreme events and cyber-attacks. Hence it becomes important to make critical infrastructure resilient to threats from such cyber-physical events. However, such events are hard to predict and numerous in nature and type and it becomes infeasible to make a system resilient to every possible such cyber-physical event. Such an approach can make the system operation overly conservative and impractical to operate. Furthermore, distributions of such events are hard to predict and historical data available on such events can be very sparse, making the problem even harder to solve. To deal with these issues, in this paper we present a policy-mode framework that enumerates and predicts the probability of various cyber-physical events and then a distributionally robust optimization (DRO) formulation that is robust to the sparsity of the available historical data. The proposed algorithm is illustrated on an islanded microgrid example: a modified IEEE 123-node feeder with distributed energy resources (DERs) and energy storage. Simulations are carried to validate the resiliency metrics under the sampled disruption events.

Nazir, Mohammad Nawaf↗

Introduction to ALERT: A User-Interface Tool for Resilient Optimization

As the cyber-physical systems grow in complexity, there is a need for proactive resilience strategies that involve online, adaptive control actions to best prepare for any impending adversarial events. In this technical effort, supported by RD2C LDRD initiative, the project team designed and demonstrated online strategies – referred to as ALERT controls – for proactive and adaptive tuning of existing optimal controls in a microgrid, with quantifiably assured margins of resilience to various cyber-physical adversarial events. This ALERT functionality is made available to the end-users, e.g., the system operators, via an interactive user-interface. The end-users will not only be able to use the interface to visualize the system’s operation under various cyber-physical adversarial scenarios, but also evaluate the amount of tolerance the system has against selected adversarial perturbations of interest (e.g., malfunctioning sensors, suspected attacked measurements) via the adversarial plots. In this technical report, we briefly outline the algorithmic modules of the developed ALERT control technology, and introduce the user-interface tool that allows end-users (e.g., microgrid operators) to enter their system description, specify various operational and resilience requirements, and evaluate the impact of the control decisions via illustrative plots.

97 MATHEMATICS AND COMPUTING↗

On Distribution Grid Optimal Power Flow Development and Integration

Due to changes in electric distribution grid operation, new operation regimes have been recommended. Distribution grid optimal power flow (DOPF) has received tremendous attention in the research community, yet it has not been fully adopted across the utility industry. Our paper recognizes this problem and suggests a development and integration procedure for DOPF. We propose development of DOPF as a three step procedure of 1) processing the grid, 2) obtaining a tractable solution, and 3) implementing multiple solution algorithms and benchmarking them to improve application reliability. For the integration of DOPF, we demonstrate how a DOPF federate may be developed that can be integrated in a co-simulation environment to mimic the real-world conditions and hence improve its practicality to be deployed in the field. To demonstrate the efficacy of the proposed methods, tests on IEEE 123 bus system are performed where the usage of tractable formulation in DOPF algorithm development and its comparison to the benchmark solution are demonstrated.

Hanif, Sarmad↗

Optimal, centralized dynamic curbside parking space zoning

In this paper we formulate a dynamic mixed integer program for optimally zoning curbside parking spaces subject to transportation policy-inspired constraints and regularization terms. First, we illustrate how given some objective of curb zoning valuation as a function of zone type (paid parking, bus stop, etc.), dynamically rezoning involves unrolling this optimization program over a fixed time horizon. Second, we implement two different solution methods given an example curb zoning valuation. In the first method, we solve long horizon dynamic zoning problems via approximate dynamic programming. In the second method, we employ Dantzig-Wolfe decomposition to break-up the mixed-integer program into a master problem and several sub-problems that can be solved in parallel. This speeds up the computational solve-time of the MIP considerably. We present simulation results and comparisons of the different employed techniques on vehicle arrival-rate data obtained for a neighborhood in downtown Seattle, Washington, USA.

Nazir, Mohammad Nawaf↗

Optimization-Based Resiliency Verification in Microgrids via Maximal Adversarial Set Characterization

Critical energy infrastructures are increasingly relying on advanced sensing and control technologies for efficient and optimal utilization of flexible energy resources. Algorithmic procedures are needed to ensure that such systems are designed to be resilient to a wide range of cyber-physical adversarial events. This paper provides a robust optimization framework to quantify the largest adversarial perturbation that a system can accommodate without violating pre-specified resiliency metrics. We formulate the maximal adversarial set characterization as a bi-level optimization problem which is solved via Lagrangian relaxations.We illustrate the proposed algorithm on an islanded microgrid example: a modified IEEE 123-node feeder with distributed energy resources. Simulations are carried out to characterize the tolerable adversarial perturbations for varying levels of available flexibility (energy reserves).

Nazir, Mohammad Nawaf↗

Market mechanism to enable grid-aware dispatch of Aggregators in radial distribution networks

This paper presents a market-based optimization framework wherein Aggregators can compete for nodal capacity across a distribution feeder and guarantee that allocated flexible capacity cannot cause overloads or congestion. This mechanism, thus, allows Aggregators with allocated capacity to pursue a number of services at the whole-sale market level to maximize revenue of flexible resources. Based on Aggregator bids of capacity (MW) and network access price ($/MW), the distribution system operator (DSO) formulates an optimization problem that prioritizes capacity to the different Aggregators across the network while implicitly considering AC network constraints. This grid-aware allocation is obtained by incorporating a convex inner approximation into the optimization framework that prioritizes hosting capacity to different Aggregators. We adapt concepts from transmission-level capacity market clearing, utility demand charges, and Internet-like bandwidth allocation rules to distribution system operations by incorporating nodal voltage and transformer constraints into the optimization framework. Simulation based results on IEEE distribution networks showcase the effectiveness of the approach.

Nazir, Mohammad Nawaf↗