Search NASA⌕ Search

SEARCH · Search NASA

Results for “hierarchical 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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Recent activities within the aeroservoelasticity branch at the NASA Langley Research Center

The objective of research in aeroservoelasticity at the NASA Langley Research Center is to enhance the modeling, analysis, and multidisciplinary design methodologies for obtaining multifunction digital control systems for application to flexible flight vehicles. Recent accomplishments are discussed, and a status report on current activities within the Aeroservoelasticity Branch is presented. In the area of modeling, improvements to the Minimum-State Method of approximating unsteady aerodynamics are shown to provide precise, low-order aeroservoelastic models for design and simulation activities. Analytical methods based on Matched Filter Theory and Random Process Theory to provide efficient and direct predictions of the critical gust profile and the time-correlated gust loads for linear structural design considerations are also discussed. Two research projects leading towards improved design methodology are summarized. The first program is developing an integrated structure/control design capability based on hierarchical problem decomposition, multilevel optimization and analytical sensitivities. The second program provides procedures for obtaining low-order, robust digital control laws for aeroelastic applications. In terms of methodology validation and application the current activities associated with the Active Flexible Wing project are reviewed.

Noll, Thomas↗
NASA NTRS2011

Best Merge Region Growing with Integrated Probabilistic Classification for Hyperspectral Imagery

A new method for spectral-spatial classification of hyperspectral images is proposed. The method is based on the integration of probabilistic classification within the hierarchical best merge region growing algorithm. For this purpose, preliminary probabilistic support vector machines classification is performed. Then, hierarchical step-wise optimization algorithm is applied, by iteratively merging regions with the smallest Dissimilarity Criterion (DC). The main novelty of this method consists in defining a DC between regions as a function of region statistical and geometrical features along with classification probabilities. Experimental results are presented on a 200-band AVIRIS image of the Northwestern Indiana s vegetation area and compared with those obtained by recently proposed spectral-spatial classification techniques. The proposed method improves classification accuracies when compared to other classification approaches.

Tarabalka, Yuliya↗
NASA NTRS1998

On the Efficacy of Source Code Optimizations for Cache-Based Systems

Obtaining high performance without machine-specific tuning is an important goal of scientific application programmers. Since most scientific processing is done on commodity microprocessors with hierarchical memory systems, this goal of "portable performance" can be achieved if a common set of optimization principles is effective for all such systems. It is widely believed, or at least hoped, that portable performance can be realized. The rule of thumb for optimization on hierarchical memory systems is to maximize temporal and spatial locality of memory references by reusing data and minimizing memory access stride. We investigate the effects of a number of optimizations on the performance of three related kernels taken from a computational fluid dynamics application. Timing the kernels on a range of processors, we observe an inconsistent and often counterintuitive impact of the optimizations on performance. In particular, code variations that have a positive impact on one architecture can have a negative impact on another, and variations expected to be unimportant can produce large effects. Moreover, we find that cache miss rates - as reported by a cache simulation tool, and confirmed by hardware counters - only partially explain the results. By contrast, the compiler-generated assembly code provides more insight by revealing the importance of processor-specific instructions and of compiler maturity, both of which strongly, and sometimes unexpectedly, influence performance. We conclude that it is difficult to obtain performance portability on modern cache-based computers, and comment on the implications of this result.

VanderWijngaart, Rob F.↗
NASA NTRS1998

On the Efficacy of Source Code Optimizations for Cache-Based Systems

Obtaining high performance without machine-specific tuning is an important goal of scientific application programmers. Since most scientific processing is done on commodity microprocessors with hierarchical memory systems, this goal of "portable performance" can be achieved if a common set of optimization principles is effective for all such systems. It is widely believed, or at least hoped, that portable performance can be realized. The rule of thumb for optimization on hierarchical memory systems is to maximize temporal and spatial locality of memory references by reusing data and minimizing memory access stride. We investigate the effects of a number of optimizations on the performance of three related kernels taken from a computational fluid dynamics application. Timing the kernels on a range of processors, we observe an inconsistent and often counterintuitive impact of the optimizations on performance. In particular, code variations that have a positive impact on one architecture can have a negative impact on another, and variations expected to be unimportant can produce large effects. Moreover, we find that cache miss rates-as reported by a cache simulation tool, and confirmed by hardware counters-only partially explain the results. By contrast, the compiler-generated assembly code provides more insight by revealing the importance of processor-specific instructions and of compiler maturity, both of which strongly, and sometimes unexpectedly, influence performance. We conclude that it is difficult to obtain performance portability on modern cache-based computers, and comment on the implications of this result.

