Search NASA⌕ Search

SEARCH · Search NASA

Results for “PERFORMANCE GUARANTEE”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Performance Guaranteed Inertia Emulation forDiesel-Wind System Feed Microgrid via ModelReference Control

In this paper, a model reference control based inertia emulation strategy is proposed. Desired inertia can be precisely emulated through this control strategy so that guaranteed performance is ensured. A typical frequency response model with parametrical inertia is set to be the reference model. A measurement at a specific location delivers the information of disturbance acting on the diesel-wind system to the referencemodel. The objective is for the speed of the diesel-wind system to track the reference model. Since active power variation is dominantly governed by mechanical dynamics and modes, only mechanical dynamics and states, i.e., a swing-engine-governor system plus a reduced-order wind turbine generator, are involved in the feedback control design. The controller is implemented in a three-phase diesel-wind system feed microgrid. The results show exact synthetic inertia is emulated, leading to guaranteed performance and safety bounds.

Melin, Alexander M.↗
DOE OSTI2017

Performance Guaranteed Inertia Emulation for Diesel-Wind System Feed Microgrid via Model Reference Control

In this paper, a model reference control based inertia emulation strategy is proposed. Desired inertia can be precisely emulated through this control strategy so that guaranteed performance is ensured. A typical frequency response model with parametrical inertia is set to be the reference model. A measurement at a specific location delivers the information of disturbance acting on the diesel-wind system to the reference model. The objective is for the speed of the diesel-wind system to track the reference model. Since active power variation is dominantly governed by mechanical dynamics and modes, only mechanical dynamics and states, i.e., a swing-engine-governor system plus a reduced-order wind turbine generator, are involved in the feedback control design. The controller is implemented in a three-phase diesel-wind system feed microgrid. The results show exact synthetic inertia is emulated, leading to guaranteed performance and safety bounds.

Zhang, Yichen↗
DOE OSTI2020

Synchronization-Based Guaranteed-Performance Formation Design for Swarm Systems

Guaranteed-performance formation control for swarm systems with the second-order dynamics is investigated based on the synchronization control strategy. Firstly, a new formation protocol is presented, where the weights of connected edges are adaptively regulated and the performance constraint is imposed. Then, on the basis of the Riccati inequality, sufficient conditions for synchronization-based guaranteed-performance formation are proposed, and an explicit expression of the guaranteed-performance cost is shown, where it is fully distributed to design gain matrices of the formation protocol in the sense that it is independent of global information of swarm systems. Moreover, the whole motion of a swarm system is determined, which is associated with initial states of all agents and formation control vectors. Finally, two numerical examples are shown to demonstrate theoretical conclusions, where the static whole motion and the dynamic whole motion are considered, respectively.

Dang, Hongtao↗
DOE OSTI2025

Counterdiabatic Driving with Performance Guarantees

Counterdiabatic (CD) driving has the potential to speed up adiabatic quantum state preparation by suppressing unwanted excitations. However, existing approaches either require intractable classical computations or are based on approximations that do not have performance guarantees. We propose and analyze a nonvariational, system-agnostic CD expansion method and analytically show that it converges exponentially quickly in the expansion order. In finite systems, the required resources scale inversely with the spectral gap, which we argue is asymptotically optimal. To extend our method to the thermodynamic limit and suppress errors stemming from high-frequency transitions, we leverage finite-time adiabatic protocols. In particular, we show that a time determined by the quantum speed limit is sufficient to prepare the desired ground state, without the need to optimize the adiabatic trajectory. Numerical tests of our method on the quantum Ising chain show that our method can outperform state-of-the-art variational CD approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2010

MRAC Revisited: Guaranteed Performance with Reference Model Modification

This paper presents modification of the conventional model reference adaptive control (MRAC) architecture in order to achieve guaranteed transient performance both in the output and input signals of an uncertain system. The proposed modification is based on the tracking error feedback to the reference model. It is shown that approach guarantees tracking of a given command and the ideal control signal (one that would be designed if the system were known) not only asymptotically but also in transient by a proper selection of the error feedback gain. The method prevents generation of high frequency oscillations that are unavoidable in conventional MRAC systems for large adaptation rates. The provided design guideline makes it possible to track a reference command of any magnitude form any initial position without re-tuning. The benefits of the method are demonstrated in simulations.

Stepanyan, Vahram↗
DOE OSTI2025

Hybrid learning techniques for scientific data reduction with performance guarantees

