Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “constraint satisfaction”

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 73 records · Page 4

Argumentation for coordinating shared activities

an increasing need for space missions to be able to collaboratively (and competitively) develop plans both within and across missions. In addition, interacting spacecraft that interleave onboard planning and execution must reach consensus on their commitments to each other prior to execution. In domains where missions have varying degrees of interaction and different constraints on communication and computation, the missions will require different coordination protocols in order to efficiently reach consensus with in their imposed deadlines. We describe a Shared Activity Coordination (SHAC) framework that provides a decentralized algorithm for negotiating the scheduling of shared activities over the lifetimes of multiple agents and a foundation for customizing protocols for negotiating planner interactions. We investigate variations of a few simple protocols based on argumentation and distributed constraints satisfaction techniques and evaluate their abilities to reach consistent solutions according to computation, time, and communication costs in an abstract domain where spacecraft propose joint measurements.

Mars↗

A Trajectory Generation Approach for Payload Directed Flight

Presently, flight systems designed to perform payload-centric maneuvers require preconstructed procedures and special hand-tuned guidance modes. To enable intelligent maneuvering via strong coupling between the goals of payload-directed flight and the autopilot functions, there exists a need to rethink traditional autopilot design and function. Research into payload directed flight examines sensor and payload-centric autopilot modes, architectures, and algorithms that provide layers of intelligent guidance, navigation and control for flight vehicles to achieve mission goals related to the payload sensors, taking into account various constraints such as the performance limitations of the aircraft, target tracking and estimation, obstacle avoidance, and constraint satisfaction. Payload directed flight requires a methodology for accurate trajectory planning that lets the system anticipate expected return from a suite of onboard sensors. This paper presents an extension to the existing techniques used in the literature to quickly and accurately plan flight trajectories that predict and optimize the expected return of onboard payload sensors.

Ippolito, Corey A.↗

Trajectory Design Enhancements to Mitigate Risk for the Transiting Exoplanet Survey Satellite (TESS)

The Transiting Exoplanet Survey Satellite (TESS) will employ a highly eccentric Earth orbit, in 2:1 lunar resonance, which will be reached with a lunar flyby preceded by 3.5 phasing loops. The TESS mission has limited propellant and several constraints on the science orbit and on the phasing loops. Based on analysis and simulation, we have designed the phasing loops to reduce delta-V (DV) and to mitigate risk due to maneuver execution errors. We have automated the trajectory design process and use distributed processing to generate and optimal nominal trajectories; to check constraint satisfaction; and finally to model the effects of maneuver errors to identify trajectories that best meet the mission requirements.

satellite↗

Trajectory Design to Mitigate Risk on the Transiting Exoplanet Survey Satellite (TESS) Mission

The Transiting Exoplanet Survey Satellite (TESS) will employ a highly eccentric Earth orbit, in 2:1 lunar resonance, reached with a lunar flyby preceded by 3.5 phasing loops. The TESS mission has limited propellant and several orbit constraints. Based on analysis and simulation, we have designed the phasing loops to reduce delta-V and to mitigate risk due to maneuver execution errors. We have automated the trajectory design process and use distributed processing to generate and to optimize nominal trajectories, check constraint satisfaction, and finally model the effects of maneuver errors to identify trajectories that best meet the mission requirements.

design↗

Model-based System Health Management and Contingency Planning for Autonomous UAS

Safe autonomous operations of an Unmanned Aerial System (UAS) requires that the UAS can react to unforeseen circumstances, for example, after a failure has occurred. In this paper we describe a model-based run-time architecture for autonomous on-board diagnosis, system health management, and contingency management. This architecture is being instantiated on top of NASA's Core Flight System (cFS/cFE) as amajor component of the on-board AutonomousOperating System (AOS). We will describe our diagnosis and monitoring components, which continuously provide system health status. Automated reasoning with constraint satisfaction form the core of our decision-making component, which assesses the current situation, aids in failure disambiguation, and constructs a contingency plan to mitigate the failure(s) and allow for a safe end of the mission. We will illustrate our contingency management system with two case studies, one for a fixed-wing aircraft in simulation, and one for an autonomous DJI S1000+ octo-copter.

Schumann, Johann M.↗

Dynamic Channel Assignments for Efficient Use of Aviation Spectrum Allocations

