Search NASA⌕ Search

SEARCH · Search NASA

Results for “constraint satisfaction problems”

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.

30 records · Page 2

Joint Chance Constraints in AC Optimal Power Flow: Improving Bounds through Learning

This paper considers distribution systems with a high penetration of distributed, renewable generation and addresses the problem of incorporating the associated uncertainty into the optimal operation of these networks. Joint chance constraints, which satisfy multiple constraints simultaneously with a prescribed probability, are one way to incorporate uncertainty across sets of constraints, leading to a chance-constrained optimal power flow problem. Departing from the computationally-heavy scenario-based approaches or approximations that transform the joint constraint into conservative deterministic constraints, this paper develops a scalable, data-driven approach which learns operational trends in a power network, eliminates zero-probability events (e.g., inactive constraints), and accurately and efficiently approximates bounds on the joint chance constraint iteratively. In particular, the proposed framework improves upon the classic methods based on the union bound (or Boole's inequality) by generating a much less conservative set of single chance constraints that also guarantees the satisfaction of the original joint constraint. The proposed framework is evaluated numerically using the IEEE 37-node test feeder, focusing on the problem of voltage regulation in distribution grids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

ISMB Conference Funding to Support Attendance of Early Researchers and Students

ISMB Conference Funding for Students and Young Scientists Historical Description The Intelligent Systems for Molecular Biology (ISMB) conference has provided a general forum for disseminating the latest developments in bioinformatics on an annual basis for the past 22 years. ISMB is a multidisciplinary conference that brings together scientists from computer science, molecular biology, mathematics and statistics. The goal of the ISMB meeting is to bring together biologists and computational scientists in a focus on actual biological problems, i.e., not simply theoretical calculations. The combined focus on “intelligent systems” and actual biological data makes ISMB a unique and highly important meeting. 21 years of experience in holding the conference has resulted in a consistently well-organized, well attended, and highly respected annual conference. "Intelligent systems" include any software which goes beyond straightforward, closed-form algorithms or standard database technologies, and encompasses those that view data in a symbolic fashion, learn from examples, consolidate multiple levels of abstraction, or synthesize results to be cognitively tractable to a human, including the development and application of advanced computational methods for biological problems. Relevant computational techniques include, but are not limited to: machine learning, pattern recognition, knowledge representation, databases, combinatorics, stochastic modeling, string and graph algorithms, linguistic methods, robotics, constraint satisfaction, and parallel computation. Biological areas of interest include molecular structure, genomics, molecular sequence analysis, evolution and phylogenetics, molecular interactions, metabolic pathways, regulatory networks, developmental control, and molecular biology generally. Emphasis is placed on the validation of methods using real data sets, on practical applications in the biological sciences, and on development of novel computational techniques. The ISMB conferences are distinguished from many other conferences in computational biology or artificial intelligence by an insistence that the researchers work with real molecular biology data, not theoretical or toy examples; and from many other biological conferences by providing a forum for technical advances as they occur, which otherwise may be shunned until a firm experimental result is published. The resulting intellectual richness and cross-disciplinary diversity provides an important opportunity for both students and senior researchers. ISMB has become the premier conference series in this field with refereed, published proceedings, establishing an infrastructure to promote the growing body of research.

60 APPLIED LIFE SCIENCES↗

Optimal Power Flow in DC Networks with Robust Feasibility and Stability Guarantees

With high penetrations of renewable generation and variable loads, there is significant uncertainty associated with power flows in DC networks such that stability and operational constraint satisfaction are of concern. Most existing DC network optimal power flow (DN-OPF) formulations assume exact knowledge of loading conditions and do not provide stability guarantees. Here, in contrast, this paper studies a DN-OPF formulation which considers both stability and operational constraint satisfaction under uncertainty. The need to account for a range of uncertainty realizations in this paper's robust optimization formulation results in a challenging semi-infinite program (SIP). The proposed solution algorithm reformulates this SIP into a computationally tractable problem by constructing a tight convex inner approximation of the stability set using sufficient conditions for the existence of a feasible and stable power flow solution. Optimal generator set-points are obtained by optimizing over the proposed convex stability set. The validity and effectiveness of the propose algorithm is demonstrated through various DC networks adapted from IEEE test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Deep Conservation: A latent dynamics model for exact satisfaction of physical conservation laws [Report]

This work proposes an approach for latent dynamics learning that exactly enforces physical conservation laws. The method comprises two steps. First, we compute a low-dimensional embedding of the high-dimensional dynamical-system state using deep convolutional autoencoders. This defines a low-dimensional nonlinear manifold on which the state is subsequently enforced to evolve. Second, we define a latent dynamics model that associates with a constrained optimization problem. Specifically, the objective function is defined as the sum of squares of conservation-law violations over control volumes in a finite-volume discretization of the problem; nonlinear equality constraints explicitly enforce conservation over prescribed subdomains of the problem. The resulting dynamics model—which can be considered as a projection-based reduced-order model—ensures that the time-evolution of the latent state exactly satisfies conservation laws over the prescribed subdomains. In contrast to existing methods for latent dynamics learning, this is the only method that both employs a nonlinear embedding and computes dynamics for the latent state that guarantee the satisfaction of prescribed physical properties. Numerical experiments on a benchmark advection problem illustrate the method's ability to significantly reduce the dimensionality while enforcing physical conservation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning Stochastic Parametric Differentiable Predictive Control Policies

We present a scalable unsupervised learning-based method for obtaining explicit control policies for model predictive control problems for stochastic linear systems with additive uncertainties subject to nonlinear chance constraints. We call the proposed method stochastic parametric differentiable predictive control (SP-DPC), which extends the recently proposed deterministic DPC policy optimization algorithm. We formulate the SP-DPC as a deterministic approximation to the stochastic parametric constrained optimal control problem via independent sampling of the problem's parameters and uncertainties. This formulation allows us to directly compute the policy gradients via automatic differentiation of the problem's value function, evaluated over sampled parameters and uncertainties. In particular, the computed expectation of the problem's value function is backpropagated through the finite-time closed-loop system rollouts parametrized by a known nominal system dynamics model and neural control policy. We also provide theoretical probabilistic guarantees on closed-loop stability and chance constraints satisfaction for systems controlled by learned neural policies. We demonstrate the computational efficiency and scalability of the proposed policy optimization algorithm in three numerical examples, including systems with a large number of states or subject to nonlinear constraints.

Drgona, Jan↗

Rethinking CO adsorption on transition-metal surfaces: Effect of density-driven self-interaction errors

Adsorption of the molecule CO on metallic surfaces is an important unsolved problem in Kohn-Sham density functional theory (KS-DFT). We present a detailed study of carbon monoxide adsorption on fcc (111) surfaces of 3d, 4d, and 5d metals using nonempirical semilocal density functionals for the exchange-correlation energy: the local-density approximation (LDA), two generalized gradient approximations or GGAs [Perdew-Burke-Ernzerhof (PBE) and PBE for solids (PBEsol)], and a meta-GGA [strongly constrained and appropriately normed (SCAN) functional]. The typical error pattern (as found earlier for free molecules and for free transition-metal surfaces), in which results improve from LDA to PBE or PBEsol to SCAN, due to the satisfaction of more exact constraints, is not found here. Instead, for CO adsorption on transition-metal surfaces, we find that, while SCAN overbinds much less than LDA, it overbinds slightly more than PBE. Moreover, the tested functionals often predict the wrong adsorption site, as first pointed out for LDA and GGA in the CO/Pt (111) puzzle. This abnormal pattern leads us to suspect that the errors of PBE and SCAN for this problem are density-driven self-interaction errors associated with incorrect charge transfer between molecule and metal surface. We point out that, by the variational principle, overbinding by an approximate functional would be reduced if that functional were applied not to its self-consistent density for the adsorbed system but to an exact or more correct density for that system. Finally, we show for CO on Pt(111) that the site preference is corrected and the adsorption energy is improved for the PBE functional by using not the self-consistent PBE density but a PBE+U density. The resulting correction to the PBE total energy is much larger for the adsorbed system than for its desorbed components, showing that the error is in the density of the adsorbed system. Furthermore, this seems to solve the Feibelman 2001 CO/Pt(111) puzzle, in principle if not fully in practice.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Learning Constrained Parametric Differentiable Predictive Control Policies With Guarantees

We present differentiable predictive control (DPC), a method for offline learning of constrained neural control policies for nonlinear dynamical systems with performance guarantees. We show that the sensitivities of the parametric optimal control problem can be used to obtain direct policy gradients. Specifically, we employ automatic differentiation (AD) to efficiently compute the sensitivities of the model predictive control (MPC) objective function and constraints penalties. To guarantee safety upon deployment, we derive probabilistic guarantees on closed-loop stability and constraint satisfaction based on indicator functions and Hoeffding’s inequality. We empirically demonstrate that the proposed method can learn neural control policies for various parametric optimal control tasks. In particular, we show that the proposed DPC method can stabilize systems with unstable dynamics, track time-varying references, and satisfy nonlinear state and input constraints. Our DPC method has practical time savings compared to alternative approaches for fast and memory-efficient controller design. Specifically, DPC does not depend on a supervisory controller as opposed to approximate MPC based on imitation learning. We demonstrate that, without losing performance, DPC is scalable with greatly reduced demands on memory and computation compared to implicit and explicit MPC while being more sample efficient than model-free reinforcement learning (RL) algorithms.

97 MATHEMATICS AND COMPUTING↗

Optimizing the location and configuration of disaster resilience hubs under transportation and electric power network failures

Natural disasters often result in failures of transportation network components and blackouts that imperil the wellbeing of vulnerable populations. In response to these events, resilience hubs have been proposed as a pre-disaster planning strategy to improve access to critical services. This paper introduces an optimization-based approach to locate and configure electric power-generating resilience hubs considering the possibility of failures in transportation and electric power systems. The model's objective is to identify hub locations and configurations that maximize transportation accessibility to the hubs and maximize the satisfaction of basic energy needs through hub-generated electric power. Besides a budget constraint, the model accounts for limits on the levels of hub energy generation vis-à-vis community energy demands, and on the transportation network distance of communities to hubs. Three heuristics are presented for the proposed planning problem. The first heuristic is a genetic algorithm (GA) with problem-specific solution generation procedures. The other two heuristics implement greedy search techniques. Numerical experiments were conducted, using data from rural Puerto Rico, to illustrate the application of the proposed model and heuristics, and examine their performance. In the numerical experiments, the GA heuristic found better solutions than the greedy heuristics. Additionally, design solutions consisting of spatially dispersed hubs with low energy generation capacity were better than solutions with spatially concentrated high-capacity hubs. Lastly, across a wide range of hub demand scenarios, only a small number of candidate hub locations consistently ranked among the best locations for establishing a hub.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Bi-objective approaches for home healthcare medical team planning and scheduling problem

In this paper, we study the medical team planning and scheduling in home healthcare within a weekly horizon, including the planning of nursing visits and the daily traveling route scheduling. Two objectives are considered: the first one is to minimize the total operation cost of the healthcare agency and the second one is to maximize the patient satisfaction. The problem is formulated as a mixed integer program, to seek for a trade-off between two objectives, with the characteristics of the patient requirements including nursing types, nursing frequency and service length considered. Medical team types, available service days and overwork penalty are also respected in the model. Then an ϵ-constraint method is adopted to obtain exact non-dominated solutions. To address large-scale problem instances, three heuristic approaches are developed to generate approximate Pareto fronts in a reasonable time. The set of non-dominated solutions are valuable for decision-making. Computational experiments are conducted and the results demonstrate the efficiency of the approaches.

97 MATHEMATICS AND COMPUTING↗

Error-Bounded Learned Scientific Data Compression with Preservation of Derived Quantities

Scientific applications continue to grow and produce extremely large amounts of data, which require efficient compression algorithms for long-term storage. Compression errors in scientific applications can have a deleterious impact on downstream processing. Thus, it is crucial to preserve all the “known” Quantities of Interest (QoI) during compression. To address this issue, most existing approaches guarantee the reconstruction error of the original data or primary data (PD), but cannot directly control the problem of preserving the QoI. In this work, we propose a physics-informed compression technique that is composed of two parts: (i) reduction of the PD with bounded errors and (ii) preservation of the QoI. In the first step, we combine tensor decompositions, autoencoders, product quantizers, and error-bounded lossy compressors to bound the reconstruction error at high levels of compression. In the second step, we use constraint satisfaction post-processing followed by quantization to preserve the QoI. To illustrate the challenges of reducing the reconstruction errors of the PD and QoI, we focus on simulation data generated by a large-scale fusion code, XGC, which can produce tens of petabytes in a single day. The results show that our approach can achieve a high compression amount while accurately preserving the QoI within scientifically acceptable bounds.

97 MATHEMATICS AND COMPUTING↗

More Opportunities than Wealth. A Network of Power and Frustration

We introduce a minimal agent-based model to qualitatively conceptualize the allocation of limited wealth among more abundant opportunities. We study the interplay of power, satisfaction and frustration in the problem of wealth distribution, concentration, and inequality. This framework allows us to compare subjective measures of frustration and satisfaction to collective measures of fairness in wealth distribution, such as the Lorenz curve and the Gini index. We find that a completely libertarian, law-of-the-jungle setting, where every agent can acquire wealth from, or lose wealth to, anybody else invariably leads to a complete polarization of the distribution of wealth vs. opportunity, only minimally ameliorated by disorder in a non-optimized society. The picture is however dramatically modified when hard constraints are imposed over agents, and they are forced to share wealth with neighbors on a network. We discuss the case of random networks and scale free networks. We then propose an out of equilibrium dynamics of the networks, based on a competition of power and frustration in the decision-making of agents that leads to network evolution. We show that the ratio of power and frustration controls different dynamical regimes separated by kinetic transition and characterized by drastically different values of the indices of equality.

36 MATERIALS SCIENCE↗

Public perception of hazardousness caused by current trends of municipal solid waste management

Highlights: • Contribution to the scientific literature by examining the relationship between concern for the environment and waste disposal in the frame of household waste treatment mechanism specifically in developing countries. • The awareness of the citizens satisfaction level and the local existing capacities in developing countries significantly contribute to decision making on MSW management sustainability in Palestine and other developing countries when applied. • Identification of the differences and similarities among DC resulting to failures or success in WM field. - Abstract: Municipal solid waste (MSW) piling up is becoming a serious problem in all developing countries (DC) as a result of inequitable waste collection and treatment. Citizens’ collaboration is partly based on understanding their views and their active involvement in MSW planning; on the other hand the assessment of the perception of hazardousness related with MSW is considered rather important as well since the identification of the weak points of the applied MWM strategy is eased and the level of required training is determined. Researchers implemented a case study in the West Bank (WB) and Gaza Strip (GS) regions of Palestine, taking into consideration previous researches in other developing countries. They reached to safe and useful conclusions regarding the parameters which mean the greatest in the waste management field as far as DC are concerned. Lack of skilled manpower, irregular collection services, inadequate equipment used for waste collection, inadequate legal provisions, and resource constraints are additional factors that are confirmed to be challenging the waste management scenarios in all DCs today. The research takes those factors under consideration but focuses on the educational gap and the results revealed interesting trends a significant relationship between respondent’s educational attainment and their awareness of hazardous waste (hazard perception); the results will indicate the measure taking required to avoid accidents occurred in those regions (burns from toxics, cuts from sharps, etc). National policy and legislation development based on the research outcomes will ensure equitable and accessible services are in place in order to move towards a healthier environment. Specialized health education and training programs on national scale are also needed to enhance awareness on hazardous waste.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