VanderWijngaart, Rob F.↗
NASA NTRSDate not supplied

Cloud Optimized Data Formats

Cloud computing offers the promise of being able to analyze Big Data earth Observations at scale, by allowing scientists to deploy many nodes at once to analyze the data. However, in order to take full advantage of cloud scalability, it is often necessary to reorganize and reformat the data to enable fine-grained, parallel access to the data in Web Object Storage. NASA recently conducted a study of several formats that are optimized for analysis in the cloud: Parquet, zarr, HDF (Hierarchical Data Format) in the Cloud, and Cloud-Optimized GeoTIFF (Tagged Image File Format). They were compared against non-cloud-optimized formats, netCDF (network Common Data Form) and GeoTIFF, with criteria based both on stewardship and analysis performance.

Christopher Lynnes↗
DOE OSTI2025

An Introduction to the Federated Architecture for Secure and Transactive Distributed Energy Management Solutions (FAST-DERMS)

Deployment and capability of distributed energy resources (DER) in power systems is growing rapidly. These resources present an opportunity for low-cost provision of energy and grid services. The Federal Energy Regulatory Commission recently provided rulings to enable market participation of these distribution-connected resources, but the prevailing strategies for their management may not scale well to meet future needs. This paper introduces the Federated Architecture for Secure and Transactive Distributed Energy Management Solutions (FAST-DERMS) which was designed to address this need. In it we describe the architectural features of the approach, and a reference controls implementation employing a hierarchical coordination that includes stochastic optimization, model predictive control, and a simple real-time management scheme. Sample results from simulation show firm transmission-level service provision measured at the distribution substation.

grid architecture↗
DOE OSTI2024

An Introduction to the Federated Architecture for Secure and Transactive Distributed Energy Management Solutions (FAST-DERMS): Preprint

Deployment and capability of distributed energy resources (DER) in power systems is growing rapidly. These resources present an opportunity for low-cost provision of energy and grid services. The Federal Energy Regulatory Commission recently provided rulings to enable market participation of these distribution-connected resources, but the prevailing strategies for their management may not scale well to meet future needs. This paper introduces the Federated Architecture for Secure and Transactive Distributed Energy Management Solutions (FASTDERMS) which was designed to address this need. In it we describe the architectural features of the approach, and a reference controls implementation employing a hierarchical coordination that includes stochastic optimization, model predictive control, and a simple real-time management scheme. Sample results from simulation show firm transmission-level service provision measured at the distribution substation.

DERMS↗
DOE OSTI2025

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities

We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes, including the optimal solution selection problem and the optimal Nash equilibrium (NE) seeking problem. Our main contribution is threefold. (i) We consider bilevel VIs with monotone and Lipschitz continuous mappings and devise a single-timescale iteratively regularized extragradient method, named IR-EG 𝚖,𝚖 . We improve the existing iteration complexity results for addressing both bilevel VI and VI-constrained convex optimization problems. (ii) Under the strong monotonicity of the outer-level mapping, we develop a method named IR-EG 𝚜,𝚖 and derive faster guarantees than those in (i). We also study the iteration complexity of this method under a constant regularization parameter. These results appear to be new for both bilevel VIs and VI-constrained optimization. (iii) To our knowledge, complexity guarantees for computing the optimal NE in nonconvex settings do not exist. Motivated by this lacuna, we consider VI-constrained nonconvex optimization problems and devise an inexactly projected gradient method, named IPR-EG, where the projection onto the unknown set of equilibria is performed using IR-EG 𝚜,𝚖 with a prescribed termination criterion and an adaptive regularization parameter. We obtain new complexity guarantees in terms of a residual map and an infeasibility metric for computing a stationary point. Here, we validate the theoretical findings using preliminary numerical experiments for computing the best and the worst NEs.

bilevel optimization↗
DOE OSTI2025

Neural architecture codesign for fast physics applications