The demand for voice and data communications continues to rise with the emergence of new aerial vehicles into the airspace and the continued growth of aviation operations throughout the National Airspace System (NAS). Recent studies have shown that the anticipated growing demand for spectrum resources will exceed the capacity of existing aviation spectrum allocations. Further, airspace configurations, via assignment of fixed channel allocations within standard service volumes, do not allow for the dynamic and efficient distribution of spectrum resources based on airspace demand; as a result, a new approach to aviation spectrum management is needed to support the forecasted needs of new airspace users. The National Aeronautics and Space Administration (NASA) is investigating applications of artificial intelligence (AI), machine learning (ML), and other advanced concepts to solve a dynamic constraint satisfaction problem which is analogous to the frequency assignment problem faced by aviation. Procedures and strategies for dynamic channel allocation can be borrowed from other large-scale mobile services (i.e., 4G/5G applications) and can provide a novel spectrum management approach that allows for the intelligent utilization of aviation spectrum throughout the airspace while maintaining the strict quality of service prescribed by aeronautical standards.

Communications↗

Dynamic Channel Assignments for Efficient Use of Aviation Spectrum Allocations

The demand for voice and data communications continues to rise with the emergence of new aerial vehicles into the airspace and the continued growth of aviation operations throughout the National Airspace System (NAS). Recent studies have shown that the anticipated growing demand for spectrum resources will exceed the capacity of existing aviation spectrum allocations. Further, airspace configurations, via assignment of fixed channel allocations within standard service volumes, do not allow for the dynamic and efficient distribution of spectrum resources based on airspace demand; as a result, a new approach to aviation spectrum management is needed to support the forecasted needs of new airspace users. The National Aeronautics and Space Administration (NASA) is investigating applications of artificial intelligence (AI), machine learning (ML), and other advanced concepts to solve a dynamic constraint satisfaction problem which is analogous to the frequency assignment problem faced by aviation. Procedures and strategies for dynamic channel allocation can be borrowed from other large-scale mobile services (i.e., 4G/5G applications) and can provide a novel spectrum management approach that allows for the intelligent utilization of aviation spectrum throughout the airspace while maintaining the strict quality of service prescribed by aeronautical standards.

communications↗

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

Constraint Satisfaction Problems CSP constraint pr↗

Constraint monitoring in TOSCA

The Job-Shop Scheduling Problem (JSSP) deals with the allocation of resources over time to factory operations. Allocations are subject to various constraints (e.g., production precedence relationships, factory capacity constraints, and limits on the allowable number of machine setups) which must be satisfied for a schedule to be valid. The identification of constraint violations and the monitoring of constraint threats plays a vital role in schedule generation in terms of the following: (1) directing the scheduling process; and (2) informing scheduling decisions. This paper describes a general mechanism for identifying constraint violations and monitoring threats to the satisfaction of constraints throughout schedule generation.

Beck, Howard↗

The Predictive Power of Exact Constraints and Appropriate Norms in Density Functional Theory

Ground-state Kohn-Sham density functional theory provides, in principle, the exact ground-state energy and electronic spin densities of real interacting electrons in a static external potential. In practice, the exact density functional for the exchange-correlation (xc) energy must be approximated in a computationally efficient way. About 20 mathematical properties of the exact xc functional are known. In this work, we review and discuss these known constraints on the xc energy and hole. By analyzing a sequence of increasingly sophisticated density functional approximations (DFAs), we argue that (a) the satisfaction of more exact constraints and appropriate norms makes a functional more predictive over the immense space of many-electron systems and (b) fitting to bonded systems yields an interpolative DFA that may not extrapolate well to systems unlike those in the fitting set. We discuss both how the class of well-described systems has grown along with constraint satisfaction and the possibilities for future functional development.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimization of Blended Wing Body Composite Panels Using Both NASTRAN and Genetic Algorithm

The blended wing body (BWB) is a concept that has been investigated for improving the performance of transport aircraft. A trade study was conducted by evaluating four regions from a BWB design characterized by three fuselage bays and a 400,000 lb. gross take-off weight (GTW). This report describes the structural optimization of these regions via computational analysis and compares them to the baseline designs of the same construction. The identified regions were simplified for use in the optimization. The regions were represented by flat panels having appropriate classical boundary conditions and uniform force resultants along the panel edges. Panel-edge tractions and internal pressure values applied during the study were those determined by nonlinear NASTRAN analyses. Only one load case was considered in the optimization analysis for each panel region. Optimization was accomplished using both NASTRAN solution 200 and Genetic Algorithm (GA), with constraints imposed on stress, buckling, and minimum thicknesses. The NASTRAN optimization analyses often resulted in infeasible solutions due to violation of the constraints, whereas the GA enforced satisfaction of the constraints and, therefore, always ensured a feasible solution. However, both optimization methods encountered difficulties when the number of design variables was increased. In general, the optimized panels weighed less than the comparable baseline panels.

