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 199 records · Page 11

Newton-Euler Dynamic Equations of Motion for a Multi-body Spacecraft

The Magnetospheric MultiScale (MMS) mission employs a formation of spinning spacecraft with several flexible appendages and thruster-based control. To understand the complex dynamic interaction of thruster actuation, appendage motion, and spin dynamics, each spacecraft is modeled as a tree of rigid bodies connected by spherical or gimballed joints. The method presented facilitates assembling by inspection the exact, nonlinear dynamic equations of motion for a multibody spacecraft suitable for solution by numerical integration. The building block equations are derived by applying Newton's and Euler's equations of motion to an "element" consisting of two bodies and one joint (spherical and gimballed joints are considered separately). Patterns in the "mass" and L'force" matrices guide assembly by inspection of a general N-body tree-topology system. Straightforward linear algebra operations are employed to eliminate extraneous constraint equations, resulting in a minimum-dimension system of equations to solve. This method thus combines a straightforward, easily-extendable, easily-mechanized formulation with an efficient computer implementation.

Stoneking, Eric↗

LMI-Based Multiobjective Optimization and Control of Flexible Aircraft Using VCCTEF

This paper considers the control of coupled aeroelastic aircraft model with Variable Camber Continuous Trailing Edge Flap (VCCTEF) system. The relative motion between two adjacent flaps is constrained and this actuation constraint problem is converted into an output covariance constraint problem, and therefore can be formulated using linear matrix inequalities (LMIs). A set of LMI conditions is derived for the design of an observer-based dynamic output feedback controller for VCCTEF configured aeroelastic aircraft model. The proposed controller is then applied to the NASA Generic Transport Model (GTM) for simulation, and the results demonstrate the efficacy of the proposed approach.

LMI control↗

Modeling and Control of Robot-Structure Coupling During In-Space Structure Assembly

This paper considers the problem of robot-structure coupling dynamics during in-space robotic assembly of large flexible structures. A two-legged walking robot is used as a construction agent, whose primary goal is to stably walking on the flexible structure while carrying a substructure component to a designated location. The reaction forces inserted by the structure to the walking robot are treated as bounded disturbance inputs, and a trajectory tracking robotic controller is proposed that combines the standard full state feedback motion controller and an adaptive controller to account for the disturbance inputs. In this study, a reduced-order Euler-Bernoulli beam structure model is adapted, and a finite number of co-located sensors and actuators are distributed along the span of the beam structure. The robot-structure coupling forces are treated as a bounded external forcing function to the structure, and hence an output covariance constraint problem can be formulated, in terms of linear matrix inequality, for optimal structure control by utilizing the direct output feedback controllers. The numerical simulations show the effectiveness of the proposed robot-structure modeling and control methodology.

Swei, Sean↗

Artemis I Prelaunch Flight Readiness Analysis

The Prelaunch loads analysis traditionally captures the vehicle and Mobile Launcher (ML) loads associated with stacking in the Vehicle Assembly Building (VAB), rollout to the pad, and high-speed winds while out on the pad prior to liftoff. The following paper details the methodology used in this analysis for loads for the Artemis Flight Readiness assessment. This paper focuses on the stacking and assembly loads, the loads induced by fueling, and the load seen during rollout to the pad. Methods for integrating multiple structural models in dynamic simulations using interface forces, constraint modes, and residual vectors is discussed. Both linear and nonlinear responses are addressed. Simulation results are compared to measured data from the Dynamic Rollout Test (DRT) and Wet Dress Rehearsal (WDR).

SLS↗

A Linear Programming Approach to Routing Control in Networks of Constrained Nonlinear Positive Systems with Concave Flow Rates

We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment.We address the problem of determining the routing of material between compartments to satisfy time-varying state constraints while ensuring that material reaches its intended destination over a finite time horizon. We give sufficient conditions for the existence of a time-varying state-dependent routing strategy which ensures that the closed-loop system satisfies basic network properties of positivity, conservation and interconnection while ensuring that capacity constraints are satisfied, when possible, or adjusted if a solution cannot be found. These conditions are formulated as a linear programming problem. Instances of this linear programming problem can be solved iteratively to generate a solution to the finite horizon routing problem. Results are given for the application of this control design method to an example problem. Key words: linear programming; control of networks; positive systems; controller constraints and structure.

Positive Systems↗

Application of Sequential Quadratic Programming to Minimize Smart Active Flap Rotor Hub Loads

In an analytical study, SMART active flap rotor hub loads have been minimized using nonlinear programming constrained optimization methodology. The recently developed NLPQLP system (Schittkowski, 2010) that employs Sequential Quadratic Programming (SQP) as its core algorithm was embedded into a driver code (NLP10x10) specifically designed to minimize active flap rotor hub loads (Leyland, 2014). Three types of practical constraints on the flap deflections have been considered. To validate the current application, two other optimization methods have been used: i) the standard, linear unconstrained method, and ii) the nonlinear Generalized Reduced Gradient (GRG) method with constraints. The new software code NLP10x10 has been systematically checked out. It has been verified that NLP10x10 is functioning as desired. The following are briefly covered in this paper: relevant optimization theory; implementation of the capability of minimizing a metric of all, or a subset, of the hub loads as well as the capability of using all, or a subset, of the flap harmonics; and finally, solutions for the SMART rotor. The eventual goal is to implement NLP10x10 in a real-time wind tunnel environment.

