Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ENFORCEMENT”

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 865 records · Page 48
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Differentiable Predictive Control with Safety Guarantees: A Control Barrier Function Approach

In this paper, we develop a novel form of differentiable predictive control (DPC) with safety and robustness guarantees. DPC is a form of approximate model predictive control (MPC), wherein the control policy is a neural network that learns a receding horizon, optimal control law. The proposed approach exploits a new form of sampled-data barrier function to enforce safety, while only interrupting the neural network-based controller near the boundary of the safe set. The effectiveness of the proposed approach is demonstrated in simulation.

Shaw Cortez, Wenceslao E.↗
DOE OSTI2020

Design Optimization for Weighted Conduction Loss Minimization in a Dual-Active-Bridge-Based PV Microinverter

This manuscript presents a harmonic-superposition based frequency-domain approach for analysis and optimal design of a single-stage DAB-based DC-AC converter used in low-voltage DC to high voltage AC applications, such as PV microinverter. Specifically, two topological variations and correspondingly different modulation strategies involving up to four control variables (three phase shifts and switching frequency) are analyzed. Optimal trajectories of control variables are determined that result in minimized transformer RMS current at a given average power, while enforcing near-uniform ZVS. To make the design process holistic, an outer optimization loop is used to determine optimal values for the power transfer inductance (integrated as the transformer’s leakage inductance) and turns ratio, which minimize the weighted-average conduction loss contribution to the microinverter’s CEC efficiency. Based on the optimization analyses, a 400 W microinverter prototype is built and experimental results at one operating point are presented, achieving a measured efficiency of 92.8%.

14 SOLAR ENERGY↗
DOE OSTI2021

Combined Dimensional and Topology Optimization of Interior Permanent Magnet Synchronous Machine Rotors Using a Permanent Magnet Function Interpolation Method

This paper presents a magneto-structural combined dimensional and topology optimization technique for interior permanent magnet synchronous machine (IPMSM) rotors. Dimensional changes to the permanent magnet (PM) location or size are accomplished by interpolating or projecting a smoothed Heaviside rectangular function representing the presence of PM material onto the IPMSM rotor design domain mesh. A density based Solid Isotropic with Material Penalization (SIMP) topology optimization approach is then used to vary the presence of electrical steel in mesh elements to form flux barriers around the PM. The proposed method enforces a defined shape for the PM without requiring the mesh in the design domain to be deformed. Three examples are presented to demonstrate the technique: two flat bar IPMSM and one V-shaped IPMSM.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2018

Dynamic ADMM for Real-Time Optimal Power Flow

This paper considers distribution networks featuring distributed energy resources (DERs), and develops a dynamic optimization method to maximize given operational objectives in real time while adhering to relevant network constraints. The design of the dynamic algorithm is based on suitable linearization of the AC power flow equations, and it leverages the so-called alternating direction method of multipliers (ADMM). The steps of the ADMM, however, are suitably modified to accommodate appropriate measurements from the distribution network and the DERs. With the aid of these measurements, the resultant algorithm can enforce given operational constraints in spite of inaccuracies in the representation of the AC power flows, and it avoids ubiquitous metering to gather the state of noncontrollable resources. Optimality and convergence of the proposed algorithm are established in terms of tracking of the solution of a convex surrogate of the AC optimal power flow problem.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2013

Engineering Quality while Embracing Change: Lessons Learned

In an increasingly complex technical environ-ment, failure is accepted as a way of maximizing potential, a way of growing up. Experience can be utilized to improve designs, advance product maturity, and at the same time, can increase team’s training and education. It is not enough to understand the development tools to ensure a project’s success. Understanding how to plan, measure, communicate, interact, and work in teams is mandatory to make a project successful. A manager cannot enforce a process of good communication between team members. Project teams have to work together in supporting each other and establish a constant communication environment. This paper presents lessons learned during the development process of operations research software. The team members have matured and learned during the process to plan successfully, adapt to changes, use Agile methodologies, and embrace a new attitude towards failures and communication.

Marinovici, Maria C.↗
DOE OSTI2018

Parallel Nonnegative CP Decomposition of Dense Tensors

