Search NASA⌕ Search

SEARCH · Search NASA

Results for “Constraint programming”

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 307 records · Page 17

Application of IRTAM to Support ISS Program Safety

The International Space Station (ISS) orbits near the F-peak of the ionosphere (approximately 400 km altitude). Generally, satellites orbiting at this altitude would have a floating potential (FP) of approximately -1 V due to the electron temperature (Te). However, the ISS has 8 large negatively grounded 160 V solar array wings (SAW) that collect a significant electron current from the ionosphere. This current drives the ISS FP much more negative during insolation and is highly dependent on the electron density (Ne). Also, due to the size of the ISS, magnetic inductance caused by the geomagnetic field produces a delta potential up to 40 V across the truss, possibly producing positive potentials. During Extravehicular Activity (EVA) the negative FP can lead to an arcing hazard when it exceeds -45.5 V, and the positive FP can produce a DC current high enough to stimulate the astronaut's muscles and also cause a hazard. Data collected from the Floating Potential Monitoring Unit (FPMU) have shown that the probability of either of these hazards occurring during times with quiet to moderately disturbed geomagnetic activity is low enough to no longer be considered a risk. However, a study of the ionosphere Ne during severe geomagnetic storm activity has shown that the Ne can be enhanced by a factor of 6 in the ISS orbit. As a result, the ISS Safety Review Panel (SRP) requires that ionospheric conditions be monitored using the FPMU in conjunction with the ISS Plasma Interaction Model (PIM) to determine if a severe geomagnetic storm could result in a plasma environment that could produce a hazard. A 'Real-Time' plasma hazard assessment process was developed to support ISS Program real-time decision making providing constraint relief information for EVAs planning and operations. This process incorporates 'real time' ionospheric conditions, ISS solar arrays' orientation, ISS flight attitude, and where the EVA will be performed on the ISS. This assessment requires real time data that is presently provided by the FPMU including ISS floating potential, along with ionospheric Ne and Te, in order to determine the present environment. Once the present environment conditions are known to be either above, below, or near the current IRI values, the IRI is used to forecast what the environment could become in the event of a severe geomagnetic storm. If the FPMU should fail, the Space Environments team needs another source of data which is utilized to support a short-term forecast for EVAs. The IRI Real-Time Assimilative Mapping (IRTAM) model is an ionospheric model that uses real time measurements from approximately 70 digisondes to produce foF2 and hmF2 global maps in 15 minute cadence. The Boeing Space Environments team has used the IRI coefficients produced in IRTAM to calculate the Ne along the ISS orbital track. The results of the IRTAM model have been compared to FPMU measurements and show excellent agreement (figure 1). IRTAM has been identified as a potential FPMU back-up system will be used as a backup for the FPMU to support the ISS Program following completion of an FPMU/IRTAM validation campaign.

Hartman, William A.↗

The ADS general-purpose optimization program

The mathematical statement of the general nonlinear optimization problem is given as follows: find the vector of design variables, X, that will minimize f(X) subject to G sub J (x) + or - 0 j=1,m H sub K hk(X) = 0 k=1,l X Lower I approx less than X sub I approx. less than X U over I i = 1,N. The vector of design variables, X, includes all those variables which may be changed by the ADS program in order to arrive at the optimum design. The objective function F(X) to be minimized may be weight, cost or some other performance measure. If the objective is to be maximized, this is accomplished by minimizing -F(X). The inequality constraints include limits on stress, deformation, aeroelastic response or controllability, as examples, and may be nonlinear implicit functions of the design variables, X. The equality constraints h sub k(X) represent conditions that must be satisfied precisely for the design to be acceptable. Equality constraints are not fully operational in version 1.0 of the ADS program, although they are available in the Augmented Lagrange Multiplier method. The side constraints given by the last equation are used to directly limit the region of search for the optimum. The ADS program will never consider a design which is not within these limits.

Vanderplaats, G. N.↗

Global Optimization via Quadratic Disjunctive Programming for Water Networks Design with Energy Recovery

