Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear constraints”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS2008

Improving Incremental Balance in the GSI 3DVAR Analysis System

The Gridpoint Statistical Interpolation (GSI) analysis system is a unified global/regional 3DVAR analysis code that has been under development for several years at the National Centers for Environmental Prediction (NCEP)/Environmental Modeling Center. It has recently been implemented into operations at NCEP in both the global and North American data assimilation systems (GDAS and NDAS). An important aspect of this development has been improving the balance of the analysis produced by GSI. The improved balance between variables has been achieved through the inclusion of a Tangent Linear Normal Mode Constraint (TLNMC). The TLNMC method has proven to be very robust and effective. The TLNMC as part of the global GSI system has resulted in substantial improvement in data assimilation both at NCEP and at the NASA Global Modeling and Assimilation Office (GMAO).

Errico, Ronald M.↗
NASA NTRS2018

Preliminary Error Characterization and Parametric Error Model for the Automatic Dependent Surveillance - Contract Extended Projected Profile Message

A critical component of Trajectory-Based Operations (TBO) is the ability for a consistent and accurate 4-dimensional trajectory (4DT) to be shared and synchronized between airborne and ground systems as well as amongst various ground automation systems. The Aeronautical Telecommunication Network—Baseline 2 (ATN-B2) standard defines the Extended Projected Profile (EPP) trajectory that can be sent via Automatic Dependent Surveillance-Contract (ADS-C) from an aircraft to ground automation. The EPP trajectory message contains a representation of the reference trajectory from an aircraft’s Flight Management System (FMS). In this work, a set of scenarios were run in a high-fidelity aircraft and FMS simulation to perform an initial characterization of EPP trajectory errors under a given set of conditions. The parameters investigated were the route length, route type, wind magnitude error, wind direction error, and with and without a required time-of-arrival (RTA) constraint. In addition, linear regression was used to identify a set of EPP error models for the cross-track, vertical, and time errors.

Guerreiro, Nelson M.↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗
NASA NTRSDate not supplied

Preliminary Results Cycling GEOS-JEDI with GSI-based Background Errors

The first phase of transitioning the NASA GMAO GEOS atmospheric data assimilation capabilities to JEDI involves the replacement of the Grid-point Statistical Interpolation (GSI) with a corresponding JEDI analysis. This includes taking JEDI's Unified Observation Operator (UFO), its underlying dependencies, and the JEDI solver that enables a hybrid 4DEnVar strategy similar to what is used in the current GEOS-GSI system. Variational analysis involves at least two main components associated with the observation and background cost function terms. The first is directly related to the UFO, which is being carefully validated in a joint collaboration between GMAO and NCEP to demonstrate consistency with corresponding observations usage in GSI. The second component is the background term, which in a hybrid system involves the ability to set up both a climatologically-based term and an ensemble-based term. JEDI provides the means to implement both terms through its BUMP component. Use of BUMP would require a complete re-tune of both climatological and ensemble, which is a non-trivial exercise we would prefer to avoid. As an alternative, the work here studies the results of interfacing the GSI-background error capability (GSIBEC) into JEDI through SABER. With this, the exact same background error covariance formulation used in GSI can be employed in JEDI without need for re-tuning. This brief summary covers the work done to interface GSIBEC into JEDI and shows preliminary results where the background error covariances of the control (GEOS-GSI) and experiment (GEOS-JEDI) are identical in corresponding cycling experiments. The cycling exercise is obviously preliminary and so much can be expected from GEOS-JEDI when compared to GEOS-GSI. There is still a number of features that need closer attention and although in some cases in principle ready to cycle have been intentionally either turned off or not fully exercised (e.g., VarBC is applied but not cycled). Other features are still pending implementation, one such example is the implementation of the Tangent Linear Normal Mode Constraint. Still, results are quite encouraging as hopefully the discussion here illustrates.

Ricardo Todling↗
NASA NTRS2019

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↗
NASA NTRS1982

Structural Design With Stress and Buckling Constraints

DESAP 2 synthesizes linear-elastic structures under static loads. Objective is to find element sizes (cross-sectional areas, plate thicknesses, and the like) that minimize total structural weight without changing layout of structure. Weight is minimized for given layout subject to prescribed contstraints.

Kiusalaas, J.↗
NASA NTRS1968

Automatic planning concept - An analysis of optimum scheduling

Study considers resource costs, mission constraints, and experiment results as linear functions, insofar as possible, in an effort to develop optimum scheduling by the use of linear programming. It involves a mathematical approach in which a number of constraints are considered operative.

Rebelein, P. R.↗
NASA NTRS1983

Structural optimization with dynamic behavior constraints

The minimum weight optimum design of damped linearly elastic structural systems subjected to periodic loading with behavior constraints on maximum deflections and side constraints on design variables is addressed. Attention is focused on the two major impediments to an optimal solution: (1) the time parametric nature of the behavior constraints; and (2) the severe nonconvexity of the design space. A solution method based on upper bound approximations for the behavior constraints and an innovative mathematical programming scheme for seeking the optimal frequency subspace is set forth. Numerical results for several test problems illustrate the effectiveness of the method reported.

Mills-Curran, W. C.↗
NASA NTRS2009

A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compare the effectiveness of a symbolic solver (CVC3), a random solver, three hybrid solvers (i.e., mix of random and symbolic), and two heuristic search solvers. We evaluate the solvers on two benchmarks: one consisting of manually generated constraints and another generated with a concolic execution of 8 subjects. In addition to fully decidable constraints, the benchmarks include constraints with non-linear integer arithmetic, integer modulo and division, bitwise arithmetic, and floating-point arithmetic. As expected symbolic solving (in particular, CVC3) subsumes the other solvers for the concolic execution of subjects that only generate decidable constraints. For the remaining subjects the solvers are complementary.