The CP tensor decomposition is a low-rank approximation of a tensor. We present a distributed-memory parallel algorithm and implementation of an alternating optimization method for computing a CP decomposition of dense tensors that can enforce nonnegativity of the computed low-rank factors. The principal task is to parallelize the Matricized-Tensor Times Khatri-Rao Product (MTTKRP) bottleneck subcomputation. The algorithm is computation efficient, using dimension trees to avoid redundant computation across MTTKRPs within the alternating method. Our approach is also communication efficient, using a data distribution and parallel algorithm across a multidimensional processor grid that can be tuned to minimize communication. We benchmark our software on synthetic as well as hyperspectral image and neuroscience dynamic functional connectivity data, demonstrating that our algorithm scales well to 100s of nodes (up to 4096 cores) and is faster and more general than the currently available parallel software.

Ballard, Grey↗
DOE OSTI2018

Synchronization-Avoiding Graph Algorithms

Because they were developed for optimal sequential complexity, classical graph algorithms as found in textbooks have strictly-defined orders of operations. Enforcing a prescribed order of operations, or even an approximate order, in a distributed memory setting requires significant amounts of synchronization, which in turn can severely limit scalability. As a result, new algorithms are typically required to achieve scalable performance, even for solving well-known graph problems. Yet, even in these cases, parallel graph algorithms are written according to parallel programming models that evolved for, e.g., scientific computing, and that still have inherent, and scalability-limiting, amounts of synchronization. In this paper we present a new approach to parallel graph algorithms: synchronization-avoiding algorithms. To eliminate synchronization and its associated overhead, synchronization-avoiding algorithms perform work in an unordered and fully asynchronous fashion in such a way that the result is constantly refined toward its final state. “Wasted” work is minimized by locally prioritizing tasks using problem-dependent task utility metrics. We classify algorithms for graph applications into two broad categories: algorithms with monotonic updates (which evince global synchronization) and algorithms with nonmonotonic updates (which evince vertex-centric synchronization). We apply our approach to both classes and develop novel, synchronization-avoiding algorithms for solving exemplar problems: SSSP and connected components for the former, graph coloring for the latter. We demonstrate that eliminating synchronization in conjunction with effective scheduling policies and optimizations in the runtime results in improved scalability for both classes of algorithms.

Firoz, Jesun S.↗
DOE OSTI2018

Exploring the Optimal Platform Configuration for Power-Constrained HPC Workflows

In high-performance computing (HPC) workflows, data analytics is typically utilized to gain insights from scientific simulations. Approaching the era of exascale, online analysis is gaining popularity due to the savings of I/O to persistent storage. As computing capability keeps growing, power consumption is becoming critical to HPC facilities. Enforcing power limits is emerging as a practical trend for power-constrained HPC facilities. However, it remains unclear how to choose the appropriate power limits for various HPC workflows and how to distribute the power limit of a workflow between simulation and analysis. In addition, given a power limit, it is unclear what the optimal scales and power capping levels are for various workflows, especially when taking reliability into account. In order to resolve these issues in power-constrained HPC, in this paper, we propose a reliability-aware model to determine the aforementioned platform configurations for HPC workflows. We also validate our model and present model-driven studies for a wide range of real-system scenarios. Our study reveals interesting insights about how platform configuration affects the performance and energy efficiency of HPC workflows under power constraints.

Tang, Kun↗
DOE OSTI2024

Blockchain-Enabled Secure Device-to-Device Communication in Software-Defined Networking

The Internet of Things (IoT) continues to increase the demand for seamless communication among IoT devices. The rapid growth of IoT devices has led to an exponential increase in device-to-device (D2D) communication within the Software-Defined Networking (SDN), though it enables a flexible archi-tecture for managing network resources. However, traditional security models face challenges (e.g., Security, privacy, and trust) in addressing the dynamic and decentralized nature of these communications. Despite of these challenges, this paper proposes a novel approach that leverages blockchain technology to enhance the security, privacy, and trustworthiness of D2D communication within an SDN environment. The proposed approach integrates blockchain nodes in sDN components to establish a decentralized ledger for transparent and verifiable records. Smart contracts enforce authentication rules to ensure that only authenticated devices can access the network and engage in transactions securely. It also automates the security policies to ensure temper resistance execution using the cryptographic mechanism for data integrity and authentic communication. The Implementation of the proposed algorithms validates the resilience of the proposed approach against cyberattacks. Overall, the proposed approach enables efficient and secure D2D communication for resilient SDN infrastructure in IoT ecosystems.

Das, Debashis↗
DOE OSTI2024

Optimal Management of Grid-Interactive Efficient Buildings via Safe Reinforcement Learning

