Search NASA⌕ Search

SEARCH · Search NASA

Results for “network optimization”

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 1,063 records · Page 59

PABO: Pseudo Agent-Based Multi-Objective Bayesian Hyperparameter Optimization for Efficient Neural Accelerator Design

The ever increasing computational cost of Deep Neural Networks (DNN) and the demand for energy efficient hardware for DNN acceleration has made accuracy and hardware cost co-optimization for DNNs tremendously important, especially for edge devices. Owing to the large parameter space and cost of evaluating each parameter in the search space, manually tuning of DNN hyperparameters is impractical. Automatic joint DNN and hardware hyperparameter optimization is indispensable for such problems. Bayesian optimization-based approaches have shown promising results for hyperparameter optimization of DNNs. However, most of these techniques have been developed without considering the underlying hardware, thereby leading to inefficient designs. Further, the few works that perform joint optimization are not generalizable and mainly focus on CMOS-based architectures. In this work, we present a novel pseudo agent-based multiobjective hyperparameter optimization (PABO) for maximizing the DNN performance while obtaining low hardware cost. Compared to the existing methods, our work poses a theoretically different approach for joint optimization of accuracy and hardware cost and focuses on memristive crossbar based accelerators. PABO uses a supervisor agent to establish connections between the posterior Gaussian distribution models of network accuracy and hardware cost requirements. The agent reduces the mathematical complexity of the co-optimization problem by removing unnecessary computations and updates of acquisition functions, thereby achieving significant speed-ups for the optimization procedure. PABO outputs a Pareto frontier that underscores the trade-offs between designing high-accuracy and hardware efficiency. Our results demonstrate a superior performance compared to the state-of-the-art methods both in terms of accuracy and computational speed (~100x speed up).

Parsa, Maryam↗

Graphical Optimization of Spectral Shift Reconstructions for Optical Backscatter Reflectometry

Optical backscatter reflectometry (OBR) is an interferometric technique that can be used to measure local changes in temperature and mechanical strain based on spectral analyses of backscattered light from a singlemode optical fiber. The technique uses Fourier analyses to resolve spectra resulting from reflections occurring over a discrete region along the fiber. These spectra are cross-correlated with reference spectra to calculate the relative spectral shifts between measurements. The maximum of the cross-correlated spectra—termed quality—is a metric that quantifies the degree of correlation between the two measurements. Recently, this quality metric was incorporated into an adaptive algorithm to (1) selectively vary the reference measurement until the quality exceeds a predefined threshold and (2) calculate incremental spectral shifts that can be summed to determine the spectral shift relative to the initial reference. Using a graphical (network) framework, this effort demonstrated the optimal reconstruction of distributed OBR measurements for all sensing locations using a maximum spanning tree (MST). By allowing the reference to vary as a function of both time and sensing location, the MST and other adaptive algorithms could resolve spectral shifts at some locations, even if others can no longer be resolved.

47 OTHER INSTRUMENTATION↗

Multiobjective Aerodynamic Shape Optimization Using Pareto Differential Evolution and Generalized Response Surface Metamodels

Differential Evolution (DE) is a simple, fast, and robust evolutionary algorithm that has proven effective in determining the global optimum for several difficult single-objective optimization problems. The DE algorithm has been recently extended to multiobjective optimization problem by using a Pareto-based approach. In this paper, a Pareto DE algorithm is applied to multiobjective aerodynamic shape optimization problems that are characterized by computationally expensive objective function evaluations. To improve computational expensive the algorithm is coupled with generalized response surface meta-models based on artificial neural networks. Results are presented for some test optimization problems from the literature to demonstrate the capabilities of the method.

Madavan, Nateri K.↗

Parallel physics-informed neural networks via domain decomposition

