A Robust Control Approach for the Formation Flying of Multiple Spacecraft
We present a disturbance rejection mechanism for the formation flying of multiple spacecraft based on a robust control approach in terms of an H control problem.
formation↗
SEARCH · Engineering Papers
Results for “matrix inequality”
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.
Reconfigurable Control for the Formation Flying of Multiple Spacecraft
Several results on the reconfigurable control architecture for the formation flying of multiple spacecraft are presented.
formation↗
Formation Flying Control of Multiple Spacecraft: Graph Theoretic Properties and Switching Schemes
We present several results on the leader-following (LF) paradigm in the formation flying of multiple spacecraft in free space.
Formation↗
A Numerical Comparison of Barrier and Modified Barrier Methods for Large-Scale Bound-Constrained Optimization
When a classical barrier method is applied to the solution of a nonlinear programming problem with inequality constraints, the Hessian matrix of the barrier function becomes increasingly ill-conditioned as the solution is approached. As a result, it may be desirable to consider alternative numerical algorithms. We compare the performance of two methods motivated by barrier functions. The first is a stabilized form of the classical barrier method, where a numerically stable approximation to the Newton direction is used when the barrier parameter is small. The second is a modified barrier method where a barrier function is applied to a shifted form of the problem, and the resulting barrier terms are scaled by estimates of the optimal Lagrange multipliers. The condition number of the Hessian matrix of the resulting modified barrier function remains bounded as the solution to the constrained optimization problem is approached. Both of these techniques can be used in the context of a truncated-Newton method, and hence can be applied to large problems, as well as on parallel computers. In this paper, both techniques are applied to problems with bound constraints and we compare their practical behavior.
Nash, Stephen G.↗
A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty
The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.
Yedavalli, R. K.↗
An Evaluation of an Algorithm for Linear Inequalities and Its Applications
An algorithm is presented for obtaining a solution alpha to a set of inequalities (A alpha) 0 where A is an N x m-matrix and alpha is an m-vector. If the set of inequalities is consistant, then the algorithm is guaranteed to arrive at a solution in a finite number of steps. Also, if in the iteration, a negative vector is obtained, then the initial set of inequalities is inconsistant, and the iteration is terminated.
Jurgensen, J.↗
An algorithm for the solution of dynamic linear programs
The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.
Psiaki, Mark L.↗
Perturbation and Sensitivity Inequalities in Divergence Calculations
Two theorems are given and their application discussed for handling expressions which involve matrix inversion and multiplication.
Hall, J. L.↗
Decomposition-aggregation stability analysis
This report presents the development and description of the decomposition aggregation approach to stability investigations of high dimension mathematical models of dynamic systems. The high dimension vector differential equation describing a large dynamic system is decomposed into a number of lower dimension vector differential equations which represent interconnected subsystems. Then a method is described by which the stability properties of each subsystem are aggregated into a single vector Liapunov function, representing the aggregate system model, consisting of subsystem Liapunov functions as components. A linear vector differential inequality is then formed in terms of the vector Liapunov function. The matrix of the model, which reflects the stability properties of the subsystems and the nature of their interconnections, is analyzed to conclude over-all system stability characteristics. The technique is applied in detail to investigate the stability characteristics of a dynamic model of a hypothetical spinning Skylab.
Siljak, D. D.↗
Optimum vibrating beams with stress and deflection constraints
The fundamental frequency of vibration of an Euler-Bernoulli or a Timoshenko beam of a specified constant volume is maximized subject to the constraint that under a prescribed loading the maximum stress or maximum deflection at any point along the beam axis will not exceed a specified value. In contrast with the inequality constraint which controls the minimum cross-section, the present inequality constraints lead to more meaningful designs. The inequality constraint on stresses is as easily implemented as the minimum cross-section constraint but the inequality constraint on deflection uses a treatment which is an extension of the matrix partitioning technique of prescribing displacements in finite element analysis.
Kamat, M. P.↗
The condition of a finite Markov chain and perturbation bounds for the limiting probabilities
The inequalities bounding the relative error the norm of w- w squiggly/the norm of w are exhibited by a very simple function of E and A. Let T denote the transition matrix of an ergodic chain, C, and let A = I - T. Let E be a perturbation matrix such that T squiggly = T - E is also the transition matrix of an ergodic chain, C squiggly. Let w and w squiggly denote the limiting probability (row) vectors for C and C squiggly. The inequality is the best one possible. This bound can be significant in the numerical determination of the limiting probabilities for an ergodic chain. In addition to presenting a sharp bound for the norm of w-w squiggly/the norm of w an explicit expression for w squiggly will be derived in which w squiggly is given as a function of E, A, w and some other related terms.
Meyer, C. D., Jr.↗
A new look at the simultaneous analysis and design of structures
The minimum weight optimization of structural systems, subject to strength and displacement constraints as well as size side constraints, was investigated by the Simultaneous ANalysis and Design (SAND) approach. As an optimizer, the code NPSOL was used which is based on a sequential quadratic programming (SQP) algorithm. The structures were modeled by the finite element method. The finite element related input to NPSOL was automatically generated from the input decks of such standard FEM/optimization codes as NASTRAN or ASTROS, with the stiffness matrices, at present, extracted from the FEM code ANALYZE. In order to avoid ill-conditioned matrices that can be encountered when the global stiffness equations are used as additional nonlinear equality constraints in the SAND approach (with the displacements as additional variables), the matrix displacement method was applied. In this approach, the element stiffness equations are used as constraints instead of the global stiffness equations, in conjunction with the nodal force equilibrium equations. This approach adds the element forces as variables to the system. Since, for complex structures and the associated large and very sparce matrices, the execution times of the optimization code became excessive due to the large number of required constraint gradient evaluations, the Kreisselmeier-Steinhauser function approach was used to decrease the computational effort by reducing the nonlinear equality constraint system to essentially a single combined constraint equation. As the linear equality and inequality constraints require much less computational effort to evaluate, they were kept in their previous form to limit the complexity of the KS function evaluation. To date, the standard three-bar, ten-bar, and 72-bar trusses have been tested. For the standard SAND approach, correct results were obtained for all three trusses although convergence became slower for the 72-bar truss. When the matrix displacement method was used, correct results were still obtained, but the execution times became excessive due to the large number of constraint gradient evaluations required. Using the KS function, the computational effort dropped, but the optimization seemed to become less robust. The investigation of this phenomenon is continuing. As an alternate approach, the code MINOS for the optimization of sparse matrices can be applied to the problem in lieu of the Kreisselmeier-Steinhauser function. This investigation is underway.
Striz, Alfred G.↗
A methodology for the synthesis of robust feedback systems
A new methodology is developed for the synthesis of linear, time-variant (LTI) controllers for multivariable LTI systems. The resulting closed-loop system is nominally stable and exhibits a known level of performance. In addition, robustness of the feedback system is guaranteed, i.e., stability and performance are retained in the presence of multiple unstructured uncertainty blocks located at various points in the feedback loop. The design technique is referred to as the Causality Recovery Methodology (CRM). The CRM relies on the Youla parameterization of all stabilizing compensators to ensure nominal stability of the feedback system. A frequency-domain inequality in terms of the structured singular value mu defines the robustness specification. The optimal compensator, with respect to the mu condition, is shown to be noncausal in general. The aim of the CRM is to find a stable, causal transfer function matrix that approximates the robustness characteristics of the optimal solution. The CRM, via a series of infinite-dimensional convex programs, produces a closed-loop system whose performance robustness is at least as good as that of any initial design. The algorithm is approximated by a finite dimensional process for the purposes of implementation. Two numerical examples confirm the potential viability of the CRM concept; however, the robustness improvement comes at the expense of increased computational burden and compensator complexity.
Milich, David Albert↗
Performance optimization for rotors in hover and axial flight
Performance optimization for rotors in hover and axial flight is a topic of continuing importance to rotorcraft designers. The aim of this Phase 1 effort has been to demonstrate that a linear optimization algorithm could be coupled to an existing influence coefficient hover performance code. This code, dubbed EHPIC (Evaluation of Hover Performance using Influence Coefficients), uses a quasi-linear wake relaxation to solve for the rotor performance. The coupling was accomplished by expanding of the matrix of linearized influence coefficients in EHPIC to accommodate design variables and deriving new coefficients for linearized equations governing perturbations in power and thrust. These coefficients formed the input to a linear optimization analysis, which used the flow tangency conditions on the blade and in the wake to impose equality constraints on the expanded system of equations; user-specified inequality contraints were also employed to bound the changes in the design. It was found that this locally linearized analysis could be invoked to predict a design change that would produce a reduction in the power required by the rotor at constant thrust. Thus, an efficient search for improved versions of the baseline design can be carried out while retaining the accuracy inherent in a free wake/lifting surface performance analysis.
Quackenbush, T. R.↗
Optimization of rotor performance in hover and axial flight using a free wake analysis
Performance optimization for rotors in hover and axial flight is a topic of continuing importance to rotorcraft designers. The aim of this effort was to demonstrate that a numerical performance optimization algorithm could be coupled to an existing free wake hover code. This code, dubbed EHPIC (Evaluation of Hover Performacne using Influence Coefficients), uses a quasi-linear wake relaxation to solve for the rotor performance. The coupling was accomplished by expanding of the matrix of linearized influence coefficients in EHPIC to accommodate design variables and by deriving new coefficients for linearized equations governing perturbations in power and thrust. These coefficients formed the input to a linear optimization analysis, which used the flow tangency conditions on the blade and in the wake to impose equality constraints on the expanded system of equations; user-specified inequality constraints were also employed to bound the changes in the design. It was found that this locally linearized analysis could be invoked to predict a design change that would produce a reduction in the power required by the rotor at constant thrust. Thus, an efficient search for improved versions of the baseline design can be carried out while retaining the accuracy inherent in a free wake/lifting surface performance analysis. A variety of sample problems were undertaken to demonstrate the success of this approach in reducing the power required at a specified thrust for several representative rotor configurations in hover and axial flight.
Quackenbush, T. R.↗
Time-domain finite elements in optimal control with application to launch-vehicle guidance
A time-domain finite element method is developed for optimal control problems. The theory derived is general enough to handle a large class of problems including optimal control problems that are continuous in the states and controls, problems with discontinuities in the states and/or system equations, problems with control inequality constraints, problems with state inequality constraints, or problems involving any combination of the above. The theory is developed in such a way that no numerical quadrature is necessary regardless of the degree of nonlinearity in the equations. Also, the same shape functions may be employed for every problem because all strong boundary conditions are transformed into natural or weak boundary conditions. In addition, the resulting nonlinear algebraic equations are very sparse. Use of sparse matrix solvers allows for the rapid and accurate solution of very difficult optimization problems. The formulation is applied to launch-vehicle trajectory optimization problems, and results show that real-time optimal guidance is realizable with this method. Finally, a general problem solving environment is created for solving a large class of optimal control problems. The algorithm uses both FORTRAN and a symbolic computation program to solve problems with a minimum of user interaction. The use of symbolic computation eliminates the need for user-written subroutines which greatly reduces the setup time for solving problems.
Bless, Robert R.↗
Elastic Model Transitions: A Hybrid Approach Utilizing Quadratic Inequality Constrained Least Squares (LSQI) and Direct Shape Mapping (DSM)
A method for transitioning linear time invariant (LTI) models in time varying simulation is proposed that utilizes a hybrid approach for determining physical displacements by augmenting the original quadratically constrained least squares (LSQI) algorithm with Direct Shape Mapping (DSM) and modifying the energy constraints. The approach presented is applicable to simulation of the elastic behavior of launch vehicles and other structures that utilize discrete LTI finite element model (FEM) derived mode sets (eigenvalues and eigenvectors) that are propagated throughout time. The time invariant nature of the elastic data presents a problem of how to properly transition elastic states from the prior to the new model while preserving motion across the transition and ensuring there is no truncation or excitation of the system. A previous approach utilizes a LSQI algorithm with an energy constraint to effect smooth transitions between eigenvector sets with no requirement that the models be of similar dimension or have any correlation. This approach assumes energy is conserved across the transition, which results in significant non-physical transients due to changing quasi-steady state energy between mode sets, a phenomenon seen when utilizing a truncated mode set. The computational burden of simulating a full mode set is significant so a subset of modes is often selected to reduce run time. As a result of this truncation, energy between mode sets may not be constant and solutions across transitions could produce non-physical transients. In an effort to abate these transients an improved methodology was developed based on the aforementioned approach, but this new approach can handle significant changes in energy across mode set transitions. It is proposed that physical velocities due to elastic behavior be solved for using the LSQI algorithm, but solve for displacements using a two-step process that independently addresses the quasi-steady-state and non-steady-state contributions to the elastic displacement. For structures subject to large external forces, such as thrust or atmospheric drag, it is imperative to capture these forces when solving for elastic displacement. To simplify the mathematical formulation, assumptions are made regarding mass matrix normalization, constant external forcing, and constant viscous damping. These simplifications allow for direct solutions to the quasi-steady-state displacements through a process titled Direct Shape Mapping. DSM solves for the displacements using the eigenvalues of the elastic modes and the external forcing and returns a set of elastic displacements dictated by the eigenvectors of the post-transition mode set. For the non-steady-state contributions to displacement we formulate a LSQI problem that is constrained by energy of the non-steady state terms. The contributions from the quasi-steady-state and non-steady state solutions are then combined to obtain the physical displacements associated with the new set of eigenvectors. Results for the LSQI-DSM approach show significant reduction/complete removal of transients across mode set transitions while maintaining elastic motion from the prior state. For time propagation applications employing discrete elastic models that need to be transitioned in time and where running with full a full mode set is not feasible, the method developed offers a practical solution to simulating vehicle elasticity.
Hannan, Mike R.↗