Lovejoy, Andrew E.↗

Space tug thermal control equipment thermal requirements, characteristics and constraints catalogue

The Space Tug Thermal Control Study contained two tasks associated with the cataloging of equipment thermal requirements, physical characteristics and constraints. In satisfaction of these tasks a Data Bank program was developed to provide a means of standardizing the method of cataloging while using the computer to handle the data and format the data into the desired catalogues. During the course of the study 109 components were catalogued and included in the Data Bank. A standardized method was selected for describing each component. Each subsystem of the Avionics System is described on a subsystem header page which describes the types of components included within the subsystem, the quantity requirements, target weights, target power and relative comments. The individual components listed within each subsystem are not necessarily a complete list of candidate items but do represent several of the presently available components for consideration in a Tug application.

Ward, T. L.↗

Symbolic Execution Enhanced System Testing

We describe a testing technique that uses information computed by symbolic execution of a program unit to guide the generation of inputs to the system containing the unit, in such a way that the unit's, and hence the system's, coverage is increased. The symbolic execution computes unit constraints at run-time, along program paths obtained by system simulations. We use machine learning techniques treatment learning and function fitting to approximate the system input constraints that will lead to the satisfaction of the unit constraints. Execution of system input predictions either uncovers new code regions in the unit under analysis or provides information that can be used to improve the approximation. We have implemented the technique and we have demonstrated its effectiveness on several examples, including one from the aerospace domain.

Davies, Misty D.↗

Data-Driven Chance-Constrained Design of Voltage Droop Control for Distribution Networks: Preprint

This paper addresses the design of local control methods for voltage control in distribution networks with high level of distributed energy resources (DERs). The designed control methods adapt the active and reactive power output of distributed energy resources proportional to the deviation of the local measured voltage magnitudes from a reference voltage, which is referred to as droop control. Thus, the design focuses on determining the droop characteristics which satisfy network-wide voltage magnitude constraints. The uncertainty and variability of DERs renders the design of optimal droop controls very challenging. Hence, this paper proposes chance constraints to limit the risk from intermittent DERs, by designing droop control coefficients that guarantee the satisfaction of network operational constraints with a specific probability. In addition, the proposed approach relies entirely on historical data rather than assuming knowledge of the probability distributions that characterize the uncertainty of DERs. The efficacy of the proposed method is demonstrated on a 37-bus distribution feeder.

chance-constrained optimization↗

On Expected Value Strong Controllability

The Probabilistic Simple Temporal Network (PSTN) generalizes Simple Temporal Networks with Uncertainty (STNUs) by introducing probability distributions over the timing of uncontrollable timepoints. PSTNs are controllable if there is a strategy to execute the controllable timepoints while bounding the risk of violating any constraint to a small value. If this risk bound can't be satisfied, PSTNs are not considered controllable. We introduce the Expected Value Probabilistic SimpleTemporal Network (EPSTN), which extends PSTNs by including a benefit to the satisfaction of temporal constraints. We study the problem of Expected Value Strong Controllability (EvSC) of EPSTNs, which seeks a schedule maximizing the expected value of satisfied constraints. We solve the EvSC problem by extending a previously developed linear program, combined with search over constraints to violate at execution time. We describe conditions under which the solution to this linear program is the maximum expected value schedule. We then show how to search for constraints to discard, using the linear program at the core of the search. While the general problem is shown to be exponential, we conclude by providing several methods to bound the complexity of search.

Planning↗

Public water supply infrastructure extensification and diversification in surface waters is insufficient to meet future demands in Texas

