Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Programming, Linear”

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Optimal rejection of persistent disturbances, robust stability, and mixed sensitivity minimization

The problem of optimal disturbance rejection of bounded persistent disturbances is solved in the general nonsquare case. The minimum value of the objective function can be obtained by solving a semiinfinite linear programming problem, and an iterative procedure for obtaining approximate solutions is introduced. Application of the l1-optimal problem to robustness is discussed. A mixed sensitivity problem is formulated and shown to guarantee good disturbance rejection in the presence of plant perturbations.

Dahleh, Munther A.↗
NASA NTRS1989

Procedures for shape optimization of gas turbine disks

Two procedures, the feasible direction method and sequential linear programming, for shape optimization of gas turbine disks are presented. The objective of these procedures is to obtain optimal designs of turbine disks with geometric and stress constraints. The coordinates of the selected points on the disk contours are used as the design variables. Structural weight, stress and their derivatives with respect to the design variables are calculated by an efficient finite element method for design senitivity analysis. Numerical examples of the optimal designs of a disk subjected to thermo-mechanical loadings are presented to illustrate and compare the effectiveness of these two procedures.

Cheu, Tsu-Chien↗
NASA NTRS1989

A polynomial time algorithm for checking the robust stability of a polytope of polynomials

An efficient algorithm to check the robust stability of a polytope of polynomials is proposed. This problem is equivalent to a zero-exclusion condition at each frequency. It is shown that such a condition has to be checked at only a finite number of frequencies. This problem is formulated as a parametric linear program, which can be solved by the simplex procedure with additional computations between steps, consisting of polynomial evaluations and calculation of positive polynomial roots. The algorithm requires a finite number of steps (corresponding to frequency checks), and, in the important case of the polytope of parameters being a hypercube, this number is at most O(m3n), where n is the degree of the polynomials in the family and m is the number of parameters.

Sideris, Athanasios↗
NASA NTRS1989

Cooperative control of two active spacecraft during proximity operations

A cooperative autopilot is developed for the control of the relative attitude, relative position and absolute attitude of two maneuvering spacecraft during on orbit proximity operations. The autopilot consists of an open-loop trajectory solver which computes a nine dimensional linearized nominal state trajectory at the beginning of each maneuver and a phase space regulator which maintains the two spacecraft on the nominal trajectory during coast phases of the maneuver. A linear programming algorithm is used to perform jet selection. Simulation tests using a system of two space shuttle vehicles are performed to verify the performance of the cooperative controller and comparisons are made to a traditional passive target/active pursuit vehicle approach to proximity operations. The cooperative autopilot is shown to be able to control the two vehicle system when both the would be pursuit vehicle and the target vehicle are not completely controllable in six degrees of freedom. The cooperative controller is also shown to use as much as 37 percent less fuel and 57 percent fewer jet firings than a single pursuit vehicle during a simple docking approach maneuver.

Polutchko, Robert J.↗
NASA NTRS1990

Optimal fabrication processes for unidirectional metal-matrix composites: A computational simulation

A method is proposed for optimizing the fabrication process of unidirectional metal matrix composites. The temperature and pressure histories are optimized such that the residual microstresses of the composite at the end of the fabrication process are minimized and the material integrity throughout the process is ensured. The response of the composite during the fabrication is simulated based on a nonlinear micromechanics theory. The optimal fabrication problem is formulated and solved with non-linear programming. Application cases regarding the optimization of the fabrication cool-down phases of unidirectional ultra-high modulus graphite/copper and silicon carbide/titanium composites are presented.

Saravanos, D. A.↗
NASA NTRS1989

Time optimal movement of cooperating robots

The maximization of the speed of movement along a prescribed path, of the system formed by a set of robot arms and the object they hold is examined. The actuator torques that maximize the acceleration of the system are shown to be determined by the solution to a standard linear programming problem. The combination of this result with the known control strategy for time optimal movement of a single robot arm yields an algorithm for time optimal movement of multiple robot arms holding the same workpiece.

Mccarthy, J. M.↗
NASA NTRS1990

Probabilistic structural analysis by extremum methods

The objective is to demonstrate discrete extremum methods of structural analysis as a tool for structural system reliability evaluation. Specifically, linear and multiobjective linear programming models for analysis of rigid plastic frames under proportional and multiparametric loadings, respectively, are considered. Kinematic and static approaches for analysis form a primal-dual pair in each of these models and have a polyhedral format. Duality relations link extreme points and hyperplanes of these polyhedra and lead naturally to dual methods for system reliability evaluation.

