Search NASASearch

SEARCH · Search NASA

Results for “distributionally robust”

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 37 records · Page 2

Multi-Timescale Optimal Operation Framework for Integrated Economic and Reliability Analysis of Hybrid Power Plants

This paper introduces a hierarchical modeling framework for hybrid power plants (HPP) to facilitate the operation of HPP in power systems similar to conventional generators (Congens) in the integrated multi-timescale optimal operation framework. To consider the uncertainties of HPP renewable power in the day-ahead scheduling, distributionally robust optimization (DRO) is used. To ensure that the state-of-charge (SOC) of energy storage systems in HPPs aligns closely with the planned value for long-term reliability, real-time SOC management is incorporated. In addition, an adjustable real-time control is designed for the robust delivery of HPP real-time services. Case studies performed on a revised IEEE 39-bus system demonstrate the effectiveness of the proposed framework for HPP operation. Simulation results highlight that the proposed framework not only can help operators schedule HPP similar to Congens in varying weather conditions but can also maintain the frequency reliability of the system.

frequency stability

Physics vs structure: A systematic benchmark of learning strategies for multi-zone building thermal dynamics

Recent advances in physics-informed and data-driven machine learning promise improved thermal models for advanced building control, yet there is limited quantitative evidence on when added physics structure and architectural complexity are beneficial. Here, this work presents a systematic benchmark of five representative system identification methods for modeling multi-zone building thermal dynamics: linear state-space models, multi-layer perceptrons, neural state-space models, neural ordinary differential equations, and physically-consistent neural networks. The methods are evaluated across multiple data regimes and zone coupling strategies. Using a high-fidelity multi-zone commercial building emulator, we examine short-term and long-term prediction accuracy, computational efficiency, and ease of development. Our results reveal critical trade-offs between prediction performance, model complexity, and physical consistency. We demonstrate that decoupled, nonlinear black-box models consistently outperform coupled physics-constrained architectures in both predictive accuracy and out-of-distribution robustness in majority of the test cases for the building type considered in the study. Our findings quantify the cost of complexity in building thermal modeling and provide concrete, actionable, scenario-based guidelines for selecting model classes for control-oriented applications.

Building thermal modeling

Optimization problems governed by systems of PDEs with uncertainties

This paper reviews current theoretical and numerical approaches to optimization problems governed by partial differential equations (PDEs) that depend on random variables or random fields. Such problems arise in many engineering, science, economics and societal decision-making tasks. This paper focuses on problems in which the governing PDEs are parametrized by the random variables/fields, and the decisions are made at the beginning and are not revised once uncertainty is revealed. Examples of such problems are presented to motivate the topic of this paper, and to illustrate the impact of different ways to model uncertainty in the formulations of the optimization problem and their impact on the solution. A linear–quadratic elliptic optimal control problem is used to provide a detailed discussion of the set-up for the risk-neutral optimization problem formulation, study the existence and characterization of its solution, and survey numerical methods for computing it. Different ways to model uncertainty in the PDE-constrained optimization problem are surveyed in an abstract setting, including risk measures, distributionally robust optimization formulations, probabilistic functions and chance constraints, and stochastic orders. Furthermore, approximation-based optimization approaches and stochastic methods for the solution of the large-scale PDE-constrained optimization problems under uncertainty are described. Some possible future research directions are outlined.