The research initiatives supported by the U.S. Department of Energy (DOE) Grant DE-SC0022265 are fundamentally aimed at pioneering advanced machine learning (ML) techniques for scientific data compression within high-performance computing (HPC) environments. This comprehensive body of work addresses the critical challenge posed by the exponential growth of data generated by scientific simulations in domains such as fusion energy, climate modeling, and computational fluid dynamics (CFD). A core objective is to develop compression algorithms that achieve substantial data reduction—often by orders of magnitude—while rigorously ensuring the fidelity of both the primary data (PD) and scientifically crucial derived quantities of interest (QoI). The methodologies deployed under this grant integrate sophisticated deep learning architectures, prominently featuring autoencoders, advanced generative models like conditional diffusion, and hybrid learning techniques. Key innovations include the development of Guaranteed Autoencoders (GAE) and the Guaranteed Conditional Diffusion with Tensor Correction (GCDTC) framework, which provide explicit, instance-level error bounds on reconstructed data. Furthermore, specialized strategies such as nonlinear constraint satisfaction are employed to preserve the integrity of QoI, a vital requirement for the trustworthiness of downstream scientific analyses. This research also focuses on the design and implementation of scalable, GPU-accelerated software pipelines that seamlessly integrate into existing HPC workflows, ensuring both computational efficiency and practical applicability. The CAESAR framework, for example, unifies foundation and generative models to create an adaptive and efficient compression solution for spatio-temporal scientific data. Collectively, these efforts represent a significant advancement in mitigating the scientific data deluge, enabling more effective data management, accelerated scientific discovery, and optimized utilization of HPC resources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs

The quantum approximate optimization algorithm (QAOA) is a near-term combinatorial optimization algorithm suitable for noisy quantum devices. However, little is known about performance guarantees for p > 2. A recent work computing MaxCut performance guarantees for 3-regular graphs conjectures that any d-regular graph evaluated at particular fixed angles has an approximation ratio greater than some worst-case guarantee. In this work, we provide numerical evidence for this fixed angle conjecture for p < 12. We compute and provide these angles via numerical optimization and tensor networks. These fixed angles serve for an optimization-free version of QAOA and have universally good performance on any 3-regular graph. Heuristic evidence is presented for the fixed angle conjecture on graph ensembles, which suggests that these fixed angles are "close" to global optimum. Under the fixed angle conjecture, QAOA has a larger performance guarantee than the Goemans Williamson algorithm on 3-regular graphs for p >= 11.

Wurtz, Jonathan↗
DOE OSTI2022

Online distributed price-based control of DR resources with competitive guarantees

Demand response (DR) of building HVAC load can provide crucial demand-side flexibility for the future smart grid. Compared to direct load control, price-based control can respect the customers’ autonomy and privacy. However, it is challenging for price-based control to attain provable performance guarantees under future uncertainty. In this paper, we propose a framework for a utility to perform price-based control of flexible building load within the utility’s service area, in order to attain competitive performance guarantees in terms of controlling the system peak demand under future uncertainty. By adopting a two-step approach, our online price-based control solution can attain a provable competitive ratio for all possible realizations within a given uncertainty set. Simulation experiments demonstrate that, with a robustification procedure, our solution can perform well not only for worst-case inputs, but also for average-case inputs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2016

B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys

