Search NASA⌕ Search

SEARCH · Search NASA

Results for “Constraining”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,135 records · Page 63

Constrained tri-sphere kinematic positioning system

A scalable and adaptable, six-degree-of-freedom, kinematic positioning system is described. The system can position objects supported on top of, or suspended from, jacks comprising constrained joints. The system is compatible with extreme low temperature or high vacuum environments. When constant adjustment is not required a removable motor unit is available.

Viola, Robert J↗

Constraining Proton Lifetime in SO(10) with Stabilized Doublet-Triplet Splitting

We present a class of realistic unified models based on supersymmetric SO(10) wherein issues related to natural doublet-triplet (DT) splitting are fully resolved. Using a minimal set of low dimensional Higgs fields which includes a single adjoint, we show that the Dimopoulos-Wilzcek mechanism for DT splitting can be made stable in the presence of all higher order operators without having pseudo-Goldstone bosons and flat directions. The {mu} term of order TeV is found to be naturally induced. A Z{sub 2}-assisted anomalous U(1){sub A} gauge symmetry plays a crucial role in achieving these results. The threshold corrections to {alpha}{sub 3}(M{sub Z}), somewhat surprisingly, are found to be controlled by only a few effective parameters. This leads to a very predictive scenario for proton decay. As a novel feature, we find an interesting correlation between the d = 6 (p {yields} e{sup +}{pi}{sup 0}) and d = 5 (p {yields} {bar {nu}}K{sup +}) decay amplitudes which allows us to derive a constrained upper limit on the inverse rate of the e{sup +}{pi}{sup 0} mode. Our results show that both modes should be observed with an improvement in the current sensitivity by about a factor of five to ten.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Interpolation Approximation of Voltage Stability Constrained OPF (VSCOPF) for Reactive Power Planning

Reactive power planning (RPP), or Var planning, is to identify the optimal size and location of reactive power sources. In this paper, first, the previous work using least square method to simplify the voltage stability constrained OPF (VSCOPF) model for RPP is presented. Then, this paper presents a new model simplification solution using interpolation. The interpolation approach can be easily applied to a piecewise formulation while preserving the continuity at boundary points, which cannot be easily achieved by previous works like the least square method. The proposed interpolation approach is numerically tested and compared with the least square approach. It is concluded that interpolation is an improved model simplification approach for RPP.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Probability-Weighted LMP and RCP for Day-Ahead Energy Markets using Stochastic Security-Constrained Unit Commitment: Preprint

Variable renewable generation resources are increasing their penetration on electric power grids. These resources have weather-driven fuel sources that vary on different time scales and are difficult to predict in advance. These characteristics create challenges for system operators managing the load balance on different timescales. Research is looking into new operational techniques andstrategies that show great promise on facilitating greater integration of variable resources. Stochastic Security-Constrained Unit Commitment models are one strategy that has been discussed in literature and shows great benefit. However, it is rarely used outside the research community due to its computational limits and difficulties integrating with electricity markets. This paper discusses howit can be integrated into day-ahead energy markets and especially on what pricing schemes should be used to ensure an efficient and fair market.

17 WIND ENERGY↗

Constrained Graph Optimization: Interdiction and Preservation Problems

The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.

97 MATHEMATICS AND COMPUTING↗

Parameter and Prediction uncertainty in an optimized terrestrial carbon cycle model: Effects of constraining variables and data record length

Many parameters in terrestrial biogeochemical models are inherently uncertain, leading to uncertainty in predictions of key carbon cycle variables. At observation sites, this uncertainty can be quantified by applying model-data fusion techniques to estimate model parameters using eddy covariance observations and associated biometric data sets as constraints. Uncertainty is reduced as data records become longer and different types of observations are added. We estimate parametric and associated predictive uncertainty at the Morgan Monroe State Forest in Indiana, USA. Parameters in the Local Terrestrial Ecosystem Carbon (LoTEC) are estimated using both synthetic and actual constraints. These model parameters and uncertainties are then used to make predictions of carbon flux for up to 20 years. We find a strong dependence of both parametric and prediction uncertainty on the length of the data record used in the model-data fusion. In this model framework, this dependence is strongly reduced as the data record length increases beyond 5 years. If synthetic initial biomass pool constraints with realistic uncertainties are included in the model-data fusion, prediction uncertainty is reduced by more than 25% when constraining flux records are less than 3 years. If synthetic annual aboveground woody biomass increment constraints are also included, uncertainty is similarly reduced by an additional 25%. When actual observed eddy covariance data are used as constraints, there is still a strong dependence of parameter and prediction uncertainty on data record length, but the results are harder to interpret because of the inability of LoTEC to reproduce observed interannual variations and the confounding effects of model structural error.

Post, Wilfred M↗

A GENERALIZED STOCHASTIC COLLOCATION APPROACH TO CONSTRAINED OPTIMIZATION FOR RANDOM DATA IDENTIFICATION PROBLEMS