Here we develop a distributed framework for the physics-informed neural networks (PINNs) based on two recent extensions, namely conservative PINNs (cPINNs) and extended PINNs (XPINNs), which employ domain decomposition in space and in time-space, respectively. This domain decomposition endows cPINNs and XPINNs with several advantages over the vanilla PINNs, such as parallelization capacity, large representation capacity, efficient hyperparameter tuning, and is particularly effective for multi-scale and multi-physics problems. Here, we present a parallel algorithm for cPINNs and XPINNs constructed with a hybrid programming model described by MPI + X, where X ∈ {CPUs, GPUs}. The main advantage of cPINN and XPINN over the more classical data and model parallel approaches is the flexibility of optimizing all hyperparameters of each neural network separately in each subdomain. We compare the performance of distributed cPINNs and XPINNs for various forward problems, using both weak and strong scalings. Our results indicate that for space domain decomposition, cPINNs are more efficient in terms of communication cost but XPINNs provide greater flexibility as they can also handle time-domain decomposition for any differential equations, and can deal with any arbitrarily shaped complex subdomains. To this end, we also present an application of the parallel XPINN method for solving an inverse diffusion problem with variable conductivity on the United States map, using ten regions as subdomains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Co-Optimization Scheme for Hybrid Electric Vehicles Powertrain and Exhaust Emission Control System Using Future Speed Prediction

Hybrid electric vehicles (HEVs) have been an effective solution for improved vehicle fuel efficiency and reduced emission pollution. In this paper, a co-optimization scheme is proposed to optimize fuel efficiency for HEVs. Here, the proposed optimization scheme uses obtainable future speed prediction as the basis to optimally tune control parameters for the existing powertrain control system. The ramp-up time of the catalyst temperature to reach its light-off level in the exhaust emission system is also considered as an additional optimization constraint to reduce emission. The Toyota Prius Hybrid Simulink model which is an integrated model for a powertrain and exhaust emission system is validated using real data from several real driving cycle scenarios. Then, to simplify the formulation of the proposed algorithm, the model for the optimization for powertrain and exhaust emission systems is represented by a set of equivalent neural network (NN) models learned using the data generated from the well-validated Toyota Prius Hybrid Simulink model. Using NN models, a co-optimization algorithm is established that provides an optimal tuning of some fuel-sensitive powertrain control parameters using future speed prediction, leading to a novel co-optimization algorithm, achieving on average a further 9.22% fuel savings for the Toyota Prius Hybrid Simulink model.

33 ADVANCED PROPULSION SYSTEMS↗

A Novel Transactive Energy Control Mechanism for Collaborative Networked Microgrids

Collaboration of networked microgrids (NMGs) with diverse generation sources is a promising solution to smooth volatile generation output and enhance the utilization efficiency of renewable energies. In addition to centralized and decentralized collaboration mechanisms, transactive energy control (TEC) is an emerging and effective market-based control to enable energy transactions among distributed entities such as NMGs. However, existing studies on TEC suffer from several major weaknesses such as unconstrained/simplified model formulations and slow convergence rates. This paper proposes here a novel TEC mechanism to tackle these weaknesses. First, the centralized mechanism, de-centralized mechanism, and subgradient-based TEC mechanism to coordinate the operation of NMGs are briefly reviewed and modeled by a scenario-based stochastic optimization method. A new TEC mechanism is then proposed, consisting of a TEC framework, mathematical model, pricing rule, and algorithm. The optimality of the proposed TEC mathematical model and pricing rule is demonstrated. The effectiveness of the proposed TEC mechanism is verified in case studies where the NMGs operate in grid-connected, islanded, and congested modes. The advantages of the proposed TEC mechanism are also illustrated through comparisons with the centralized mechanism, decentralized mechanism, and subgradient-based TEC mechanism.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Containers on Switches: A Cluster School Experience