Reinforcement learning (RL)-based methods have achieved significant success in managing grid-interactive efficient buildings (GEBs). However, RL does not carry intrinsic guarantees of constraint satisfaction, which may lead to severe safety consequences. Besides, in GEB control applications, most existing safe RL approaches rely only on the regularisation parameters in neural networks or penalty of rewards, which often encounter challenges with parameter tuning and lead to catastrophic constraint violations. To provide enforced safety guarantees in controlling GEBs, this paper designs a physics-inspired safe RL method whose decision-making is enhanced through safe interaction with the environment. Different energy resources in GEBs are optimally managed to minimize energy costs and maximize customer comfort. The proposed approach can achieve strict constraint guarantees based on prior knowledge of a set of developed hard steady-state rules. Simulations on the optimal management of GEBs, including heating, ventilation, and air conditioning (HVAC), solar photovoltaics, and energy storage systems, demonstrate the effectiveness of the proposed approach.

Huo, Xiang↗
DOE OSTI2020

Model-based Reconstruction for Single Particle Cryo-Electron Microscopy

Single particle cryo-electron microscopy is a vital tool for 3D characterization of protein structures. A typical workflow involves acquiring projection images of a collection of randomly oriented particles, picking and classifying individual particle projections by orientation, and finally using the individual particle projections to reconstruct a 3D map of the electron density profile. The reconstruction is challenging because of the low signal-to-noise ratio of the data, the unknown orientation of the particles, and the sparsity of data especially when dealing with flexible proteins where there may not be sufficient data corresponding to each class to obtain an accurate reconstruction using standard algorithms. In this paper we present a model-based image reconstruction technique that uses a regularized cost function to reconstruct the 3D density map by assuming known orientations for the particles. Our method casts the reconstruction as minimizing a cost function involving a novel forward model term that accounts for the contrast transfer function of the microscope, the orientation of the particles and the center of rotation offsets. We combine the forward model term with a regularizer that enforces desirable properties in the volume to be reconstructed. Using simulated data, we demonstrate how our method can significantly improve upon the typically used approach.

Venkatakrishnan, Singanallur↗
DOE OSTI2014

An Evaluation of One-Sided and Two-Sided Communication Paradigms on Relaxed-Ordering Interconnect

The Cray Gemini interconnect hardware provides multiple transfer mechanisms and out-of-order message delivery to improve communication throughput. In this paper we quantify the performance of one-sided and two-sided communication paradigms with respect to: 1) the optimal available hardware transfer mechanism, 2) message ordering constraints, 3) per node and per core message concurrency. In addition to using Cray native communication APIs, we use UPC and MPI micro-benchmarks to capture one- and two-sided semantics respectively. Our results indicate that relaxing the message delivery order can improve performance up to 4.6x when compared with strict ordering. When hardware allows it, high-level one-sided programming models can already take advantage of message reordering. Enforcing the ordering semantics of two-sided communication comes with a performance penalty. Furthermore, we argue that exposing out-of-order delivery at the application level is required for the next-generation programming models. Any ordering constraints in the language specifications reduce communication performance for small messages and increase the number of active cores required for peak throughput.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Network-Cognizant Design of Decentralized Volt/VAR Controllers

This paper considers the problem of designing decentralized Volt/VAR controllers for distributed energy resources (DERs). The voltage-reactive power characteristics of individual DERs are obtained by solving a convex optimization problem, where given performance objectives (e.g., minimization of the voltage deviations from a given profile) are specified and stability constraints are enforced. The resultant Volt/VAR characteristics are network-cognizant, in the sense that they embed information on the location of the DERs and, consequently, on the effect of reactive-power adjustments on the voltages throughout the feeder. Bounds on the maximum voltage deviation incurred by the controllers are analytically established. Numerical results are reported to corroborate the technical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Phasor Based Control with the Distributed, Extensible Grid Control Platform

This paper describes how to implement Phasor Based Control (PBC) using the Distributed, Extensible Grid Control (DEGC) Platform. PBC is a novel method for controlling distributed energy resources (DER) that coordinates a centralized optimization with distributed feedback controllers to enforce voltage phasor targets. DEGC is an open source software and communication platform designed for general DER control. We deployed PBC at Lawrence Berkeley Lab's FLEXLAB test site, conducting multiple hardware-in-the-loop test runs. Here, we describe how DEGC was used to implement PBC on hardware, and results demonstrating successful deployment.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Model-Based Framework to Optimize Charger Station Deployment for Battery Electric Vehicles