Most B-tree articles assume that all $\textit{N}$ keys have the same size $\textit{K}$, that $\textit{f = B/K}$ keys fit in a disk block, and therefore that the search cost is $O(\text{log}_{f+1}N) $ block transfers. When keys have variable size, B-tree operations have no nontrivial performance guarantees, however. This article provides B-tree-like performance guarantees on dictionaries that contain keys of different sizes in a model in which keys must be stored and compared as opaque objects. The resulting atomic-key dictionaries exhibit performance bounds in terms of the average key size and match the bounds when all keys are the same size. Atomic-key dictionaries can be built with minimal modification to the B-tree structure, simply by choosing the pivot keys properly. Further, this article describes both static and dynamic atomic-key dictionaries. In the static case, if there are $\textit{N}$ keys with average size $\textit{K}$, the search cost is $O(\lceil K/B\rceil \text{log}_{1 + \lceil K/B\rceil} N)$ expected transfers. It is not possible to transform these expected bounds into worst-case bounds. The cost to build the tree is $\textit{O(NK)}$ operations and $\textit{O(NK/B)}$ transfers if all keys are presented in sorted order. If not, the cost is the sorting cost. For the dynamic dictionaries, the amortized cost to insert a key $\textit{κ}$ of arbitrary length at an arbitrary rank is dominated by the cost to search for $\textit{κ}$. Specifically, the amortized cost to insert a key $\textit{κ}$ of arbitrary length and random rank is $O(\lceil K/B\rceil log_{1+ \lceil B/K\rceil } N + |κ|/B)$ transfers. A dynamic-programming algorithm is shown for constructing a search tree with minimal expected cost. This article also gives a cache-oblivious static atomic-key B-tree, which achieves the same asymptotic performance as the static B-tree dictionary, mentioned previously. A cache-oblivious data structure or algorithm is not parameterized by the block size $\textit{B}$ or memory size $\textit{M}$ in the memory hierarchy; rather, it is universal, working simultaneously for all possible values of $\textit{B}$ or $\textit{M}$. On a machine with block size $\textit{B}$, if there are $\textit{N}$ keys with average size $\textit{K}$, search operations costs $O(\lceil K/B \rceil log_{1+ \lceil B/K \rceil} N)$ block transfers in expectation. This cache-oblivious layout can be built in $\textit{O(N}\text{log}\textit{(NK))}$ processor operations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Challenge Online Time Series Clustering For Demand Response A Theory to Break the ‘Curse of Dimensionality'

The advent of smart meters and advanced communication infrastructures catalyzes numerous smart grid applications such as dynamic demand response, and paves the way to solve challenging research problems in sustainable energy consumption. The space of solution possibilities are restricted primarily by the huge amount of generated data requiring considerable computational resources and efficient algorithms. To overcome this Big Data challenge, data clustering techniques have been proposed. Current approaches however do not scale in the face of the “increasing dimensionality” problem where a cluster point is represented by the entire customer consumption time series. To overcome this aspect we first rethink the way cluster points are created and designed, and then design an efficient online clustering technique for demand response (DR) in order to analyze high volume, high dimensional energy consumption time series data at scale, and on the fly. Our online algorithm is randomized in nature, and provides optimal performance guarantees in a computationally efficient manner. Unlike prior work we (i) study the consumption properties of the whole population simultaneously rather than developing individual models for each customer separately, claiming it to be a ‘killer’ approach that breaks the “curse of dimensionality” in online time series clustering, and (ii) provide tight performance guarantees in theory to validate our approach. Our insights are driven by the field of sociology, where collective behavior often emerges as the result of individual patterns and lifestyles.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2016

Comfort in High-Performance Homes in a Hot-Humid Climate

"9IBACOS monitored 37 homes during the late summer and early fall of 2014 in a hot and humid climate to better understand indoor comfort conditions. These homes were constructed in the last several years by four home builders that offered a comfort and performance guarantee for the homes. The homes were located in one of four cities: Tampa, Florida; Orlando, Florida; Houston, Texas; and San Antonio, Texas. Temperature and humidity data were collected from the thermostat and each room of the house using small, battery-powered data loggers. To understand system runtime and its impact on comfort, supply air temperature also was measured on a 1-minute interval. Overall, the group of homes only exceeded a room-to-room temperature difference of 6 degrees F for 5% of the time. For 80% of the time, the rooms in each house were within 4 degrees F of each other. Additionally, the impact of system runtime on comfort is discussed. Finally, measurements made at the thermostat were used to better understand the occupant operation of each cooling system's thermostat setpoint. Builders were questioned on their perceived impact of offering a comfort and performance guarantee. Their feedback, which generally indicates a positive perception, has been summarized in the report.

"9residential↗
NASA NTRS2007

Guaranteeing Pointing Performance of the SDO Sun-Pointing Controllers in Light of Nonlinear Effects