HUB LOADS↗

Numerical method for design of minimum-drag supersonic wing camber with constraints on pitching moment and surface deformation

A numerical method, based on linearized theory, for designing minimum-drag supersonic wing camber surfaces of arbitrary planform for a given lift, with options for constraining the pitching moment and/or the surface deformation at the trailing edge of the root chord and for selecting any desired combination of eight specified wing-loading distributions to be employed in the optimization procedure is presented. Two examples are given to illustrate applications of the method. The results indicate that relatively small drag penalties are incurred in designing wings to be self-trimming and to have a reasonable camber surface.

Sorrells, R. B.↗

Linear Regression Model for Predictive Service Provider Selection

The increasing number of satellites in orbit has led to a growing reliance on third-party service providers for data transfer between Earth and space. Traditional approaches to managing satellite communications require human intervention, which becomes more burdensome with the escalating number of satellites. This research addresses the need for an efficient and automated system to optimize service provider selection for NASA space communication. Previous research has utilized human-operated approaches for service provider management. Our study fills a gap by developing a cognitive algorithm that automates and optimizes the selection process based on various parameters, such as data volume, priority, quality of service and cost. This novel solution reduces user burden, facilitates service management, and contributes to the development of cognitive spaceflight missions, ultimately supporting NASA’s research into Cognitive Communications technology. The algorithm design consists of three major steps: modeling data, developing a Link Selection Algorithm (LSA) based on a grading system, and applying machine learning using linear regression. The LSA evaluates providers based on user-defined constraints, considering factors such as delivery time, cost, and quality of service. We define a suitability metric which allows our algorithm to make a recommendation to a user regarding which commercial service providers to select. The addition of Linear Regression predicts the future suitability value. Our main findings demonstrate that the resulting algorithm can autonomously manage connections between satellites and providers, maximizing communication channel efficiency. This research has significant implications, as it not only addresses a pressing issue in satellite communication management but also advances the field of cognitive spaceflight missions.

Linear regression↗

Multi-Tethered Space-Based Interferometers: Particle System Model

Dynamics models are presented for a class of space-based interferometers comprised of multiple component bodies, interconnected in various arrangements, by low-mass flexible tethers of variable length. The tethered constellations are to perform coordinated rotational scanning accompanied by baseline dimensional changes, as well as spin axis realignments and spin-up/spin-down maneuvers. The mechanical idealization is a system of N point masses interconnected by massless tethers of variable length. Both extensible and inextensible tethers are considered. Expressions for system angular and linear momenta are developed. The unrestricted nonlinear motion equations are derived via Lagranges equations. Rheonomic constraints are introduced to allow prescribed motion of any degrees of freedom, and the associated physical forces are determined. The linearized equations of motion are obtained for the steady rotation of a system with extensible tethers of constant unstrained length.

Gates, Stephen S.↗

An Approach to Reasoning Service Migration in Data and Reasoning Fabric (DRF) Implementation

In this paper we consider service migration problem for Data and Reasoning Fabric (DRF) enabled airspace operations assuming a fixed cloud/edge infrastructure with allocated computing, storage and power resources, where cloud/edge servers, and communication stations are in a wired connected network, while vehicles use a wireless network for communication. The objective is to automatically select the best location for the requested service execution, which achieves minimum cost while satisfying the user quality of service (QoS) and available resources constraints. To this end, estimates of the response time, consumed energy and total cost are defined for each potential compute location. A mixed-integer linear program is then formulated and solved to identify optimal compute locations given QoS constraints, network infrastructure limitations, with worst-case vehicle positioning. The approach is applied to trajectory re-planning use case to avoid a collision with an emergency vehicle in real time.

Air mobility↗

Neighboring extremals of dynamic optimization problems with path equality constraints

Neighboring extremals of dynamic optimization problems with path equality constraints and with an unknown parameter vector are considered in this paper. With some simplifications, the problem is reduced to solving a linear, time-varying two-point boundary-value problem with integral path equality constraints. A modified backward sweep method is used to solve this problem. Two example problems are solved to illustrate the validity and usefulness of the solution technique.

Lee, A. Y.↗

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.↗

Topex orbit sustenance maneuver design

A trade-off analysis between maneuver period, execution errors, and orbit determination uncertainties is carried out for the Ocean Topography Experiment spacecraft for a given nodal equatorial constraint. Semimajor axis and eccentricity are controlled with minimum impulse using the linear theory of optimal transfer between close coplanar near-circular orbits. Ellipses of equal minimum and average maneuver periods are presented in the (3 execution error, 3 orbit determination uncertainty) space for different nodal equatorial constraints enabling the determination of the appropriate combination of execution errors and orbit determination uncertainties that guarantees a mission required minimum maneuver period for a given nodal deadband.