Generalized disjunctive programming (GDP) models with bilinear and concave constraints, often seen in water network design, are challenging optimization problems. This work proposes quadratic and piecewise linear approximations for nonlinear terms to reformulate GDP models into quadratic GDP (QGDP) models that suitable solvers may solve more efficiently. We illustrate the benefits of the quadratic reformulation with a water treatment network design problem in which nonconvexities arise from bilinear terms in the mixers’ mass balances and concave investment cost functions of treatment units. Given the similarities with water network design problems, we suggest quadratic approximation for the GDP model for the optimal design of a large-scale reverse electrodialysis (RED) process. This power technology can recover energy from salinity differences between by-product streams of the water sector, such as desalination brine mixed with regenerated wastewater effluents. The solver Gurobi excels in handling QGDP problems, but weighing the problem’s precision and tractability balance is crucial. The piecewise linear approximation yields more accurate, yet larger QGDP models that may require longer optimization times in large-scale process synthesis problems.

Water Networks↗

Natural environment application for NASP-X-30 design and mission planning

The NASA/MSFC Mission Analysis Program has recently been utilized in various National Aero-Space Plane (NASP) mission and operational planning scenarios. This paper focuses on presenting various atmospheric constraint statistics based on assumed NASP mission phases using established natural environment design, parametric, threshold values. Probabilities of no-go are calculated using atmospheric parameters such as temperature, humidity, density altitude, peak/steady-state winds, cloud cover/ceiling, thunderstorms, and precipitation. The program although developed to evaluate test or operational missions after flight constraints have been established, can provide valuable information in the design phase of the NASP X-30 program. Inputting the design values as flight constraints the Mission Analysis Program returns the probability of no-go, or launch delay, by hour by month. This output tells the X-30 program manager whether the design values are stringent enough to meet his required test flight schedules.

Johnson, D. L.↗

An innovative approach to compensator design

The primary goal is to present for a control system a computer-aided-compensator design technique from a frequency domain point of view. The thesis for developing this technique is to describe the open loop frequency response by n discrete frequency points which result in n functions of the compensator coefficients. Several of these functions are chosen so that the system specifications are properly portrayed; then mathematical programming is used to improve all of these functions which have values below minimum standards. In order to do this several definitions in regard to measuring the performance of a system in the frequency domain are given. Next, theorems which govern the number of compensator coefficients necessary to make improvements in a certain number of functions are proved. After this a mathematical programming tool for aiding in the solution of the problem is developed. Then for applying the constraint improvement algorithm generalized gradients for the constraints are derived. Finally, the necessary theory is incorporated in a computer program called CIP (compensator improvement program).

Mitchell, J. R.↗

Symbolic PathFinder: Symbolic Execution of Java Bytecode

Symbolic Pathfinder (SPF) combines symbolic execution with model checking and constraint solving for automated test case generation and error detection in Java programs with unspecified inputs. In this tool, programs are executed on symbolic inputs representing multiple concrete inputs. Values of variables are represented as constraints generated from the analysis of Java bytecode. The constraints are solved using off-the shelf solvers to generate test inputs guaranteed to achieve complex coverage criteria. SPF has been used successfully at NASA, in academia, and in industry.

Pasareanu, Corina S.↗

Automatic data partitioning on distributed memory multicomputers

Distributed-memory parallel computers are increasingly being used to provide high levels of performance for scientific applications. Unfortunately, such machines are not very easy to program. A number of research efforts seek to alleviate this problem by developing compilers that take over the task of generating communication. The communication overheads and the extent of parallelism exploited in the resulting target program are determined largely by the manner in which data is partitioned across different processors of the machine. Most of the compilers provide no assistance to the programmer in the crucial task of determining a good data partitioning scheme. A novel approach is presented, the constraints-based approach, to the problem of automatic data partitioning for numeric programs. In this approach, the compiler identifies some desirable requirements on the distribution of various arrays being referenced in each statement, based on performance considerations. These desirable requirements are referred to as constraints. For each constraint, the compiler determines a quality measure that captures its importance with respect to the performance of the program. The quality measure is obtained through static performance estimation, without actually generating the target data-parallel program with explicit communication. Each data distribution decision is taken by combining all the relevant constraints. The compiler attempts to resolve any conflicts between constraints such that the overall execution time of the parallel program is minimized. This approach has been implemented as part of a compiler called Paradigm, that accepts Fortran 77 programs, and specifies the partitioning scheme to be used for each array in the program. We have obtained results on some programs taken from the Linpack and Eispack libraries, and the Perfect Benchmarks. These results are quite promising, and demonstrate the feasibility of automatic data partitioning for a significant class of scientific application programs with regular computations.