We develop a pipeline to streamline neural architecture codesign for physics applications to reduce the need for ML expertise when designing models for novel tasks. Our method employs neural architecture search and network compression in a two-stage approach to discover hardware efficient models. This approach consists of a global search stage that explores a wide range of architectures while considering hardware constraints, followed by a local search stage that fine-tunes and compresses the most promising candidates. We exceed performance on various tasks and show further speedup through model compression techniques such as quantization-aware-training and neural network pruning. We synthesize the optimal models to high level synthesis code for FPGA deployment with the hls4ml library. Additionally, our hierarchical search space provides greater flexibility in optimization, which can easily extend to other tasks and domains. We demonstrate this with two case studies: Bragg peak finding in materials science and jet classification in high energy physics, achieving models with improved accuracy, smaller latencies, or reduced resource utilization relative to the baseline models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1979

A study of the application of singular perturbation theory

A hierarchical real time algorithm for optimal three dimensional control of aircraft is described. Systematic methods are developed for real time computation of nonlinear feedback controls by means of singular perturbation theory. The results are applied to a six state, three control variable, point mass model of an F-4 aircraft. Nonlinear feedback laws are presented for computing the optimal control of throttle, bank angle, and angle of attack. Real Time capability is assessed on a TI 9900 microcomputer. The breakdown of the singular perturbation approximation near the terminal point is examined Continuation methods are examined to obtain exact optimal trajectories starting from the singular perturbation solutions.

Mehra, R. K.↗
NASA NTRSDate not supplied

Performance Assessment of LunaNet’s Augmented Forward Signal

LunaNet provides a common set of interoperable specifications for communication and position, navigation and time (PNT) services and interfaces soon to be implemented in lunar vicinity. The LunaNet Interoperability Specification (LNIS) provides the design for the GNSS-like Augmented Forward Signal (AFS), which enables orbiting and surface users in lunar space, such as Artemis, to estimate their position, velocity, and time. The specification of AFS defines two orthogonal signal components on a single carrier: the in-phase component (AFS-I), a lower-chip-rate data channel tailored for applications where low SWaP (Size, Weight, and Power) is critical (e.g., IoT devices or search and rescue), and the quadrature component (AFS-Q), a high-chip-rate data-less pilot signal for high-precision, robust lunar navigation and positioning applications. An initial description of AFS was provided in [1], with initial analysis results shown in [2] and [3] and the current signal in space description provided in [4]. As part of NASA's Lunar Communication Relay and Navigation Systems (LCRNS) project, this work expands upon the initial analysis results and proposes a new expanded set of AFS-Q spreading codes that exceed the cross-correlation and autocorrelation sidelobe performance of L1C and other GNSS signals, while providing additional expansion capabilities for future provider satellites. A set of 420 codes was selected from a Weil-based code derived from the prime number 10247, which is larger than the 10243 prime number used to derive Beidou’s B1C Weil sequences. Both the initial set of 210 codes and the expanded set of 420 codes are shown to provide the best cross-correlation of any 10230-chip satellite navigation codes. The performance is demonstrated for hierarchical sets of spreading codes optimized and organized in sets of 30 codes. The new codes were developed using an optimization approach and correlation methodology described in [5]. The work also compares LunaNet’s AFS to terrestrial GNSS signals in terms of acquisition, tracking, and data demodulation performance. Performance is evaluated for receivers that only track the 1.023 MCPS data channel spreading code for low SWaP IoT use cases, as well as for receivers that track both the 1.023 MCPS data channel and the 5.115 MCPS pilot channel spreading code for high-performance use cases. Performance is assessed in the presence of interference and thermal noise. The analysis is performed in terms of expected operating conditions on the lunar surface. Several unique flexibility aspects of the augmented forward signal are described, including the use of the Q channel’s secondary and tertiary codes to enable variable coherent integrations during acquisition. This is compared to GNSS signals such as L5/E5 and MBOC in terms of achievable processing gain for interference mitigation versus acquisition complexity. The work details acquisition and tracking techniques used to optimally acquire and track the primary, secondary, and tertiary codes on the Q channel, as well as acquisition of the I channel spreading code. Acquisition of the 8 ms Q channel spreading code is also compared to joint acquisition of the I and Q channel primary codes in noise and interference environments.

LCRNS↗
NASA NTRSDate not supplied