We present a scalable, parallel mechanism for stochastic identification/control for problems constrained by partial differential equations with random input data. Several identification objectives will be discussed that either minimize the expectation of a tracking cost functional or minimize the difference of desired statistical quantities in the appropriate $L^p$ norm, and the distributed parameters/control can both deterministic or stochastic. Given an objective we prove the existence of an optimal solution, establish the validity of the Lagrange multiplier rule and obtain a stochastic optimality system of equations. The modeling process may describe the solution in terms of high dimensional spaces, particularly in the case when the input data (coefficients, forcing terms, boundary conditions, geometry, etc) are affected by a large amount of uncertainty. For higher accuracy, the computer simulation must increase the number of random variables (dimensions), and expend more effort approximating the quantity of interest in each individual dimension. Hence, we introduce a novel stochastic parameter identification algorithm that integrates an adjoint-based deterministic algorithm with the sparse grid stochastic collocation FEM approach. This allows for decoupled, moderately high dimensional, parameterized computations of the stochastic optimality system, where at each collocation point, deterministic analysis and techniques can be utilized. The advantage of our approach is that it allows for the optimal identification of statistical moments (mean value, variance, covariance, etc.) or even the whole probability distribution of the input random fields, given the probability distribution of some responses of the system (quantities of physical interest). Our rigorously derived error estimates, for the fully discrete problems, will be described and used to compare the efficiency of the method with several other techniques. Numerical examples illustrate the theoretical results and demonstrate the distinctions between the various stochastic identification objectives.

Webster, Clayton G↗

Transversely-illuminated high current photoconductive switches with geometry-constrained conductivity path

A photoconductive switch having a wide bandgap semiconductor material substrate between opposing electrodes, with one of the electrodes having an aperture or apertures at an electrode-substrate interface for transversely directing radiation therethrough from a radiation source into a triple junction region of the substrate, so as to geometrically constrain the conductivity path to within the triple junction region.

36 MATERIALS SCIENCE↗

Projection-Based linear constrained estimation and fusion over long-haul links

We study estimation and fusion with linear dynamics in long-haul sensor networks, wherein a number of sensors are remotely deployed over a large geographical area for performing tasks such as target tracking, and a remote fusion center serves to combine the information provided by these sensors in order to improve the overall tracking accuracy. In reality, the motion of a dynamic target might be subject to certain constraints, for instance, those defined by a road network. We explore the accuracy performance of projection-based constrained estimation and fusion methods that is affected by information loss over the long-haul links. We use an example to compare the tracking errors under various implementations of centralized and distributed projection-based estimation and fusion methods and demonstrate the effectiveness of using projection-based methods in these settings.

Rao, Nageswara S↗

Projection-Based Linear Constrained Estimation and Fusion over Long-Haul Links

In this work, we study estimation and fusion with linear dynamics in long-haul sensor networks, wherein a number of sensors are remotely deployed over a large geographical area for performing tasks such as target tracking, and a remote fusion center serves to combine the information provided by these sensors in order to improve the overall tracking accuracy. In reality, the motion of a dynamic target might be subject to certain constraints, for instance, those defined by a road network. We explore the accuracy performance of projection-based constrained estimation and fusion methods that is affected by information loss over the long-haul links. We use a tracking example to compare the tracking errors under various implementations of centralized and distributed projection-based estimation and fusion methods.

Rao, Nageswara S↗

Constraining RS Models by Future Flavor and Collider Measurements: A Snowmass Whitepaper

Randall-Sundrum models are models of quark flavor, because they explain the hierarchies in the quark masses and mixings in terms of order one localization parameters of extra dimensional wavefunctions. The same small numbers which generate the light quark masses suppress contributions to flavor violating tree level amplitudes. In this note we update universal constraints from electroweak precision parameters and demonstrate how future measurements of flavor violation in ultra rare decay channels of Kaons and B mesons will constrain the parameter space of this type of models. We show how collider signatures are correlated with these flavor measurements and compute projected limits for direct searches at the 14 TeV LHC run, a 14 TeV LHC luminosity upgrade, a 33 TeV LHC energy upgrade, and a potential 100 TeV machine. We further discuss the effects of a warped model of leptons in future measurements of lepton flavor violation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Optimal Coordinated EV Charging with Reactive Power Support in Constrained Distribution Grids

Electric vehicle (EV) charging/discharging can take place in any P-Q quadrants, which means EVs could support reactive power to the grid while charging the battery. In controlled charging schemes, distribution system operator (DSO) coordinates with the charging of EV fleets to ensure grid’s operating constraints are not violated. In fact, this refers to DSO setting upper bounds on power limits for EV charging. In this work, we demonstrate that if EVs inject reactive power into the grid while charging, DSO could issue higher upper bounds on the active power limits for the EVs for the same set of grid constraints. We demonstrate the concept in an 33-node test feeder with 1,500 EVs. Case studies show that in constrained distribution grids in coordinated charging, average costs of EV charging could be reduced if the charging takes place in the fourth P-Q quadrant compared to charging with unity power factor.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Security-Constrained Unit Commitment with Linearized AC Optimal Power Flow.