Takaki, Mitsuo↗
NASA NTRS1993

Effects of geometric nonlinearities on the response of optimized box beam structures

The present minimum-mass designs for a two-spar rectangular box beam were derived on the basis of linear-buckling FEM analysis constraints. In order to ascertain the effects of any geometric nonlinearities on these designs, each was subjected to a geometrically nonlinear FEM analysis. In all cases, the structure collapses below the design load, and does so in a mode which differs from that of linear theory. This discrepancy is attributable to such nonlinear panel-interaction mechanisms as rib-crusing loads. The optimized design is highly sensitive to crushing loads, relative to the nonoptimal design.

Ragon, S.↗
NASA NTRS2011

Linear Approximation to Optimal Control Allocation for Rocket Nozzles with Elliptical Constraints

In this paper we present a straightforward technique for assessing and realizing the maximum control moment effectiveness for a launch vehicle with multiple constrained rocket nozzles, where elliptical deflection limits in gimbal axes are expressed as an ensemble of independent quadratic constraints. A direct method of determining an approximating ellipsoid that inscribes the set of attainable angular accelerations is derived. In the case of a parameterized linear generalized inverse, the geometry of the attainable set is computationally expensive to obtain but can be approximated to a high degree of accuracy with the proposed method. A linear inverse can then be optimized to maximize the volume of the true attainable set by maximizing the volume of the approximating ellipsoid. The use of a linear inverse does not preclude the use of linear methods for stability analysis and control design, preferred in practice for assessing the stability characteristics of the inertial and servoelastic coupling appearing in large boosters. The present techniques are demonstrated via application to the control allocation scheme for a concept heavy-lift launch vehicle.

Orr, Jeb S.↗
NASA NTRS1996

Variations on the Davenport Gyroscope Calibration Algorithm

This paper presents a number of variations on the Davenport algorithm for in-flight gyroscope recalibration, or first order initial calibration, specifically tailored for use with a minimum of satellite telemetry data. Central to one of the techniques described is the use of onboard integration of gyroscope data together with a detailed model of scheduled satellite slew profiles. Methods are presented for determining adjustments to either parameters for the standard linear model (i.e., a drift rate bias vector and/or a scale factor/alignment transformation matrix) or individual gyroscope scale parameters, both linear and nonlinear, in cases where the alignments are well known. The results of applying the methods in an analysis of the temporal evolution and nonlinear response of the gyroscopes installed on the Hubble Space Telescope following its first servicing mission are discussed. The two effects, when working coherently, have been found to result in slew errors of almost 1 arcsecond per degree. Procedures for selecting optimal operational gyroscope parameters subject to the constraint of using a linear model are discussed.

Welter, G.↗
NASA NTRS1975

An initial feasibility stage for Stoer's constrained least squares algorithm

A procedure is described for computing an initial feasible vector, x sub 0, for Stoer's algorithm for solving the linear least squares problem subject to linear equality and inequality constraints. The procedure described fits well with Stoer's algorithm since much of the computation performed to determine x sub 0 accomplishes initializing transformations of the problem data, which would otherwise be done in Stoer's algorithm after being given an x sub 0.

Lawson, C. L.↗
NASA NTRS1979

Optimization of space manufacturing systems

Four separate analyses are detailed: transportation to low earth orbit, orbit-to-orbit optimization, parametric analysis of SPS logistics based on earth and lunar source locations, and an overall program option optimization implemented with linear programming. It is found that smaller vehicles are favored for earth launch, with the current Space Shuttle being right at optimum payload size. Fully reusable launch vehicles represent a savings of 50% over the Space Shuttle; increased reliability with less maintenance could further double the savings. An optimization of orbit-to-orbit propulsion systems using lunar oxygen for propellants shows that ion propulsion is preferable by a 3:1 cost margin over a mass driver reaction engine at optimum values; however, ion engines cannot yet operate in the lower exhaust velocity range where the optimum lies, and total program costs between the two systems are ambiguous. Heavier payloads favor the use of a MDRE. A parametric model of a space manufacturing facility is proposed, and used to analyze recurring costs, total costs, and net present value discounted cash flows. Parameters studied include productivity, effects of discounting, materials source tradeoffs, economic viability of closed-cycle habitats, and effects of varying degrees of nonterrestrial SPS materials needed from earth. Finally, candidate optimal scenarios are chosen, and implemented in a linear program with external constraints in order to arrive at an optimum blend of SPS production strategies in order to maximize returns.

Akin, D. L.↗
NASA NTRS1985

Engineering calculations for communications satellite systems planning

Computer-based techniques for optimizing communications-satellite orbit and frequency assignments are discussed. A gradient-search code was tested against a BSS scenario derived from the RARC-83 data. Improvement was obtained, but each iteration requires about 50 minutes of IBM-3081 CPU time. Gradient-search experiments on a small FSS test problem, consisting of a single service area served by 8 satellites, showed quickest convergence when the satellites were all initially placed near the center of the available orbital arc with moderate spacing. A transformation technique is proposed for investigating the surface topography of the objective function used in the gradient-search method. A new synthesis approach is based on transforming single-entry interference constraints into corresponding constraints on satellite spacings. These constraints are used with linear objective functions to formulate the co-channel orbital assignment task as a linear-programming (LP) problem or mixed integer programming (MIP) problem. Globally optimal solutions are always found with the MIP problems, but not necessarily with the LP problems. The MIP solutions can be used to evaluate the quality of the LP solutions. The initial results are very encouraging.

Reilly, C. H.↗