Network switches, such as those from Arista and Mellanox, often have underutilized computational resources in the form of built-in processors and memory. By leveraging these untapped resources, we can optimize functionality and efficiency of computational cluster networks. Our research focuses on deploying containers directly onto these switches to execute various auxiliary tasks ranging from metric logging to system-wide management via post-boot configuration. By doing so, we can significantly enchance the capabilities of the cluster without the need for additional dedicated hardware. Our research involved five distinct scenarios where switch utilization could have a profound impact on HPC Clusters: run cloud-init services via link-local connection; configuring a Telegraf container to export metrics; deploying a caching proxy; creating a reconfigurable IPv6 DHCP/DNS provider for VLAN; and implementing a client detection with Magellan discovery. These scenarios were containerized with podman and docker, and tested both physically on the switch virtually on a QEMU VM both running SONiC OS. Testing and findings indicate that network switches can indeed be used for these scenarios. They offer a wide range of possibilities beyond these applications. They run as expected as containers on the switches, and although there were some minor issues, work-arounds were implemented. Overall, this is a positive result that can be further explored with more scenarios.

97 MATHEMATICS AND COMPUTING↗

A Modular Optimal Power Flow Method for Integrating New Technologies in Distribution Grids

This work proposes a modular concept to build optimal power flow (OPF) models for distribution networks containing various emerging technologies under diverse ownership structures, to efficiently deal with evolving technology capabilities and information sharing or privacy constraints. This concept will support any typical OPF application (e.g., optimal dispatch of a given asset without violating grid constraints) by coordinating between grid module and technology module without the need to recreate various modeling elements as technology capability changes due to innovation. Moreover, the modularity of the proposed concept enables achieving system level objectives without sharing detailed information on module level objectives and constraints among modules. To achieve this, the proposed work develops a gradient-descent algorithm which builds upon the literature on the state-of-the-art power flow approximation. The proposed concept is demonstrated with two case studies of i) controllable loads and ii) battery energy storage system (BESS) on an actual large-scale distribution grid.

Hanif, Sarmad↗

Online Primal-Dual Methods With Measurement Feedback for Time-Varying Convex Optimization

This paper addresses the design and analysis of feedback-based online algorithms to control systems or networked systems based on performance objectives and engineering constraints that may evolve over time. The emerging timevarying convex optimization formalism is leveraged to model optimal operational trajectories of the systems, as well as explicit local and network-level operational constraints. Departing from existing batch and feed-forward optimization approaches, the design of the algorithms capitalizes on an online implementation of primal-dual projected-gradient methods; the gradient steps are, however, suitably modified to accommodate feedback from the system in the form of measurements - hence, the term 'online optimization with feedback.' By virtue of this approach, the resultant algorithms can cope with model mismatches in the algebraic representation of the system states and outputs, they avoid pervasive measurements of exogenous inputs, and they naturally lend themselves to a distributed implementation. Under suitable assumptions, analytical convergence claims are established in terms of dynamic regret. Furthermore, when the synthesis of the feedback-based online algorithms is based on a regularized Lagrangian function, Q-linear convergence to solutions of the time-varying optimization problem is shown.

97 MATHEMATICS AND COMPUTING↗

4-Clique network minor embedding for quantum annealers

Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network minor embedding. This method is in contrast to the standard minor embedding technique of using a path of linearly connected qubits in order to represent a logical variable state. The 4-clique minor embedding is possible on Pegasus graph connectivity, which is the native hardware graph for some of the current D-Wave quantum annealers. The Pegasus hardware graph contains many cliques of size 4, making it possible to form a graph composed entirely of paths of connected 4-cliques on which a problem can be minor-embedded. The 4-clique chains come at the cost of additional qubit usage on the hardware graph, but they allow for stronger coupling within each chain, thereby increasing chain integrity, reducing chain breaks, and allow for greater usage of the available energy scale for programming logical problem coefficients on current quantum annealers. The 4-clique minor embedding technique is compared with the standard linear path minor embedding with experiments on two D-Wave quantum annealing processors with Pegasus hardware graphs. We show proof-of-concept experiments where the 4-clique minor embeddings can use weak chain strengths while successfully carrying out the computation of minimizing random all-to-all spin glass problem instances. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Electric vehicle fast charging infrastructure planning in urban networks considering daily travel and charging behavior