Heinkenschloss, Matthias [Rice Univ., Houston, TX

Advanced Computational Techniques for Improving Resilience of Critical Energy Infrastructure under Cyber-Physical Attacks

In this chapter, we present recent advances in improving the resilience of cyber-physical systems, especially with regards to energy systems. We provide discussions around various types of cyber-physical events that can cause disruptions and new advances in optimization, control, and reinforcement learning (RL) to deal with the challenges posed by such cyber-physical events. The presented methods range from distributed robust optimization, autonomous and coordinated control, reinforcement learning based resilient control and topology reconfiguration in Inter-System resilient control.

Nazir, Mohammad Nawaf [BATTELLE (PACIFIC NW LAB)]

ISIS and META projects

The ISIS project has developed a new methodology, virtual synchony, for writing robust distributed software. High performance multicast, large scale applications, and wide area networks are the focus of interest. Several interesting applications that exploit the strengths of ISIS, including an NFS-compatible replicated file system, are being developed. The META project is distributed control in a soft real-time environment incorporating feedback. This domain encompasses examples as diverse as monitoring inventory and consumption on a factory floor, and performing load-balancing on a distributed computing system. One of the first uses of META is for distributed application management: the tasks of configuring a distributed program, dynamically adapting to failures, and monitoring its performance. Recent progress and current plans are reported.

Birman, Kenneth

Providing Effective Access to Shared Resources: A COIN Approach

Managers of systems of shared resources typically have many separate goals. Examples are efficient utilization of the resources among its users and ensuring no user's satisfaction in the system falls below a preset minimal level. Since such goals will usually conflict with one another, either implicitly or explicitly the manager must determine the relative importance of the goals, encapsulating that into an overall utility function rating the possible behaviors of the entire system. Here we demonstrate a distributed, robust, and adaptive way to optimize that overall function. Our approach is to interpose adaptive agents between each user and the system, where each such agent is working to maximize its own private utility function. In turn, each such agent's function should be both relatively easy for the agent to learn to optimize, and 'aligned' with the overall utility function of the system manager - an overall function that is based on but in general different from the satisfaction functions of the individual users. To ensure this we enhance the COllective INtelligence (COIN) framework to incorporate user satisfaction functions in the overall utility function of the system manager and accordingly in the associated private utility functions assigned to the users agents. We present experimental evaluations of different COIN-based private utility functions and demonstrate that those COIN-based functions outperform some natural alternatives.

Airiau, Stephane

Providing Effective Access to Shared Resources: A COIN Approach

Managers of systems of shared resources typically have many separate goals. Examples are efficient utilization of the resources among its users and ensuring no user s satisfaction in the system falls below a preset minimal level. Since such goals will usually conflict with one another, either implicitly or explicitly the manager must determine the relative importance of the goals, encapsulating that into an overall utility function rating the possible behaviors of the entire system. Here we demonstrate a distributed, robust, and adaptive way to optimize that overall function. Our approach is to interpose adaptive agents between each user and the system, where each such agent is working to maximize its own private utility function. In turn, each such agent's function should be both relatively easy for the agent to learn to optimize, and "aligned" with the overall utility function of the system manager - an overall function that is based on but in general different from the satisfaction functions of the individual users. To ensure this we enhance the Collective INtelligence (COIN) framework to incorporate user satisfaction functions in the overall utility function of the system manager and accordingly in the associated private utility functions assigned to the users agents. We present experimental evaluations of different COIN-based private utility functions and demonstrate that those COIN-based functions outperform some natural alternatives.

Airiau, Stephane

Plan for the Characterization of HIRF Effects on a Fault-Tolerant Computer Communication System

This report presents the plan for the characterization of the effects of high intensity radiated fields on a prototype implementation of a fault-tolerant data communication system. Various configurations of the communication system will be tested. The prototype system is implemented using off-the-shelf devices. The system will be tested in a closed-loop configuration with extensive real-time monitoring. This test is intended to generate data suitable for the design of avionics health management systems, as well as redundancy management mechanisms and policies for robust distributed processing architectures.

Torres-Pomales, Wilfredo

Robonaut 2 - The First Humanoid Robot in Space

NASA and General Motors have developed the second generation Robonaut, Robonaut 2 or R2, and it is scheduled to arrive on the International Space Station in late 2010 and undergo initial testing in early 2011. This state of the art, dexterous, anthropomorphic robotic torso has significant technical improvements over its predecessor making it a far more valuable tool for astronauts. Upgrades include: increased force sensing, greater range of motion, higher bandwidth and improved dexterity. R2 s integrated mechatronics design results in a more compact and robust distributed control system with a faction of the wiring of the original Robonaut. Modularity is prevalent throughout the hardware and software along with innovative and layered approaches for sensing and control. The most important aspects of the Robonaut philosophy are clearly present in this latest model s ability to allow comfortable human interaction and in its design to perform significant work using the same hardware and interfaces used by people. The following describes the mechanisms, integrated electronics, control strategies and user interface that make R2 a promising addition to the Space Station and other environments where humanoid robots can assist people.

Diftler, M. A.

Constraining Dark Matter Models from a Combined Analysis of Milky Way Satellites with the Fermi Large Area Telescope

Satellite galaxies of the Milky Way are among the most promising targets for dark matter searches in gamma rays. We present a search for dark matter consisting of weakly interacting massive particles, applying a joint likelihood analysis to 10 satellite galaxies with 24 months of data of the Fermi Large Area Telescope. No dark matter signal is detected. Including the uncertainty in the dark matter distribution, robust upper limits are placed on dark matter annihilation cross sections. The 95% confidence level upper limits range from about 10(exp -26) cm(exp 3) / s at 5 GeV to about 5 X 10(exp -23) cm(exp 3)/ s at 1 TeV, depending on the dark matter annihilation final state. For the first time, using gamma rays, we are able to rule out models with the most generic cross section (approx 3 X 10(exp -26) cm(exp 3)/s for a purely s-wave cross section), without assuming additional boost factors.

Ackermann, M.

Spindle-shaped Microstructures: Potential Models for Planktonic Life Forms on Other Worlds

Spindle-shaped, organic microstructures ("spindles") are now known from Archean cherts in three localities (Figs. 1-4): The ~3 Ga Farrel Quartzite from the Pilbara of Australia [1]; the older, ~3.3-3.4 Ga Strelley Pool Formation, also from the Pilbara of Australia [2]; and the ~3.4 Ga Kromberg Formation of the Barberton Mountain Land of South Africa [3]. Though the spindles were previously speculated to be pseudofossils or epigenetic organic contaminants, a growing body of data suggests that these structures are bona fide microfossils and further, that they are syngenetic with the Archean cherts in which they occur [1-2, 4-10]. As such, the spindles are among some of the oldest-known organically preserved microfossils on Earth. Moreover, recent delta C-13 study of individual spindles from the Farrel Quartzite (using Secondary Ion Mass Spectrometry [SIMS]) suggests that the spindles may have been planktonic (living in open water), as opposed to benthic (living as bottom dwellers in contact with muds or sediments) [9]. Since most Precambrian microbiotas have been described from benthic, matforming communities, a planktonic lifestyle for the spindles suggests that these structures could represent a segment of the Archean biosphere that is poorly known. Here we synthesize the recent work on the spindles, and we add new observations regarding their geographic distribution, robustness, planktonic habit, and long-lived success. We then discuss their potential evolutionary and astrobiological significance.

Oehler, Dorothy Z.

Recent advances in control of nonlinear and distributed parameter systems, robust control, and aerospace control applications; Proceedings of the Symposium, ASME Winter Annual Meeting, Chicago, IL, Nov. 27-Dec. 2, 1988

Papers are presented on the control of distributed parameter systems using the coprime factorization approach, a hierarchy of geometrically exact models of rotating beams, and the temperature stability of a flux modulated radiant slab. Also considered are a network representation for robots, recovery from controller bounding, and the design of controllers for robust tracking and model following. Other topics include an active control law synthesis for flexible aircraft, the low-order control of large aerospsace structures using residual model filters, and a comparison of component cost methods for component model reduction.

Bentsman, Joseph

Robustness of a distributed neural network controller for locomotion in a hexapod robot

A distributed neural-network controller for locomotion, based on insect neurobiology, has been used to control a hexapod robot. How robust is this controller? Disabling any single sensor, effector, or central component did not prevent the robot from walking. Furthermore, statically stable gaits could be established using either sensor input or central connections. Thus, a complex interplay between central neural elements and sensor inputs is responsible for the robustness of the controller and its ability to generate a continuous range of gaits. These results suggest that biologically inspired neural-network controllers may be a robust method for robotic control.

Chiel, Hillel J.

Semigroup approximation and robust stabilization of distributed parameter systems

Theoretical results that enable rigorous statements of convergence and exponential stability of Galerkin approximations of LQR controls for infinite dimensional, or distributed parameter, systems have proliferated over the past ten years. In addition, extensive progress has been made over the same time period in the derivation of robust control design strategies for finite dimensional systems. However, the study of the convergence of robust finite dimensional controllers to robust controllers for infinite dimensional systems remains an active area of research. We consider a class of soft-constrained differential games evolving in a Hilbert space. Under certain conditions, a saddle point control can be given in feedback form in terms of a solution to a Riccati equation. By considering a related LQR problem, we can show a convergence result for finite dimensional approximations of this differential game. This yields a computational algorithm for the feedback gain that can be derived from similar strategies employed in infinite dimensional LQR control design problems. The approach described in this paper also inherits the additional properties of stability robustness common to game theoretic methods in finite dimensional analysis. These theoretical convergence and stability results are verified in several numerical experiments.

Kurdila, A. J.

Robust design of distributed controllers for large flexible space structures

Independent Modal Space Control (IMSC) method avoids control spillover generated by conventional control schemes such as Coupled Modal Control by decoupling the large flexible space structure into independent subsystems of second order and controlling each mode independently. The IMSC implementation requires that the number of actuators be equal to that of modeled modes, which is in general very huge. Consequently the number of required actuators is unrealizable. Two methods are proposed for the implementation of IMSC with reduced number of actuators. In the first method, the first m modes are optimized, leaving the last (n-m) modes unchanged. In the second method, generalized inverse matrices are employed to design the feedback controller so that the control scheme is suboptimal with respect to IMSC. The performance of the proposed methods is tested by performing computer simulation on a simply support beam. Simulation results are presented and discussed.

Nguyen, Charles C.

The Raid distributed database system

Raid, a robust and adaptable distributed database system for transaction processing (TP), is described. Raid is a message-passing system, with server processes on each site to manage concurrent processing, consistent replicated copies during site failures, and atomic distributed commitment. A high-level layered communications package provides a clean location-independent interface between servers. The latest design of the package delivers messages via shared memory in a configuration with several servers linked into a single process. Raid provides the infrastructure to investigate various methods for supporting reliable distributed TP. Measurements on TP and server CPU time are presented, along with data from experiments on communications software, consistent replicated copy control during site failures, and concurrent distributed checkpointing. A software tool for evaluating the implementation of TP algorithms in an operating-system kernel is proposed.

Bhargava, Bharat

Taylor-Expansion-Based Robust Power Flow in Unbalanced Distribution Systems: A Hybrid Data-Aided Method

Traditional power flow methods often adopt certain assumptions designed for passive balanced distribution systems, thus lacking practicality for unbalanced operation. moreover, their computation accuracy and efficiency are heavily subject to unknown errors and bad data in measurements or prediction data of distributed energy resources (ders). to address these issues, this paper proposes a hybrid data-aided robust power flow algorithm in unbalanced distribution systems, which combines taylor series expansion knowledge with a data-driven regression technique. the proposed method initiates a linearization power flow model to derive an explicitly analytical solution by modified taylor expansion. to mitigate the approximation loss that surges due to the der integration and bad data, we further develop a data-aided robust support vector regression approach to estimate the errors efficiently. comparative analysis in the 13-bus and 123-bus ieee unbalanced feeders shows that the proposed hybrid algorithm achieves superior computational efficiency, with guaranteed accuracy and robustness against outliers.

data-driven

On the connection between least squares, regularization, and classical shadows

Classical shadows (CS) offer a resource-efficient means to estimate quantum observables, circumventing the need for exhaustive state tomography. Here, we clarify and explore the connection between CS techniques and least squares (LS) and regularized least squares (RLS) methods commonly used in machine learning and data analysis. By formal identification of LS and RLS ``shadows'' completely analogous to those in CS---namely, point estimators calculated from the empirical frequencies of single measurements---we show that both RLS and CS can be viewed as regularizers for the underdetermined regime, replacing the pseudoinverse with invertible alternatives. Through numerical simulations, we evaluate RLS and CS from three distinct angles: the tradeoff in bias and variance, mismatch between the expected and actual measurement distributions, and the interplay between the number of measurements and number of shots per measurement. Compared to CS, RLS attains lower variance at the expense of bias, is robust to distribution mismatch, and is more sensitive to the number of shots for a fixed number of state copies---differences that can be understood from the distinct approaches taken to regularization. Conceptually, our integration of LS, RLS, and CS under a unifying ``shadow'' umbrella aids in advancing the overall picture of CS techniques, while practically our results highlight the tradeoffs intrinsic to these measurement approaches, illuminating the circumstances under which either RLS or CS would be preferred, such as unverified randomness for the former or unbiased estimation for the latter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC