Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time-varying 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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A Two-Stage Approach for PV Inverter Engagement in Power Factor Correction and Voltage Regulation

The rapid integration of distributed energy resources, like solar photovoltaics (PVs), can lead to overvolt-age challenges due to reverse power flow and a noticeable decrease in power factor at the substation interface. While existing literature extensively explores utilizing smart inverter capabilities for reactive power flexibility using a volt-var curve (VVC), obtaining time-varying operating points of such curves in real-time is challenging due to computational demands and communication requirements. Similarly, employing optimization-based approaches for reactive power control and active voltage regulation in large-scale distribution feeders is difficult due to the complexity of the problem and the challenges in effectively engaging customer-owned resources. This paper proposes a two-stage strategy to harness smart inverters for reactive power support. The first stage formulates short-term planning by optimally designing VVCs (on a daily or hourly basis) for large-scale solar PVs based on projected system needs and communicating optimal curves to smart inverters in advance. Subsequently, the second stage employs a transactive-based method to involve customer-owned PVs for reactive power support, effectively enhancing overall system performance and addressing real-time demands. In conclusion, the efficacy of this approach will be demonstrated using real-world distribution circuits provided by Vermont Electric Power Company (VELCO) and Vermont Electric Cooperative (VEC).

Poudel, Shiva [Pacific Northwest National Laborato↗
DOE OSTI2025

Data-Driven Mean-Corrected Recursive Estimation-Based Optimal DER Dispatch for Distribution System Voltage Control

Recent advances in smart inverters offer opportunities to mitigate adverse grid impacts caused by high penetrations of distributed photovoltaics (PV) in distribution grids, such as voltage violations. Here, this paper proposes a novel measurement-driven optimal power flow (OPF)-based distributed energy resource management system (DERMS) voltage regulation via recursive sensitivity estimation informed coordinated control of distributed PV inverters. The proposed approach leverages available grid and controllable DER measurements, eliminating reliance on system model information while being adaptive and robust to volatile operating conditions. A mean-corrected recursive ridge regression (MCRRR) algorithm is proposed for sensitivity estimation, continuously refining the sensitivity model through a closed-form solution. It effectively manages varying grid operating conditions, such as changes in power injections and topology reconfiguration, to facilitate a time-varying update of the Load Sensitivity Factors (LSF). The proposed approach is formulated as a linear programming (LP) problem and is thus scalable to larger-scale distribution systems. Its effectiveness and efficiency are demonstrated on a realistic distribution feeder with high PV penetrations in Southern California, USA.

14 SOLAR ENERGY↗
DOE OSTI2025

Fast Adaptive Neural Control of Resonant Extraction at Fermilab

We present the development of a machine learning (ML) based regulation system for third-order resonant beam extraction in the Mu2e experiment at Fermilab. Classical and ML-based controllers have been optimized using semi-analytic simulations and evaluated in terms of regulation performance and training efficiency. We compare several controller architectures and discuss the integration of neural control into an adaptive framework. We also present progress on surrogate models that predict the controller response given a spill intensity and controller action history. To enable real-time deployment, we report progress on implementing low-latency, edge-based inference suitable for hardware-constrained environments. Our results demonstrate the feasibility and advantages of ML-based control in managing complex, time-varying physical systems, with broader implications for accelerator operations and other domains requiring fast, adaptive regulation.

Berlioz, Jose Rene [Fermilab]↗
NASA NTRS1984

Response of large space structures with stiffness control

For large space structures, such as the 100-meter-diameter wrap-rib deployable antenna and spinning solar sail, whose out-of-plane stiffness is derived from in-plane tension, the out-of-plane motion can be actively controlled by time-varying in-plane tension. An elastic string is used to demonstrate the proposed approach, which results in a nonlinear ordinary differential equation. An approximation method is outlined from which the magnitude of time-varying tension can be determined based on the efficiency factor, the time factor or the optimal factor.

Chen, J.-C.↗
NASA NTRS1986

Reduced conservatism in stability robustness bounds by state transformation

This note addresses the issue of 'conservatism' in the time domain stability robustness bounds obtained by the Liapunov approach. A state transformation is employed to improve the upper bounds on the linear time-varying perturbation of an asymptotically stable linear time-invariant system for robust stability. This improvement is due to the variance of the conservatism of the Liapunov approach with respect to the basis of the vector space in which the Liapunov function is constructed. Improved bounds are obtained, using a transformation, on elemental and vector norms of perturbations (i.e., structured perturbations) as well as on a matrix norm of perturbations (i.e., unstructured perturbations). For the case of a diagonal transformation, an algorithm is proposed to find the 'optimal' transformation. Several examples are presented to illustrate the proposed analysis.

Yedavalli, R. K.↗
NASA NTRS1989

An algorithm for the solution of dynamic linear programs

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Psiaki, Mark L.↗
NASA NTRS1990

Trajectory optimization for real-time guidance. I - Time-varying LQR on a parallel processor

A key algorithmic element of a real-time trajectory optimization hardware/software implementation, the quadratic program (QP) solver element, is presented. The purpose of the effort is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter. Many methods of nonlinear programming require the solution of a QP at each iteration. In the trajectory optimization case the QP has a special dynamic programming structure, a LQR-like structure. QP algorithm speed is increased by taking advantage of this special structure and by parallel implementation.

Psiaki, Mark L.↗
NASA NTRS1988

On-orbit parametric identification methodology

On-orbit system identification (ID) of large space systems is essential for various reasons. For example, the complex composite structure of such systems cannot be ground-tested; their structural dynamic characteristics must be known accurately in order to accomplish active control. Furthermore, such capability can be used to characterize/identify various disturbances. The identification process is consisted of four principal elements: (1) modeling, (2) the estimation algorithm, (3) input system, and (4) measurement system. These elements are highly correlated and all togerher determine the success of the identification problem. Accurate modeling of large space systems is the most important element of the identification process. Large flexible structures are non-linear and infinite dimensional systems with highly coupled parameters and low frequency packed modes. In addition, these systems are subject to stochastic and time-varying disturbances, they have structural parameters which can vary due to on-orbit assembly deployment, and operations. These systems are generally; however, represented by constant coefficient, finite order differential equations. The non-linearities, coupling and noise effects are also often neglected. Moreover, identification experiment designs which lead to highly complex optimization problems usually require the simultaneous choice of ID algorithm, sensor, and actuator type and placement. On-orbit bandwidth and power restrictions on excitation, limited data window, and restrictions on sensor/actuator type, placement and number, has led to practical questions of implementations.

Hadaegh, Fred Y.↗
NASA NTRS1994

Modeling tropical Pacific sea surface temperature with satellite-derived solar radiative forcing

Two independent datasets for the solar radiation at the surface derived from satellites are compared. The data derived from the Earth Radiation Budget Experiment (ERBE) is for the net solar radiation at the surface whereas the International Satellite Cloud Climatology Project (ISCCP) data is for the downward flux only and was corrected with a space- and time-varying albedo. The ISCCP net flux is at all times higher than the ERBE flux. The difference can be divided into an offset that decreases with latitude and another component that correlates with high tropical cloud cover. With this latter exception the two datasets provide spatial patterns of solar flux that are very similar. A tropical Pacific Ocean model is forced with these two datasets and observed climatological winds. The upward heat flux is parameterized taking into account separately the longwave radiative, latent, and sensible heat fluxes. Best fit values for the uncertain parameters are found using an optimization procedure that seeks to minimize the difference between model and observed SST by varying the parameters within a reasonable range of uncertainty. The SST field the model produces with the best fit parameters is the best the model can do. If the differences between the model and data are larger than can be accounted for by remaining uncertainties in the heat flux parameterization and forcing data then the ocean model must be held to be at fault. Using this method of analysis, a fundamental model fault is identified. Inadequate treatment of mixed layer/entrainment processes in upwelling regions of the eastern tropical Pacific leads to a large and seasonally varying error in the model SST. Elsewhere the model SST is insufficiently different from observed to be able to identify model errors.

Seager, Richard↗
NASA NTRS1997

A Parallel Pipelined Renderer for the Time-Varying Volume Data

This paper presents a strategy for efficiently rendering time-varying volume data sets on a distributed-memory parallel computer. Time-varying volume data take large storage space and visualizing them requires reading large files continuously or periodically throughout the course of the visualization process. Instead of using all the processors to collectively render one volume at a time, a pipelined rendering process is formed by partitioning processors into groups to render multiple volumes concurrently. In this way, the overall rendering time may be greatly reduced because the pipelined rendering tasks are overlapped with the I/O required to load each volume into a group of processors; moreover, parallelization overhead may be reduced as a result of partitioning the processors. We modify an existing parallel volume renderer to exploit various levels of rendering parallelism and to study how the partitioning of processors may lead to optimal rendering performance. Two factors which are important to the overall execution time are re-source utilization efficiency and pipeline startup latency. The optimal partitioning configuration is the one that balances these two factors. Tests on Intel Paragon computers show that in general optimal partitionings do exist for a given rendering task and result in 40-50% saving in overall rendering time.

Chiueh, Tzi-Cker↗
NASA NTRS1999

Integration of a Decentralized Linear-Quadratic-Gaussian Control into GSFC's Universal 3-D Autonomous Formation Flying Algorithm

A decentralized control is investigated for applicability to the autonomous formation flying control algorithm developed by GSFC for the New Millenium Program Earth Observer-1 (EO-1) mission. This decentralized framework has the following characteristics: The approach is non-hierarchical, and coordination by a central supervisor is not required; Detected failures degrade the system performance gracefully; Each node in the decentralized network processes only its own measurement data, in parallel with the other nodes; Although the total computational burden over the entire network is greater than it would be for a single, centralized controller, fewer computations are required locally at each node; Requirements for data transmission between nodes are limited to only the dimension of the control vector, at the cost of maintaining a local additional data vector. The data vector compresses all past measurement history from all the nodes into a single vector of the dimension of the state; and The approach is optimal with respect to standard cost functions. The current approach is valid for linear time-invariant systems only. Similar to the GSFC formation flying algorithm, the extension to linear LQG time-varying systems requires that each node propagate its filter covariance forward (navigation) and controller Riccati matrix backward (guidance) at each time step. Extension of the GSFC algorithm to non-linear systems can also be accomplished via linearization about a reference trajectory in the standard fashion, or linearization about the current state estimate as with the extended Kalman filter. To investigate the feasibility of the decentralized integration with the GSFC algorithm, an existing centralized LQG design for a single spacecraft orbit control problem is adapted to the decentralized framework while using the GSFC algorithm's state transition matrices and framework. The existing GSFC design uses both reference trajectories of each spacecraft in formation and by appropriate choice of coordinates and simplified measurement modeling is formulated as a linear time-invariant system. Results for improvements to the GSFC algorithm and a multiple satellite formation will be addressed. The goal of this investigation is to progressively relax the assumptions that result in linear time-invariance, ultimately to the point of linearization of the non-linear dynamics about the current state estimate as in the extended Kalman filter. An assessment will then be made about the feasibility of the decentralized approach to the realistic formation flying application of the EO-1/Landsat 7 formation flying experiment.

Folta, David C.↗
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 NTRS1998

Isosurface Extraction in Time-Varying Fields Using a Temporal Hierarchical Index Tree

Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to large-scale time-varying fields, the storage overhead incurred from storing the search index often becomes overwhelming. this paper proposes an algorithm for locating isosurface cells in time-varying fields. We devise a new data structure, called Temporal Hierarchical Index Tree, which utilizes the temporal coherence that exists in a time-varying field and adoptively coalesces the cells' extreme values over time; the resulting extreme values are then used to create the isosurface cell search index. For a typical time-varying scalar data set, not only does this temporal hierarchical index tree require much less storage space, but also the amount of I/O required to access the indices from the disk at different time steps is substantially reduced. We illustrate the utility and speed of our algorithm with data from several large-scale time-varying CID simulations. Our algorithm can achieve more than 80% of disk-space savings when compared with the existing techniques, while the isosurface extraction time is nearly optimal.

Shen, Han-Wei↗
NASA NTRS2009

Using Covariance Analysis to Assess Pointing Performance

A Pointing Covariance Analysis Tool (PCAT) has been developed for evaluating the expected performance of the pointing control system for NASA s Space Interferometry Mission (SIM). The SIM pointing control system is very complex, consisting of multiple feedback and feedforward loops, and operating with multiple latencies and data rates. The SIM pointing problem is particularly challenging due to the effects of thermomechanical drifts in concert with the long camera exposures needed to image dim stars. Other pointing error sources include sensor noises, mechanical vibrations, and errors in the feedforward signals. PCAT models the effects of finite camera exposures and all other error sources using linear system elements. This allows the pointing analysis to be performed using linear covariance analysis. PCAT propagates the error covariance using a Lyapunov equation associated with time-varying discrete and continuous-time system matrices. Unlike Monte Carlo analysis, which could involve thousands of computational runs for a single assessment, the PCAT analysis performs the same assessment in a single run. This capability facilitates the analysis of parametric studies, design trades, and "what-if" scenarios for quickly evaluating and optimizing the control system architecture and design.

Bayard, David↗
NASA NTRS2010

NASA Tech Briefs, November 2010

Topics covered include: Portable Handheld Optical Window Inspection Device; Salience Assignment for Multiple-Instance Data and Its Application to Crop Yield Prediction; Speech Acquisition and Automatic Speech Recognition for Integrated Spacesuit Audio Systems ; Predicting Long-Range Traversability from Short-Range Stereo-Derived Geometry; Browser-Based Application for Telemetry Monitoring of Robotic Assets; Miniature Low-Noise G-Band I-Q Receiver; Methods of Using a Magnetic Field Response Sensor Within Closed, Electrically Conductive Containers; Differential Resonant Ring YIG Tuned Oscillator; Microfabricated Segmented-Involute-Foil Regenerator for Stirling Engines; Reducing Seal Adhesion in Low Impact Docking Systems; Optimal Flow Control Design; Corrosion-Resistant Container for Molten-Material Processing; Reusable Hot-Wire Cable Cutter; Deployment of a Curved Truss; High-Volume Airborne Fluids Handling Technologies to Fight Wildfires; Modeling of Alkane Oxidation Using Constituents and Species; Fabrication of Lanthanum Telluride 14-1-11 Zintl High-Temperature Thermoelectric Couple; A Computer Model for Analyzing Volatile Removal Assembly; Analysis of Nozzle Jet Plume Effects on Sonic Boom Signature; Optical Sidebands Multiplier; Single Spatial-Mode Room-Temperature-Operated 3.0 to 3.4 micrometer Diode Lasers; Self-Nulling Beam Combiner Using No External Phase Inverter; Portable Dew Point Mass Spectrometry System for Real-Time Gas and Moisture Analysis; Maximum Likelihood Time-of-Arrival Estimation of Optical Pulses via Photon-Counting Photodetectors; Handheld White Light Interferometer for Measuring Defect Depth in Windows; Decomposition Algorithm for Global Reachability on a Time-Varying Graph; Autonomous GN and C for Spacecraft Exploration of Comets and Asteroids; Efficient Web Services Policy Combination; Using CTX Image Features to Predict HiRISE-Equivalent Rock Density; Isolation of the Paenibacillus phoenicis, a Spore-Forming Bacterium; Monolithically Integrated, Mechanically Resilient Carbon-Based Probes for Scanning Probe Microscopy; Cell Radiation Experiment System; Process to Produce Iron Nanoparticle Lunar Dust Simulant Composite; Inversion Method for Early Detection of ARES-1 Case Breach Failure; Use of ILTV Control Laws for LaNCETS Flight Research;and Evaluating Descent and Ascent Trajectories Near Non-Spherical Bodies.

Source record↗
NASA NTRS2011

Contact Graph Routing

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic. The information carried by CGR contact plan messages is useful not only for dynamic route computation, but also for the implementation of rate control, congestion forecasting, transmission episode initiation and termination, timeout interval computation, and retransmission timer suspension and resumption.

Burleigh, Scott C.↗
NASA NTRS2012

Adaptive Sampling of Time Series During Remote Exploration

This work deals with the challenge of online adaptive data collection in a time series. A remote sensor or explorer agent adapts its rate of data collection in order to track anomalous events while obeying constraints on time and power. This problem is challenging because the agent has limited visibility (all its datapoints lie in the past) and limited control (it can only decide when to collect its next datapoint). This problem is treated from an information-theoretic perspective, fitting a probabilistic model to collected data and optimizing the future sampling strategy to maximize information gain. The performance characteristics of stationary and nonstationary Gaussian process models are compared. Self-throttling sensors could benefit environmental sensor networks and monitoring as well as robotic exploration. Explorer agents can improve performance by adjusting their data collection rate, preserving scarce power or bandwidth resources during uninteresting times while fully covering anomalous events of interest. For example, a remote earthquake sensor could conserve power by limiting its measurements during normal conditions and increasing its cadence during rare earthquake events. A similar capability could improve sensor platforms traversing a fixed trajectory, such as an exploration rover transect or a deep space flyby. These agents can adapt observation times to improve sample coverage during moments of rapid change. An adaptive sampling approach couples sensor autonomy, instrument interpretation, and sampling. The challenge is addressed as an active learning problem, which already has extensive theoretical treatment in the statistics and machine learning literature. A statistical Gaussian process (GP) model is employed to guide sample decisions that maximize information gain. Nonsta tion - ary (e.g., time-varying) covariance relationships permit the system to represent and track local anomalies, in contrast with current GP approaches. Most common GP models are stationary, e.g., the covariance relationships are time-invariant. In such cases, information gain is independent of previously collected data, and the optimal solution can always be computed in advance. Information-optimal sampling of a stationary GP time series thus reduces to even spacing, and such models are not appropriate for tracking localized anomalies. Additionally, GP model inference can be computationally expensive.

Thompson, David R.↗