Gupta, Manish↗

Space station payload operations scheduling with ESP2

The Mission Analysis Division of the Systems Analysis and Integration Laboratory at the Marshall Space Flight Center is developing a system of programs to handle all aspects of scheduling payload operations for Space Station. The Expert Scheduling Program (ESP2) is the heart of this system. The task of payload operations scheduling can be simply stated as positioning the payload activities in a mission so that they collect their desired data without interfering with other activities or violating mission constraints. ESP2 is an advanced version of the Experiment Scheduling Program (ESP) which was developed by the Mission Integration Branch beginning in 1979 to schedule Spacelab payload activities. The automatic scheduler in ESP2 is an expert system that embodies the rules that expert planners would use to schedule payload operations by hand. This scheduler uses depth-first searching, backtracking, and forward chaining techniques to place an activity so that constraints (such as crew, resources, and orbit opportunities) are not violated. It has an explanation facility to show why an activity was or was not scheduled at a certain time. The ESP2 user can also place the activities in the schedule manually. The program offers graphical assistance to the user and will advise when constraints are being violated. ESP2 also has an option to identify conflict introduced into an existing schedule by changes to payload requirements, mission constraints, and orbit opportunities.

Stacy, Kenneth L.↗

Rotorcraft airframe structural optimization for combined vibration and fatigue constraints

This paper addresses the application of a formal optimization technique in rotorcraft airframe structural design studies to reduce the structural weight, to lower airframe vibrations, and to enhance fatigue life of the structure. Vibration and fatigue considerations in airframe design are described. An optimization methodology based on the use of a nonlinear programming technique to size airframe structural members subjected to constraints on weight, vibration response and fatigue stresses under dynamic loads, are described. The paper focuses on the development of necessary computational tools for airframe structural optimization and describes the sensitivity analysis procedure for these types of design constraints. Further, the paper describes the optimization procedure as implemented in a computer code called DYNOPT which is a unique operational combination of several newly developed Fortran codes as well as modification of existing codes consisting of the direct matrix abstraction modules of the MSC/NASTRAN Program and CONMIN optimizer. The application of the optimization procedure is demonstrated using an elastic-line model of the Bell AH-1G helicopter airframe structure and computational results are discussed.

Sareen, Ashish K.↗

User's manual for an aerodynamic optimization scheeme that updates flow variables and design parameters simultaneously

This user's manual is presented for an aerodynamic optimization program that updates flow variables and design parameters simultaneously. The program was developed for solving constrained optimization problems in which the objective function and the constraint function are dependent on the solution of the nonlinear flow equations. The program was tested by applying it to the problem of optimizing propeller designs. Some reference to this particular application is therefore made in the manual. However, the optimization scheme is suitable for application to general aerodynamic design problems. A description of the approach used in the optimization scheme is first presented, followed by a description of the use of the program.

Rizk, Magdi H.↗

Interactive orbital proximity operations planning system

An interactive graphical proximity operations planning system was developed, which allows on-site design of efficient, complex, multiburn maneuvers in a dynamic multispacecraft environment. Maneuvering takes place in and out of the orbital plane. The difficulty in planning such missions results from the unusual and counterintuitive character of orbital dynamics and complex time-varying operational constraints. This difficulty is greatly overcome by visualizing the relative trajectories and the relevant constraints in an easily interpretable graphical format, which provides the operator with immediate feedback on design actions. The display shows a perspective bird's-eye view of a Space Station and co-orbiting spacecraft on the background of the Station's orbital plane. The operator has control over the two modes of operation: a viewing system mode, which enables the exporation of the spatial situation about the Space Station and thus the ability to choose and zoom in on areas of interest; and a trajectory design mode, which allows the interactive editing of a series of way points and maneuvering burns to obtain a trajectory that complies with all operational constraints. A first version of this display was completed. An experimental program is planned in which operators will carry out a series of design missions which vary in complexity and constraints.

Grunwald, Arthur J.↗

Software for Autonomous Spacecraft Maneuvers