The Solar Dynamics Observatory (SDO) mission is the first Space Weather Research Network mission, part of NASA s Living With a Star program.1 This program seeks to understand the changing Sun and its effects on the Solar System, life, and society. To this end, the SDO spacecraft will carry three Sun-observing instruments to geosynchronous orbit: Helioseismic and Magnetic Imager (HMI), led by Stanford University; Atmospheric Imaging Assembly (AIA), led by Lockheed Martin Space and Astrophysics Laboratory; and Extreme Ultraviolet Variability Experiment (EVE), led by the University of Colorado. Links describing the instruments in detail may be found through the SDO web site.2 The basic mission goals are to observe the Sun for a very high percentage of the 5-year mission (10-year goal) with long stretches of uninterrupted observations and with constant, high-data-rate transmission to a dedicated ground station. These goals guided the design of the spacecraft bus that will carry and service the three-instrument payload. At the time of this publication, the SDO spacecraft bus is well into the integration and testing phase at the NASA Goddard Space Flight Center (GSFC). A three-axis stabilized attitude control system (ACS) is needed both to point at the Sun accurately and to keep the roll about the Sun vector correctly positioned. The ACS has four reaction wheel modes and 2 thruster actuated modes. More details about the ACS in general and the control modes in particular can be found in Refs. [3-6]. All four of SDO s wheel-actuated control modes involve Sun-pointing controllers, as might be expected from such a mission. Science mode, during which most science data is collected, uses specialized guide telescopes to point accurately at the Sun. Inertial mode has two sub-modes, one tracks a Sun-referenced target orientation, and another maintains an absolute (star-referenced) target orientation, that both employ a Kalman filter to process data from a digital Sun sensor and two star trackers. However, this paper is concerned only with the other two modes: Safe Hold (SH) and Sun Acquisition (SA).

Starin, Scott R.↗
DOE OSTI2013

Analysis of Photovoltaic System Energy Performance Evaluation Method

Documentation of the energy yield of a large photovoltaic (PV) system over a substantial period can be useful to measure a performance guarantee, as an assessment of the health of the system, for verification of a performance model to then be applied to a new system, or for a variety of other purposes. Although the measurement of this performance metric might appear to be straight forward, there are a number of subtleties associated with variations in weather and imperfect data collection that complicate the determination and data analysis. A performance assessment is most valuable when it is completed with a very low uncertainty and when the subtleties are systematically addressed, yet currently no standard exists to guide this process. This report summarizes a draft methodology for an Energy Performance Evaluation Method, the philosophy behind the draft method, and the lessons that were learned by implementing the method.

14 SOLAR ENERGY↗
NASA NTRS2012

One Engine Inoperative (OEI) and Autorotation For Heavy Lift Rotorcraft Systems

Federal Aviation Administration will certainly require the Heavy Lift Rotorcraft to be operated under Category A performance and operations requirements. Because of the weight, no operation will be allowed except Category A according to FAA Part 29.1(c). This means that any where along the flight path, the aircraft must be able to land safely following an engine failure or continue flight. A repeatable flight profile must be developed and executed to ensure that the aircraft can be safely landed or flown away depending on its location on the flight profile. This means that there will be no Height-Velocity testing required as is currently required for Part 29 Category B. Since all the configurations shown to date are different than existing rotorcraft, each type would have to develop their individual requirements under existing special conditions FAA Part 21.17(b). This means the FAA will take the opportunity to negotiate additional requirements or change requirements to ensure safety. For example, since the tiltrotor did not fit normal rotorcraft category, new rules were negotiated between the applicant and the FAA. As a result of this negotiation, performance requirements for Category A were increased. The rules were written in terms of guaranteed performance instead of Category A requirements. Detailed discussion will follow later. The proposed tiltrotor would likely follow along with the current tiltrotor rules with the possibility of increase Category A performance requirements. Compounding with addition of wing and auxiliary thrust to both the tandem and coaxial rotor would result in new special condition aircraft. To my knowledge, no compound tandem or compound coaxial rotor has ever been certified by FAA.

Wood, Tom↗
DOE OSTI2016

Fault-tolerant bandwidth reservation strategies for data transfers in high-performance networks

Many next-generation e-science applications need fast and reliable transfer of large volumes of data with guaranteed performance, which is typically enabled by the bandwidth reservation service in high-performance networks. One prominent issue in such network environments with large footprints is that node and link failures are inevitable, hence potentially degrading the quality of data transfer. We consider two generic types of bandwidth reservation requests (BRRs) concerning data transfer reliability: (i) to achieve the highest data transfer reliability under a given data transfer deadline, and (ii) to achieve the earliest data transfer completion time while satisfying a given data transfer reliability requirement. We propose two periodic bandwidth reservation algorithms with rigorous optimality proofs to optimize the scheduling of individual BRRs within BRR batches. The efficacy of the proposed algorithms is illustrated through extensive simulations in comparison with scheduling algorithms widely adopted in production networks in terms of various performance metrics.

97 MATHEMATICS AND COMPUTING↗