Electric vehicles are a sustainable substitution to conventional vehicles. This work introduces an integrated framework for urban fast charging infrastructure to address the range anxiety issue. A mesoscopic simulation tool is developed to generate trip trajectories, and simulate charging behavior based on various trip attributes. The resulting charging demand is the key input to a mixed-integer nonlinear program that seeks charging station configuration. The model minimizes the total system cost including charging station and charger installation costs, and charging, queuing, and detouring delays. The problem is solved using a decomposition technique incorporating a commercial solver for small networks, and a heuristic algorithm for large-scale networks, in addition to the Golden Section method. The solution quality and significant superiority in the computational efficiency of the decomposition approach are confirmed in comparison with the implicit enumeration approach. Furthermore, the required infrastructure to support urban trips is explored for future market shares and technologies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Multiperiod Distribution System Restoration With Routing Repair Crews, Mobile Electric Vehicles, and Soft-Open-Point Networked Microgrids

This paper proposes a distribution system restoration model which is in response to multiple outages caused by natural disasters. The proposed restoration model includes the coordination of routing repair crews (RRCs), mobile batterycarried vehicles (MBCVs), and networked microgrids (NMGs) formed by soft open points (SOPs). The travel and repair time constraints are modeled for each RRC; travel path and charging strategy are modeled for each MBCV; and the network reconfiguration is developed considering the optimal operation of SOP-based NMGs. Furthermore, the proposed model is presented as a mixedinteger linear program which is solved by an auxiliary induce function based algorithm to reduce the computational complexity. The modified IEEE 33-bus and 69-bus distribution systems are tested with multiple outages. The presented results demonstrate the effectiveness of the proposed model

24 POWER TRANSMISSION AND DISTRIBUTION↗

Accelerating Traction Motor Optimization Design with AI Surrogate Models

The advancement of artificial intelligence systems enables the use of data-driven physics-based surrogate models to explore design spaces rapidly and deeply for engineering projects. This work presents a surrogate model workflow that accelerates electric traction motor design optimization by replacing finite element analysis (FEA) with an artificial neural network (ANN) and using this model in a genetic algorithm for design optimization. A baseline interior permanent-magnet motor is parameterized and sampled to generate FEA-labeled training data, after which a feed-forward ANN predicts key outputs (e.g., loss components and weight). The validated surrogate enables genetic-algorithm optimization and deep search over the design space without new FEA runs, producing Pareto-optimal trade-offs between weight and losses and set of optimized designs for rapid downselection of manufacturable motor designs.

Ribeiro, Pedro [ORNL] (ORCID:0009000921026641)↗

4K High Definition Video and Audio Streaming Across High-rate Delay Tolerant Space Networks

Audio and video streaming across delay tolerant networks are relatively new phenomena. During the Apollo 11 mission, video and audio were streamed directly back to Earth using fully analog radios. This streaming capability atrophied over time due to the gradual conversion to digital electronics accompanied with higher resolutions causing the required bit rates to outpace communication link performance. Additionally, 21st century space systems face the new requirement of interconnectedness. Delay Tolerant Networking (DTN) attempts to solve this requirement by uniting traditional point to point links into a robust and dynamic network. However, In order to avoid system bottlenecks, the High-Rate Delay Tolerant Networking (HDTN) implementation focuses on performance-optimization of the standards. This work extends the functionality of HDTN by implementing audio and video streaming, with the goal of demonstrating the practical application of high definition media streaming across space networks. A series of network topologies were created including simple point to point links and multi-node multi-hop networks. Test media in the form of prerecorded and live footage was streamed across the network. A set of objective quality metrics were established in order to measure the stream quality. A lunar network was emulated using a mixture of embedded ARM platforms.

Kyle J Vernyi↗

A Two-Stage Decomposition Approach for AC Optimal Power Flow

The alternating current optimal power flow (AC-OPF) problem is critical to power system operations and planning, but it is generally hard to solve due to its nonconvex and large-scale nature. Furthermore, this paper proposes a scalable decomposition approach in which the power network is decomposed into a master network and a number of subnetworks, where each network has its own AC-OPF subproblem. This formulates a two-stage optimization problem and requires only a small amount of communication between the master and subnetworks. The key contribution is a smoothing technique that renders the response of a subnetwork differentiable with respect to the input from the master problem, utilizing properties of the barrier problem formulation that naturally arises when subproblems are solved by a primal-dual interior-point algorithm. Consequently, existing efficient nonlinear programming solvers can be used for both the master problem and the subproblems. The advantage of this framework is that speedup can be obtained by processing the subnetworks in parallel, and it has convergence guarantees under reasonable assumptions. The formulation is readily extended to instances with stochastic subnetwork loads. Numerical results show favorable performance and illustrate the scalability of the algorithm which is able to solve instances with more than 11 million buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗

High Speed Computing, LANs, and WAMs

Optical fiber networks may one day offer potential capacities exceeding 10 terabits/sec. This paper describes present gigabit network techniques for distributed computing as illustrated by the CASA gigabit testbed, and then explores future all-optic network architectures that offer increased capacity, more optimized level of service for a given application, high fault tolerance, and dynamic reconfigurability.

all-optics networks terabit fiber optic networks s↗

Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems

This work aims at bringing advances in discrete optimization algorithms to solving practical engineering problems at scale. Often times, in many engineering design problems, there is a need to select a small set of influential or representative elements from a large ground set of entities in an optimal fashion. Submodular optimization provides for a formal way to solve such problems. Common examples with infrastructure systems involve sensor placement and identification of key entities with certain objectives. However, scaling these approaches to large infrastructure systems can be challenging because of the high computational complexity of the overall framework that include the optimization algorithms as well as high-complexity compute-oracles that provide the necessary objective function values. In this work, we explore a well-studied and widely-applicable paradigm, namely leader-selection in a multi-agent networked setting in the context of scalable methodologies. We demonstrate novel frameworks that utilize variations of accelerated submodular optimization algorithms along with linear-algebraic methods that can help accelerate the oracle computations. We further explore this combination in conjunction with graph partitioning paradigms to take advantage of the accelerated algorithms in a distributed setting. Finally we demonstrate the key findings on a practical problem in an operational setting. For this, we leverage an example road network with approximately 18k nodes and 27k edges in a traffic control application, where we seek a limited number of k=200 key intersections. This problem can be solved in a serial setting in just under 5 hours providing more than 2 orders of magnitude speed-up over methods that do not consider acceleration techniques.

Visweswara Sathanur, Arun↗

Machine Learning for Scalable and Optimal Load Shedding Under Power System Contingency

Prompt and effective corrective actions in response to unexpected contingencies are crucial for improving power system resilience and preventing cascading blackouts. The optimal load shedding (OLS) accounting for network limits has the potential to address the diverse system-wide impacts of contingency scenarios as compared to traditional local schemes. However, due to the fast cascading propagation of initial contingencies, real-time OLS solutions are challenging to attain in large systems with high computation and communication needs. In this paper, we propose a decentralized design that leverages offline training of a neural network (NN) model for individual load centers to autonomously construct the OLS solutions from locally available measurements. Our learning-for-OLS approach can greatly reduce the computation and communication needs during online emergency responses, thus preventing the cascading propagation of contingencies for enhanced power grid resilience. Numerical studies on both the IEEE 118-bus system and a synthetic Texas 2000-bus system have demonstrated the efficiency and effectiveness of our scalable OLS learning design for timely power system emergency operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