The AutoCon computer programs facilitate and accelerate the planning and execution of orbital control maneuvers of spacecraft while analyzing and resolving mission constraints. AutoCon-F is executed aboard spacecraft, enabling the spacecraft to plan and execute maneuvers autonomously; AutoCon-G is designed for use on the ground. The AutoCon programs utilize advanced techniques of artificial intelligence, including those of fuzzy logic and natural-language scripting, to resolve multiple conflicting constraints and automatically plan maneuvers. These programs can be used to satisfy requirements for missions that involve orbits around the Earth, the Moon, or any planet, and are especially useful for missions in which there are requirements for frequent maneuvers and for resolution of complex conflicting constraints. During operations, the software targets new trajectories, places and sizes maneuvers, and controls spacecraft burns. AutoCon-G provides a userfriendly graphical interface, and can be used effectively by an analyst with minimal training. AutoCon-F reduces latency and supports multiple-spacecraft and formation-flying missions. The AutoCon architecture supports distributive processing, which can be critical for formation- control missions. AutoCon is completely object-oriented and can easily be enhanced by adding new objects and events. AutoCon-F was flight demonstrated onboard GSFC's EO-1 spacecraft flying in formation with Landsat-7.

Bristow, John↗

Improving Resiliency in Planning MW-Scale Medium and Heavy Duty EV Charging Stations Considering TSCOTS Optimization

Electrification of heavy-duty (HD) vehicles marks an important milestone and technical challenge in the electric vehicle (EV) industry and the public grid. However, implementing EV charging at this scale will necessitate that traditional truck stops be updated with EV charging infrastructure that could represent 10's of MW in electricity consumption. Furthermore, as the transportation sector is represented as critical infrastructure, supporting resiliency considerations in EV charging infrastructure will be critical. This paper proposes an optimization-based approach for optimally designing a MW-scale microgrid charging network. This approach transforms conventional designed truck stops into a reliable HDEV charging stations capable of overnight slow charging and 30-minute to 1 hour fast charging. Using a mixed-integer linear program formulation blending capacity planning and reliability constraints, an optimal network configuration can be solved for a proposed EV charging station that includes photovoltaic and battery energy storage capabilities.

Ponce, Moises [University of Tennessee, Knoxville ↗

Adjustment technique without explicit formation of normal equations /conjugate gradient method/

For a simultaneous adjustment of a large geodetic triangulation system, a semiiterative technique is modified and used successfully. In this semiiterative technique, known as the conjugate gradient (CG) method, original observation equations are used, and thus the explicit formation of normal equations is avoided, 'huge' computer storage space being saved in the case of triangulation systems. This method is suitable even for very poorly conditioned systems where solution is obtained only after more iterations. A detailed study of the CG method for its application to large geodetic triangulation systems was done that also considered constraint equations with observation equations. It was programmed and tested on systems as small as two unknowns and three equations up to those as large as 804 unknowns and 1397 equations. When real data (573 unknowns, 965 equations) from a 1858-km-long triangulation system were used, a solution vector accurate to four decimal places was obtained in 2.96 min after 1171 iterations (i.e., 2.0 times the number of unknowns).

Saxena, N. K.↗

Control optimization, stabilization and computer algorithms for aircraft applications

Research related to reliable aircraft design is summarized. Topics discussed include systems reliability optimization, failure detection algorithms, analysis of nonlinear filters, design of compensators incorporating time delays, digital compensator design, estimation for systems with echoes, low-order compensator design, descent-phase controller for 4-D navigation, infinite dimensional mathematical programming problems and optimal control problems with constraints, robust compensator design, numerical methods for the Lyapunov equations, and perturbation methods in linear filtering and control.

Source record↗

Trajectory, atmosphere, and wind reconstruction from Viking entry measurements

During Mars entry, each Viking Lander will collect and send to earth large quantities of measurement data, both scientific and engineering in nature. Software has been developed to statistically process this and other data in order to reconstruct, for mission support purposes, the entry trajectory, an 'engineering' atmosphere, and a wind profile. Procedures are described for processing limited amounts of the available data in such a manner that the maximum amount of information can be extracted therefrom, consistent with program design, response requirements, and mission operations constraints. Results of observability studies and simulations indicate that accuracy requirements will be met.

Hopper, F. W.↗