Nafday, Avinash M.↗
NASA NTRS1991

l1-optimal control of multivariable systems with output norm constraints

This paper considers the l1-optimal control problem for general rational plants. It is shown that, for plants with no poles or zeros on the unit circle, an optimal compensator exists and that the resulting closed loop transfer function is polynomial whenever there are at least as many controls as regulated outputs and at least as many measurements as exogeneous inputs. Exactly or approximately, optimal rational compensators can be obtained by solving a sequence of finite linear programs for the coefficients of a polynomial closed-loop transfer function. No assumptions on plant poles or zeros are required to obtain at least approximately optimal compensators. It is shown that constrained problems in which a set of outputs is regulated subject to l(infinity)-norm constraints on another set of outputs can be solved using a slight modification of the same algorithm.

Mcdonald, J. S.↗
NASA NTRS1992

Mathematical analysis techniques for modeling the space network activities

The objective of the present work was to explore and identify mathematical analysis techniques, and in particular, the use of linear programming. This topic was then applied to the Tracking and Data Relay Satellite System (TDRSS) in order to understand the space network better. Finally, a small scale version of the system was modeled, variables were identified, data was gathered, and comparisons were made between actual and theoretical data.

Foster, Lisa M.↗
NASA NTRS1990

Optimal rejection of bounded persistent disturbances in periodic systems

The problem of optimal rejection of bounded persistent disturbances is solved in the case of linear discrete-time period systems. The solution consists of solving an equivalent time-invariant standard l1 optimization problem subject to an additional constraint. This constraint ensures the causality of the resulting periodic controller. By the duality theory, the problem is shown to be equivalent to a linear programming problem, which is no harder than the standard l1 problem.

Dahleh, Munther A.↗
NASA NTRS1992

Optimal and robust controllers for periodic and multirate systems

The problem of optimal rejection of bounded persistent disturbances is solved in the case of linear discrete-time periodic systems. The solution consists of solving an equivalent time-invariant standard l1 optimization problem subject to an additional constraint. This constraint assures the causality of the resulting periodic controller. By the duality theory, the problem is shown to be equivalent to a linear programming problem, which is no harder than the standard l1 problem. Also, it is shown that the method of solution presented applies exactly to the problem of disturbance rejection in the case of multirate sampled data systems. Finally, the results are applied to the problem of robust stabilization of periodic and multirate systems.

Dahleh, Munther A.↗
NASA NTRS1992

Distance estimation and collision prediction for on-line robotic motion planning

An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem is incorporated into the framework of an in-line motion-planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning, the deterministic problem where the information about the objects is assumed to be certain is examined. L(1) or L(infinity) norms are used to represent distance and the problem becomes a linear programming problem. The stochastic problem is formulated where the uncertainty is induced by sensing and the unknown dynamics of the moving obstacles. Two problems are considered: First, filtering of the distance between the robot and the moving object at the present time. Second, prediction of the minimum distance in the future in order to predict the collision time.

Kyriakopoulos, K. J.↗
NASA NTRS1991

Distance estimation and collision prediction for on-line robotic motion planning

An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem has been incorporated in the framework of an in-line motion planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning the deterministic problem, where the information about the objects is assumed to be certain is examined. If instead of the Euclidean norm, L(sub 1) or L(sub infinity) norms are used to represent distance, the problem becomes a linear programming problem. The stochastic problem is formulated, where the uncertainty is induced by sensing and the unknown dynamics of the moving obstacles. Two problems are considered: (1) filtering of the minimum distance between the robot and the moving object, at the present time; and (2) prediction of the minimum distance in the future, in order to predict possible collisions with the moving obstacles and estimate the collision time.

Kyriakopoulos, K. J.↗
NASA NTRS1991

Systems engineering studies of on-orbit assembly operation