The data were developed to evaluate the capacity of existing and potential new surface water supply infrastructure to meet projected public water demands across districts in Texas under multiple future socioeconomic and climate scenarios. The database integrates hydrologic, water quality, infrastructure, energy, cost, demographic, and demand-projection information for candidate surface water supply locations. Candidate sites include stream reaches, waterbodies, reservoir surplus locations, and potential new reservoir sites. Water availability is characterized using historical and projected flow conditions, while site suitability is evaluated using five indicators: Water Availability Index (WAI), Water Quality Index (WQI), Energy Requirement Index (ERI), Water Treatment Cost (WTC), and Water Infrastructure Cost (WIC). The datasets include statewide candidate-site information, district-level demand projections under Shared Socioeconomic Pathways (SSPs), runoff-based allocation constraints, climate-stress metrics, and optimization outputs evaluating alternative infrastructure planning strategies. Optimization results compare Business-as-Usual (BAU) and All Surface Water (AllSW) demand-management approaches under both scaled and fixed cost-cap strategies. Associated validation datasets provide district-level feasibility assessments, infrastructure selection outcomes, cost-cap utilization, demand satisfaction metrics, and constraint diagnostics. Additional datasets quantify projected changes in storage and flow conditions as well as water availability stress for both existing and newly selected intake locations under the SSP5 scenario for mid-century and late-century climate conditions. Together, these datasets support assessment of the extent to which surface-water infrastructure expansion and diversification strategies can satisfy future public water demands while accounting for hydrologic, economic, and planning constraints across Texas. Dataset(s) Description Dataset_preoptimization.xlsx Comprehensive pre-optimization dataset containing candidate water-supply sites and associated hydrologic, water-quality, infrastructure, climate, demographic, runoff, and demand-projection variables used as inputs to the optimization analyses. Includes variable descriptions and the full statewide candidate-site database. District_level_site_selection.zip - Compressed archive containing all SSP-specific district-level optimization result files MESIO_ssp1_results.xlsx District-level site selection results for SSP1 (MESIO). Includes variable descriptions, BAU and AllSW site-selection results under scaled and fixed cost strategies, and district-level validation diagnostics. MESID_ssp2_results.xlsx District-level site selection results for SSP2 (MESID). Includes variable descriptions, BAU and AllSW site-selection results under scaled and fixed cost strategies, and district-level validation diagnostics. LCMRD_ssp3_results.xlsx District-level site selection results for SSP3 (LCMRD). Includes variable descriptions, BAU and AllSW site-selection results under scaled and fixed cost strategies, and district-level validation diagnostics. IRDev-Low_ssp4l_results.xlsx District-level site selection results for SSP4-Low (IRDev-Low). Includes variable descriptions, BAU and AllSW site-selection results under scaled and fixed cost strategies, and district-level validation diagnostics. IRDev-High_ssp4h_results.xlsx District-level site selection results for SSP4-High (IRDev-High). Includes variable descriptions, BAU and AllSW site-selection results under scaled and fixed cost strategies, and district-level validation diagnostics. RSIM_ssp5_results.xlsx District-level site selection results for SSP5 (RSIM). Includes variable descriptions, BAU and AllSW site-selection results under scaled and fixed cost strategies, and district-level validation diagnostics. tx_hydrological_stress.xlsx Hydrological stress dataset for existing and newly selected intake locations. Includes projected mid-century and late-century changes, gain/loss classifications, planning strategy information, and accompanying variable descriptions. Also includes water-stress metrics derived from historical and projected low-flow conditions.

Okoye, Perpetua I. (ORCID:0000000215545033)↗

An approximation function for frequency constrained structural optimization

The purpose is to examine a function for approximating natural frequency constraints during structural optimization. The nonlinearity of frequencies has posed a barrier to constructing approximations for frequency constraints of high enough quality to facilitate efficient solutions. A new function to represent frequency constraints, called the Rayleigh Quotient Approximation (RQA), is presented. Its ability to represent the actual frequency constraint results in stable convergence with effectively no move limits. The objective of the optimization problem is to minimize structural weight subject to some minimum (or maximum) allowable frequency and perhaps subject to other constraints such as stress, displacement, and gage size, as well. A reason for constraining natural frequencies during design might be to avoid potential resonant frequencies due to machinery or actuators on the structure. Another reason might be to satisy requirements of an aircraft or spacecraft's control law. Whatever the structure supports may be sensitive to a frequency band that must be avoided. Any of these situations or others may require the designer to insure the satisfaction of frequency constraints. A further motivation for considering accurate approximations of natural frequencies is that they are fundamental to dynamic response constraints.

Canfield, R. A.↗