Performance Assessment of LunaNet’s Augmented Forward Signal

LunaNet provides a common set of interoperable specifications for communication and position, navigation and time (PNT) services and interfaces soon to be implemented in lunar vicinity. The LunaNet Interoperability Specification (LNIS) provides the design for the GNSS-like Augmented Forward Signal (AFS), which enables orbiting and surface users in lunar space, such as Artemis, to estimate their position, velocity, and time. The specification of AFS defines two orthogonal signal components on a single carrier: the in-phase component (AFS-I), a lower-chip-rate data channel tailored for applications where low SWaP (Size, Weight, and Power) is critical (e.g., IoT devices or search and rescue), and the quadrature component (AFS-Q), a high-chip-rate data-less pilot signal for high-precision, robust lunar navigation and positioning applications. An initial description of AFS was provided in LNIS 2023, with initial analysis results shown in Dafesh 2024 and Dafesh 2025, and the current signal in space description provided in LNIS 2025. As part of NASA's Lunar Communication Relay and Navigation Systems (LCRNS) project, this work expands upon the initial analysis results and proposes a new expanded set of AFS-Q spreading codes that exceed the cross-correlation and autocorrelation sidelobe performance of L1C and other GNSS signals, while providing additional expansion capabilities for future service satellites. A set of 420 codes was selected from a Weil-based code derived from the prime number 10247, which is larger than the 10243 prime number used to derive BeiDou’s B1C Weil sequences. Both the initial set of 210 codes and the expanded set of 420 codes are shown to provide the best cross-correlation of any 10230-chip satellite navigation codes. The performance is demonstrated for hierarchical sets of spreading codes optimized and organized in sets of 30 codes. The work also compares LunaNet’s AFS to terrestrial GNSS signals in terms of acquisition, tracking, and data demodulation performance. Performance is evaluated for receivers that only track the 1.023 MCPS data channel spreading code for low SWaP IoT use cases, as well as for receivers that track both the 1.023 MCPS data channel and the 5.115 MCPS pilot channel spreading code for high-performance use cases. Performance is assessed in the presence of interference and thermal noise. The analysis is performed in terms of expected operating conditions on the lunar surface. Several unique flexibility aspects of the augmented forward signal are described, including the use of the Q channel’s secondary and tertiary codes to enable variable coherent integrations during acquisition. This is compared to GNSS signals such as L5/E5 and MBOC in terms of achievable processing gain for interference mitigation versus acquisition complexity. The work details acquisition and tracking techniques used to optimally acquire and track the primary, secondary, and tertiary codes on the Q channel, as well as acquisition of the I channel spreading code. Acquisition of the 8 ms, Q channel spreading code is also compared to joint acquisition of the I and Q channel primary codes in noise and interference environments

LCRNS↗
DOE OSTI2025

Enhancing EV Motor Design Through Knowledge-Based AI and Hierarchical Fuzzy Logic Model

This work presents a novel approach to optimizing electric vehicle motor design through the integration of Knowledge-Based Artificial Intelligence (KB-AI) and Hierarchical Fuzzy Logic. Traditional motor design processes are time-intensive, relying heavily on iterative simulations and domain-specific expertise. These processes are further complicated by the nonlinear relationships between key design parameters. The proposed framework addresses these challenges by systematically encoding expert knowledge from scientific literature into a fuzzy logic system, allowing for the efficient handling of complex design variables. The hierarchical fuzzy logic model reduces computational complexity by decomposing the nonlinear relationships into manageable rule sets while maintaining design accuracy. The proposed methodology was applied to the design of a 100 kW motor, yielding optimal values for key parameters. This resulted in a compact motor design with a volume of 2.2 liters, showcasing the framework’s ability to deliver high-performance, application-specific motor configurations.

Kumar, Praveen [ORNL] (ORCID:0000000291877857)↗
NASA NTRS1993

Optimization by decomposition in structural and multidisciplinary applications