While the practice of construction has a long history, the underlying theory of construction is relatively young. Very little has been documented as to techniques of logistic support, construction planning, construction scheduling, construction testing, and inspection. The lack of 'systems approaches' to construction processes is certainly one of the most serious roadblocks to the construction of space structures. System engineering research efforts at CSC are aimed at developing concepts and tools which contribute to a systems theory of space construction. The research is also aimed at providing means for trade-offs of design parameters for other research areas in CSC. Systems engineering activity at CSC has divided space construction into the areas of orbital assembly, lunar base construction, interplanetary transport vehicle construction, and Mars base construction. A brief summary of recent results is given. Several models for 'launch-on-time' were developed. Launch-on-time is a critical concept to the assembly of such Earth-orbiting structures as the Space Station Freedom, and to planetary orbiters such as the Mars transfer vehicle. CSC has developed a launch vehicle selection model which uses linear programming to find optimal combinations of launch vehicles of various sizes (Atlas, Titan, Shuttles, HLLV's) to support SEI missions. Recently, the Center developed a cost trade-off model for studying on orbit assembly logistics. With this model it was determined that the most effective size of the HLLV would be in the range of 120 to 200 metric tons to LEO, which is consistent with the choices of General Stafford's Synthesis Group Report. A second-generation Dynamic Construction Activities Model ('DYCAM') process model has been under development, based on our past results in interruptability and our initial DYCAM model. This second-generation model is built on the paradigm of knowledge-based expert systems. It is aimed at providing answers to two questions: (1) what are some necessary or sufficient conditions for judging conceptual designs of spacecraft?, and (2) can a methodology be formulated such that these conditions may be used to provide computer-aided tools for evaluating conceptual designs and planning for space assembly sequences? Early simulation results indicate that the DYCAM model has a clear ability to emulate and simulate human orbital construction processes.

Morgenthaler, George W.↗
NASA NTRS1992

Symbolic discrete event system specification

Extending discrete event modeling formalisms to facilitate greater symbol manipulation capabilities is important to further their use in intelligent control and design of high autonomy systems. An extension to the DEVS formalism that facilitates symbolic expression of event times by extending the time base from the real numbers to the field of linear polynomials over the reals is defined. A simulation algorithm is developed to generate the branching trajectories resulting from the underlying nondeterminism. To efficiently manage symbolic constraints, a consistency checking algorithm for linear polynomial constraints based on feasibility checking algorithms borrowed from linear programming has been developed. The extended formalism offers a convenient means to conduct multiple, simultaneous explorations of model behaviors. Examples of application are given with concentration on fault model analysis.

Zeigler, Bernard P.↗
NASA NTRS1993

Self-consistent models for triaxial galaxies with flat rotation curves - The disk case

We examine the possibility of constructing scale-free triaxial logarithmic potentials self-consistently, using Schwarzschild's linear programing method. In particular, we explore the limit of nonaxisymmetric disks. In this case it is possible to reduce the problem to the self-consistent reconstruction of the disk surface density on the unit circle, a considerably simpler problem than the usual 2D or 3D one. Models with surface densities of the form Sigma = (x exp n + (y/q) exp n) exp - 1/n with n = 2 or 4 are investigated. We show that the complicated shapes of the 'boxlet' orbit families (which replace the box orbit family found in potentials with smooth cores) limit the possibility of building self-consistent models, though elliptical disks of axis ratio above 0.7 and a restricted range of boxier models can be constructed. This result relies on using sufficiently fine bins, smaller than the 10 deg bins commonly used in 2D or 3D investigations. It also indicates the need for caution in interpreting N-body models of triaxial halos in which the core of the potential is numerically smoothed.

Kuijken, Konrad↗
NASA NTRS1989

Constructor selection system

Future space construction missions will involve both human and machine constructors. Selection of the optimum constructor mix requires a model of constructor capabilities and requirements. The database for that model is developed via extrapolation from current literature. Optimization is done via minimization of total mission cost using a linear programming approach. This prototype is the first cut at producing a general tool for choosing a near-optimum constructor mix for any space construction mission. It illuminates some significant representational and data-gathering problems with the modelling approach.

Johnson, Richard↗
NASA NTRS1990

Stacking optimization of compressor blades of gas turbine engines

A procedure is presented to obtain optimal designs of axial compressor blades with structural design constraints. Coefficients of the polynomials defining the circumferential tilting angles and the axial leaning distances of the airfoil cross sections from the initial design geometry are used as design variables. The compressor blades are modeled by 20-node solid elements. An efficient finite element method is developed for modal analysis and sensitivity analysis with respect to the design variables. Based on this information, a sequential linear programming method is applied to calculate the required change of geometry for the desired structural design constraints.

Cheu, Tsu-Chien↗