The development of battery electric vehicles (BEVs) is accelerating due to their environmental advantages over gasoline and diesel-powered vehicles, including a decrease in air pollution and an increase in energy efficiency. The deployment of charging infrastructure will need to increase to keep pace with demand, especially for large commercial vehicles for which few public chargers currently exist. In this paper, a new flexible framework is proposed for optimizing the placement of charging stations for BEVs, within which different physical models and optimization techniques may be used. Furthermore, a set of metrics is suggested to help enforce complex constraints and facilitate direct comparison between different optimization techniques. Unlike many existing charger placement techniques, the proposed method directly considers the historical driving patterns on a vehicle-by-vehicle basis, using transparent models to assess impacts of candidate charger placements, thus improving the explainability of the results. In the developed framework, modeled BEVs are first generated along the road network to mimic historical traffic data and are simulated traveling along a given route according to a simplified vehicle model. During the simulation, the charger placement problem is initially relaxed to allow vehicles to charge at any node along the road network, and vehicle states are tracked to assess areas of high charging demand. Charging stations are then placed based on the results of the relaxed simulation, and suggested placements are evaluated via road network simulation with fixed charger locations. This proposed framework is applied to a sample problem of placing charging stations along five major highway corridors for Class 8 over-the-road electric trucks. A novel mixed integer programming (MIP) formulation is proposed to optimize charger placements based upon the expected charging demand. Constraints were imposed on the final placement results to limit expected wait times at each station and ensure a minimum threshold of trucking routes are viable for BEVs. The results demonstrate the flexibility and potential effectiveness of the developed model-based framework for scalable charger station deployment.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2026

Optimal Client Sampling in Federated Learning with Client-level Heterogeneous Differential Privacy

Federated Learning with client-level differential privacy (DP) provides a promising framework for collaboratively training models while rigorously protecting clients’ privacy. However, classic approaches like DP-FedAvg struggle when clients have heterogeneous privacy requirements, as they must uniformly enforce the strictest privacy level across all clients, leading to excessive DP noise and significant degradation in model utility. Existing methods to improve the model utility in such heterogeneous privacy settings often assume a trusted server and are largely heuristic, resulting in suboptimal performance and lacking strong theoretical foundations. Here, in this work, we address these challenges under a practical attack model where both clients and the server are honest-but-curious. We propose GDPFed, which partitions clients into groups based on their privacy budgets and achieves client-level DP within each group to reduce the privacy budget waste and hence improve the model utility. Based on the privacy and convergence analysis of GDPFed, we find that the magnitude of DP noise depends on both model dimensionality and the per-group client sampling ratios. To further improve the performance of GDPFed, we introduce GDPFed+, which integrates model sparsification to eliminate unnecessary noise and optimizes per-group client sampling ratios to minimize convergence error. Extensive empirical evaluations on multiple benchmark datasets demonstrate the effectiveness of GDPFed+, showing substantial performance gains compared with state-of-the-art methods.

Xu, Jiahao [Univ. of Nevada, Reno, NV (United Stat↗
DOE OSTI2017

A Plug-and-Play Priors Approach for Solving Nonlinear Imaging Inverse Problems

In the past two decades, nonlinear image reconstruction methods have led to substantial improvements in the capabilities of numerous imaging systems. Such methods are traditionally formulated as optimization problems that are solved iteratively by simultaneously enforcing data consistency and incorporating prior models. Recently, the Plug-and-Play Priors (PPP) framework suggested that by using more sophisticated denoisers, not necessarily corresponding to an optimization objective, it is possible to improve the quality of reconstructed images. Here in this letter, we show that the PPP approach is applicable beyond linear inverse problems. In particular, we develop the fast iterative shrinkage/thresholding algorithm variant of PPP for model-based nonlinear inverse scattering. The key advantage of the proposed formulation over the original ADMM-based one is that it does not need to perform an inversion on the forward model. We show that the proposed method produces high quality images using both simulated and experimentally measured data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Resilient Microgrid Scheduling Considering Multi-Level Load Priorities

In this paper, we propose a novel resilient microgrid scheduling model considering the multi-level load priorities. The resiliency of the microgrid is guaranteed by quickly adjusting the output of committed local resources and shedding the loads with low priorities when the power supply from the main grid is interrupted. Considering the uncertainty of renewable energy resources and loads as well as exchanged power at PCC, the probability of successful islanding (PSI) is used to quantify the resiliency of electricity supply for various loads with different priorities. Then, the multi-level priorities are enforced through chance constrains. Results of numerical simulation validate the proposed resilient scheduling model. In addition, the impacts of resiliency requirement of loads with high priority on the resiliency of loads with low priority are analyzed as well.

Liu, Guodong↗