An algorithm for a general, multilevel structural optimization by substructuring is derived, based on the linear decomposition concept that is rooted in the Bellman's Optimality Criterion enhanced with the optimum sensitivity derivatives used as a means to account for coupling among the subproblems, each of which is limited to optimization of a substructure. The algorithm applies also to those multidisciplinary problems whose subproblems form a hierarchy similar to that of substructures. In systems where the subproblems communicate with each other at the same level, the decomposition becomes non-hierarchic and the system may be optimized as a whole based on the derivatives of the system behavior with respect to the design variables computed by a method that bypasses finite differencing on the system analysis. When a multidisciplinary system includes a structure as its part, a hybrid, hierarchic/non-hierarchic decomposition applies. Numerical examples and references to computational experience accumulated to date illustrate the discussion.

Sobieszczanski-Sobieski, Jaroslaw↗
DOE OSTI2024

Adaptive immersed isogeometric level-set topology optimization

Here, this paper presents for the first time an adaptive immersed approach for level-set topology optimization using higher-order truncated hierarchical B-spline discretizations for design and state variable fields. Boundaries and interfaces are represented implicitly by the iso-contour of one or multiple level-set functions. An immersed finite element method, the eXtended IsoGeometric Analysis, is used to predict the physical response. The proposed optimization framework affords different adaptively refined higher-order B-spline discretizations for individual design and state variable fields. The increased continuity of higher-order B-spline discretizations together with local refinement enables direct control over the accuracy of the representation of each field while simultaneously reducing computational cost compared to uniformly refined discretizations. A flexible mesh adaptation strategy enables local refinement based on geometric measures or physics-based error indicators. These adaptive discretization and analysis approaches are integrated into gradient-based optimization schemes, evaluating the design sensitivities using the adjoint method. Numerical studies illustrate the features of the proposed framework with static, linear elastic, multi-material, two- and three-dimensional problems. The examples provide insight into the effect of refining the design variable field on the optimization result and the convergence rate of the optimization process. Using coarse higher-order B-spline discretizations for level-set fields promotes the development of smooth designs and suppresses the emergence of small features. Moreover, adaptive mesh refinement for state variable fields results in a reduction of overall computational cost. Higher-order B-spline discretizations are especially interesting when evaluating gradients of state variable fields due to their higher inter-element continuity.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Solid State Power Substation DC Node Optimization and Controller Hardware-In-The-Loop Demonstration

A solid state power substation (SSPS) node is a microgrid that integrates distributed energy resources and loads and injects/absorbs power to/from the SSPS distribution network. It is an essential building block of a futuristic distribution grid network. This paper presents the development and demonstration of optimization use cases of a SSPS DC node. By adopting multi-layer hierarchical control architecture and developing automatic device identification and dynamic optimization formulation algorithms, the SSPS DC node can perform plug-and-play resource integration and seamless transition of the optimized node operation under on and off grid condition without sophisticated algorithms, control mode changes, and user interactions. Four optimization use cases including economic dispatches with price signal changes, a sudden PV power drop, and a single directional meter and its associated costs with sending power back to the grid, and resiliency under a grid inverter trip condition were demonstrated through the real-time controller hardware-in-the-loop simulation.

Kim, Namwon↗
NASA NTRS2000

Accelerating Time-Varying Hardware Volume Rendering Using TSP Trees and Color-Based Error Metrics

This paper describes a new hardware volume rendering algorithm for time-varying data. The algorithm uses the Time-Space Partitioning (TSP) tree data structure to identify regions within the data that have spatial or temporal coherence. By using this coherence, the rendering algorithm can improve performance when the volume data is larger than the texture memory capacity by decreasing the amount of textures required. This coherence can also allow improved speed by appropriately rendering flat-shaded polygons instead of textured polygons, and by not rendering transparent regions. To reduce the polygonization overhead caused by the use of the hierarchical data structure, we introduce an optimization method using polygon templates. The paper also introduces new color-based error metrics, which more accurately identify coherent regions compared to the earlier scalar-based metrics. By showing experimental results from runs using different data sets and error metrics, we demonstrate that the new methods give substantial improvements in volume rendering performance.

Ellsworth, David↗
NASA NTRS1994

GA-optimization for rapid prototype system demonstration

An application of the Genetic Algorithm (GA) is discussed. A novel scheme of Hierarchical GA was developed to solve complicated engineering problems which require optimization of a large number of parameters with high precision. High level GAs search for few parameters which are much more sensitive to the system performance. Low level GAs search in more detail and employ a greater number of parameters for further optimization. Therefore, the complexity of the search is decreased and the computing resources are used more efficiently.

Kim, Jinwoo↗