We propose a mathematical programming-based approach to optimize the security-constrained unit commitment problem with a full AC transmission network representation. Our approach is based on our previously introduced successive linear programming (SLP) approach to solving the non-linear, nonconvex AC optimal power flow (ACOPF) problem. By linearizing the ACOPF, we are able to leverage powerful commercial mixed-integer solvers to iteratively optimize the combined unit commitment plus ACOPF model. We demonstrate our approach on six-bus, IEEE RTS-96, and IEEE 118-bus test systems. We perform a comparative analysis of the relative impacts of singlebus, DC, and AC transmission network models on the unit commitment and dispatch solutions and their associated costs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Projection-Based Constrained Fusion Performance with Link Loss and Measurement Bias

Sensor networks have been deployed in many real-world applications for tracking and monitoring of dynamic targets over large geographical areas. We consider a scenario where a number of ground and/or airborne sensors are used to jointly track a ground target with certain constraints on its motion dynamics, such as those defined by roadways. The state estimates from these sensors are sent over a lossy communications network to a remote fusion center for fusion. We propose both centralized and distributed projection-based methods to incorporate known constraints into the estimation and fusion process. In addition to presenting simple closed-form projected fusion solutions, we also show how to utilize knowledge of the constraints into the fusion process by two distance-based weighting methods. Wealso explore the effect of link loss and sensor measurement bias on tracking accuracy performance of constrained fusion using illustrative tracking examples. Performance evaluation results demonstrate the potential of adopting weighted average fusers in improving the overall tracking performance in the presenceof link loss and measurement bias.

Liu, Qiang↗

A trust region algorithm for PDE-constrained optimization with bound constraints using reduced order modeling

This paper presents a novel trust region algorithm that relies on proper orthogonal de-composition techniques to construct accurate reduced order models during optimization.The algorithm samples high fidelity snapshots to compute the POD functions that are used to generate reduced order models. The reduced order models are used to replace the computationally intensive high fidelity finite element evaluations during optimization.The proposed algorithm employs a trust region framework to detect loss in predictive ac-curacy in the reduced order model and automatically update the POD functions during optimization. The trust region framework allows the algorithm to use sound mathematical metrics to effectively improve the accuracy and robustness of the reduced order models during optimization. The algorithm also employs a projected gradient algorithm to model bound constraints and compute optimal and feasible controls.This paper also presents an accurate Hessian formulation for topology optimization problems. The proposed trust region framework relies on a quadratic model to update the control. This quadratic model needs reliable second order derivative information to predict the behavior of the objective function within a suitable trust region. If a nonlinear Hessian formulation is used, the computational effort increases due to additional finite element evaluations. The proposed linear Hessian formulation reduces the computational effort and enables the calculation of the second order derivative information without additional finite element model evaluations. Examples in topology optimization are presented to demonstrate the applicability of the proposed algorithm and linear Hessian formulation for large-scale PDE-constrained optimization.

bound constraints↗

Constrained Block Nonlinear Neural Dynamical Models

Neural network modules conditioned by known priors can be effectively trained and combined to represent systems with nonlinear dynamics. This work explores a novel formulation for data-efficient learning of deep control-oriented nonlinear dynamical models by embedding local model structure and constraints. The proposed method consists of neural network blocks that represent input, state, and output dynamics with constraints placed on the network weights and system variables. For handling partially observable dynamical systems, we utilize a state observer neural network to estimate the states of the system's latent dynamics. We evaluate the performance of the proposed architecture and training methods on system identification tasks for three nonlinear systems: a continuous stirred tank reactor, a two tank interacting system, and an aerodynamics body. Models optimized with a few thousand system state observations accurately represent system dynamics in open loop simulation over thousands of time steps from a single set of initial conditions. Experimental results demonstrate an order of magnitude reduction in open-loop simulation mean squared error for our constrained, block-structured neural models when compared to traditional unstructured and unconstrained neural network models.

Skomski, Elliott↗

Hybrid prioritized resource allocation in thermally-or power-constrained computing devices

Various embodiments comprise prioritizing frequency allocations in thermally- or power-constrained computing devices. Computer elements may be assigned ‘weights’ based on their priorities. The computer elements with higher weights may receive higher frequency allocations to assure they receive priority in processing more quickly. The computer elements with lower weights may receive lower frequency allocations and suffer a slowdown in their processing. Elements with the same weight may be grouped together for the purpose of frequency allocation.

Al-Rawi, Asma↗

Magnetically Levitated and Constrained Flywheel Energy Storage System

The concept of using linear induction motors to lift, constrain, accelerate, and decelerate a large-scale flywheel is proposed, and some of the advantages are investigated. Calculations for a Magnetically Levitated Energy Storage System (MLES) are performed that compare a single large scale MLES with a current state of the art flywheel energy storage system in order to show the relative differences and advantages of such a system. The system that is used for comparison is a typical Beacon Power flywheel energy system. This is currently one of the state-of-the-art flywheel energy storage systems and so it can be used to provide a basic data set to compare to an MLES system.

VanOsdol, John↗