Kechichian, J. A.↗

A variational approach to dynamics of flexible multibody systems

This paper presents a variational formulation of constrained dynamics of flexible multibody systems, using a vector-variational calculus approach. Body reference frames are used to define global position and orientation of individual bodies in the system, located and oriented by position of its origin and Euler parameters, respectively. Small strain linear elastic deformation of individual components, relative to their body references frames, is defined by linear combinations of deformation modes that are induced by constraint reaction forces and normal modes of vibration. A library of kinematic couplings between flexible and/or rigid bodies is defined and analyzed. Variational equations of motion for multibody systems are obtained and reduced to mixed differential-algebraic equations of motion. A space structure that must deform during deployment is analyzed, to illustrate use of the methods developed.

Wu, Shih-Chin↗

Optimal Recursive Digital Filters for Active Bending Stabilization

In the design of flight control systems for large flexible boosters, it is common practice to utilize active feedback control of the first lateral structural bending mode so as to suppress transients and reduce gust loading. Typically, active stabilization or phase stabilization is achieved by carefully shaping the loop transfer function in the frequency domain via the use of compensating filters combined with the frequency response characteristics of the nozzle/actuator system. In this paper we present a new approach for parameterizing and determining optimal low-order recursive linear digital filters so as to satisfy phase shaping constraints for bending and sloshing dynamics while simultaneously maximizing attenuation in other frequency bands of interest, e.g. near higher frequency parasitic structural modes. By parameterizing the filter directly in the z-plane with certain restrictions, the search space of candidate filter designs that satisfy the constraints is restricted to stable, minimum phase recursive low-pass filters with well-conditioned coefficients. Combined with optimal output feedback blending from multiple rate gyros, the present approach enables rapid and robust parametrization of autopilot bending filters to attain flight control performance objectives. Numerical results are presented that illustrate the application of the present technique to the development of rate gyro filters for an exploration-class multi-engined space launch vehicle.

Orr, Jeb S.↗

Constraints on dark matter from cosmic background anisotropies

The major stages in the linear evolution of the statistical ensemble of adiabatic fluctuations in radiation, baryons, and dark matter are discussed. If it is assumed that the distribution of light emitters (i.e., of galaxies) follows the distribution of mass (i.e., of dark matter), then universes dominated by massive collisionless relics of the Big Bang must have Omega larger than 0.2 h exp -4/3 to avoid exceeding the current observational limits on small-scale anisotropies in the microwave background. However, values of Omega of about 0.2 are indicated by dynamical studies of galaxy clustering. It is concluded that universes dominated by cold dark matter in which light traces mass are probably not viable models.

Bond, J. R.↗

A Mixed Integer Linear Program for Airport Departure Scheduling

Aircraft departing from an airport are subject to numerous constraints while scheduling departure times. These constraints include wake-separation constraints for successive departures, miles-in-trail separation for aircraft bound for the same departure fixes, and time-window or prioritization constraints for individual flights. Besides these, emissions as well as increased fuel consumption due to inefficient scheduling need to be included. Addressing all the above constraints in a single framework while allowing for resequencing of the aircraft using runway queues is critical to the implementation of the Next Generation Air Transport System (NextGen) concepts. Prior work on airport departure scheduling has addressed some of the above. However, existing methods use pre-determined runway queues, and schedule aircraft from these departure queues. The source of such pre-determined queues is not explicit, and could potentially be a subjective controller input. Determining runway queues and scheduling within the same framework would potentially result in better scheduling. This paper presents a mixed integer linear program (MILP) for the departure-scheduling problem. The program takes as input the incoming sequence of aircraft for departure from a runway, along with their earliest departure times and an optional prioritization scheme based on time-window of departure for each aircraft. The program then assigns these aircraft to the available departure queues and schedules departure times, explicitly considering wake separation and departure fix restrictions to minimize total delay for all aircraft. The approach is generalized and can be used in a variety of situations, and allows for aircraft prioritization based on operational as well as environmental considerations. We present the MILP in the paper, along with benefits over the first-come-first-serve (FCFS) scheme for numerous randomized problems based on real-world settings. The MILP results in substantially reduced delays as compared to FCFS, and the magnitude of the savings depends on the queue and departure fix structure. The MILP assumes deterministic aircraft arrival times at the runway queues. However, due to taxi time uncertainty, aircraft might arrive either earlier or later than these deterministic times. Thus, to incorporate this uncertainty, we present a method for using the MILP with "overlap discounted rolling planning horizon". The approach is based on valuing near-term decision results more than future ones. We develop a model of taxitime uncertainty based on real-world data, and then compare the baseline FCFS delays with delays using the above MILP in a simple rolling-horizon method and in the overlap discounted scheme.

Gupta, Gautam↗