Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Selection optimization”

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 1,027 records · Page 57

Characterization of the Eugene Stansbery-Meter Class Autonomous Telescope on Ascension Island

In a focused effort to meet full operational capability for NASA’s Eugene Stansbery-Meter Class Autonomous Telescope (ES-MCAT), a thorough system characterization analysis was completed. NASA’s Orbital Debris Program Office (ODPO) utilizes ES-MCAT as the primary sensor for characterizing the geosynchronous Earth orbit (GEO) environment to acquire photometric data of small, faint debris objects in or near GEO. ES-MCAT is located on Ascension Island in the middle of the Atlantic Ocean at nearly 8° South latitude and 14° West longitude. This location provides dark skies suited for faint object observations but is also continuously subject to a harsh environment exposed to volcanic ash and salt spray. To better assess the overall system performance of the optical instrument, a historical assessment of the system’s performance was conducted. This analysis investigated all systematic and optical operational data to determine the overall performance parameters for ES-MCAT. A complete optical system throughput calculation was performed to determine the optimal filter for observing orbital debris in GEO orbits. The responses of each optical component to the solar spectrum, with atmospheric absorption, were multiplied and integrated to give ES-MCAT’s total system response for various filters. With the highest flux values, the Sloan Digital Sky Survey (SDSS) r′ and g′ were determined to be the optimal filters for ES-MCAT observations. Further analysis with known GEO debris objects enabled the selection of the r′ filter for characterization of the GEO debris population. A detailed overview of the optical system throughput, data reduction, photometric and astrometric data, and other system characteristics that define ES-MCAT are discussed.

Corbin L Cruz↗

Leveraging Automated Fiber Placement Computer Aided Process Planning Framework for Defect Validation and Dynamic Layup Strategies

Process planning represents an essential stage of the Automated Fiber Placement (AFP) workflow. It develops useful and efficient machine processes based upon the working material, composite design, and manufacturing resources. The current state of process planning requires a high degree of interaction from the process planner and could greatly benefit from increased automation. Therefore, a list of key steps and functions are created to identify the more difficult and time-consuming phases of process planning. Additionally, a set of metrics must exist by which to evaluate the effectiveness of the manufactured laminate from the machine code created during the Process Planning stage. Layup strategies, in addition to dog ears, stagger shifts, steering constraints, and starting points, represented the group of functions labeled as process optimization and ranked the highest in terms of priority for automation. The laminates resulting from the selected parameters are evaluated through the occurrences of principal defect metrics such as fiber gaps, overlaps, angle deviation and steering violations. This document presents an automated software solution to the layup strategy and starting point selection phase of process planning. A series of ply scenarios are generated with variations of these ply parameters and evaluated according to a set of metrics entered by the Process Planner. These metrics are generated through use of the Analytical Hierarchy Process (AHP), where relative importance between each of the fiber features are defined. The ply scenarios are selected which reduce the overall fiber feature scores based on the defects the Process Planner wishes to minimize.

HiCAM↗

A quadratic weight selection algorithm

A new numerical algorithm is presented which determines a positive semi-definite state weighting matrix in the linear-quadratic optimal control design problem. The algorithm chooses the weighting matrix by placing closed-loop eigenvalues and eigenvectors near desired locations using optimal feedback gains. A simplified flight control design example is used to illustrate the algorithms capabilities.

Broussard, J. R.↗

Sensitivity of Inferred Subphotospheric Velocity Field to Mode Selection, Analysis Technique and Noise

The horizontal velocity immediately below the photosphere was inferred from observations of high degree solar oscillations by an optimal averaging inversion technique. The sensitivity of the results to various details of both the inversion and the determination of the frequencies are investigated. The results are shown to be quite stable to the choice of most parameters, suggesting that this procedure produces reliable estimates of the subsurface velocity.

Hill, F.↗

The selection of imaging systems for planetary photography from space vehicles.

Discussion of the selection of a type of imaging system for a specific mission which will maximize the return of scientific data while keeping development risk and cost to acceptable limits. A representative example is given which shows that the parameters of the optimizing process range from the scientific objectives through the engineering and programming constraints of the spacecraft and mission, to the characteristics of the types of systems. The selections for all planetary missions flown to date have been imaging systems using image tube cameras. Film cameras and mechanical scan cameras, however, have unique advantages which should find application in planetary exploration.

Smokler, M. I.↗

On actuator placement for robust time-optimal control of uncertain flexible spacecraft

The problem of computing open-loop, on-off jet firing logic for flexible spacecraft in the face of plant modeling uncertainty is investigated. The primary control objective is to achieve a fast maneuvering time with a minimum of structural vibrations during and/or after a maneuver. This paper is also concerned with the problem of selecting a proper pair of jets for practical trade-offs among the maneuvering time, fuel consumption, structural mode excitation, and performance robustness. A time-optimal control problem subject to parameter robustness constraints is formulated. A three-mass-spring model of flexible spacecraft with a rigid-body mode and two flexible modes is used to illustrate the concept.

Wie, Bong↗

Multiple Shaker Placement for Ground Vibration Test of X-59 Aircraft Using Topology Optimization

A multiple shaker placement methodology is developed and tested using a topology optimization technique. Current multiple shaker placement methodology requires optimum accelerometer placement and optimum single-shaker placement techniques. The proposed methodology is tested using a finite element model of the X-59 Low Boom Flight Demonstrator aircraft. The effective independence and the driving point acceleration transfer function (DPATF) methods are used for the accelerometer placement study. In this study, four shakers are used to excite each mode more effectively during the ground vibration test; all the modes of interest thus are separated into four groups. Each shaker takes care of a separate group of modes. Grouping the modes of interest is performed utilizing topology optimization. The number of modes for each group therefore will be automatically decided during grouping. For each group of modes, perform the following two steps to determine optimal location of four shakers: 1) At each accelerometer location, compare the magnitude of DPATF values at natural frequencies, select the minimum value, and make a vector with these minimum values of the DPATF magnitudes for each group; and 2) Select the degrees of freedom corresponding to the maximum value of this vector. The objective function value is the maximum value of the vector with minimum value of the magnitude of the superposed acceleration transfer function. This objective function value is maximized by changing the modes for each group. Forty accelerometers are enough to have good correlation between mode shapes obtained from the reduced order model and the simulated ground vibration test.

Optimization Analysis↗

Optimal Binarization of Gray-Scaled Digital Images via Fuzzy Reasoning

A technique for finding an optimal threshold for binarization of a gray scale image employs fuzzy reasoning. A triangular membership function is employed which is dependent on the degree to which the pixels in the image belong to either the foreground class or the background class. Use of a simplified linear fuzzy entropy factor function facilitates short execution times and use of membership values between 0.0 and 1.0 for improved accuracy. To improve accuracy further, the membership function employs lower and upper bound gray level limits that can vary from image to image and are selected to be equal to the minimum and the maximum gray levels, respectively, that are present in the image to be converted. To identify the optimal binarization threshold, an iterative process is employed in which different possible thresholds are tested and the one providing the minimum fuzzy entropy measure is selected.

Dominguez, Jesus A.↗

Geometric Model for a Parametric Study of the Blended-Wing-Body Airplane

A parametric model is presented for the blended-wing-body airplane, one concept being proposed for the next generation of large subsonic transports. The model is defined in terms of a small set of parameters which facilitates analysis and optimization during the conceptual design process. The model is generated from a preliminary CAD geometry. From this geometry, airfoil cross sections are cut at selected locations and fitted with analytic curves. The airfoils are then used as boundaries for surfaces defined as the solution of partial differential equations. Both the airfoil curves and the surfaces are generated with free parameters selected to give a good representation of the original geometry. The original surface is compared with the parametric model, and solutions of the Euler equations for compressible flow are computed for both geometries. The parametric model is a good approximation of the CAD model and the computed solutions are qualitatively similar. An optimal NURBS approximation is constructed and can be used by a CAD model for further refinement or modification of the original geometry.

Mastin, C. Wayne↗

Framework for Multidisciplinary Analysis, Design, and Optimization with High-Fidelity Analysis Tools

A plan is presented for the development of a high fidelity multidisciplinary optimization process for rotorcraft. The plan formulates individual disciplinary design problems, identifies practical high-fidelity tools and processes that can be incorporated in an automated optimization environment, and establishes statements of the multidisciplinary design problem including objectives, constraints, design variables, and cross-disciplinary dependencies. Five key disciplinary areas are selected in the development plan. These are rotor aerodynamics, rotor structures and dynamics, fuselage aerodynamics, fuselage structures, and propulsion / drive system. Flying qualities and noise are included as ancillary areas. Consistency across engineering disciplines is maintained with a central geometry engine that supports all multidisciplinary analysis. The multidisciplinary optimization process targets the preliminary design cycle where gross elements of the helicopter have been defined. These might include number of rotors and rotor configuration (tandem, coaxial, etc.). It is at this stage that sufficient configuration information is defined to perform high-fidelity analysis. At the same time there is enough design freedom to influence a design. The rotorcraft multidisciplinary optimization tool is built and substantiated throughout its development cycle in a staged approach by incorporating disciplines sequentially.

Orr, Stanley A.↗

Interplanetary program to optimize simulated trajectories (IPOST). Volume 4: Sample cases

The Interplanetary Program to Optimize Simulated Trajectories (IPOST) is intended to support many analysis phases, from early interplanetary feasibility studies through spacecraft development and operations. The IPOST output provides information for sizing and understanding mission impacts related to propulsion, guidance, communications, sensor/actuators, payload, and other dynamic and geometric environments. IPOST models three degree of freedom trajectory events, such as launch/ascent, orbital coast, propulsive maneuvering (impulsive and finite burn), gravity assist, and atmospheric entry. Trajectory propagation is performed using a choice of Cowell, Encke, Multiconic, Onestep, or Conic methods. The user identifies a desired sequence of trajectory events, and selects which parameters are independent (controls) and dependent (targets), as well as other constraints and the cost function. Targeting and optimization are performed using the Standard NPSOL algorithm. The IPOST structure allows sub-problems within a master optimization problem to aid in the general constrained parameter optimization solution. An alternate optimization method uses implicit simulation and collocation techniques.

Hong, P. E.↗

Interplanetary Program to Optimize Simulated Trajectories (IPOST). Volume 2: Analytic manual

The Interplanetary Program to Optimize Space Trajectories (IPOST) is intended to support many analysis phases, from early interplanetary feasibility studies through spacecraft development and operations. The IPOST output provides information for sizing and understanding mission impacts related to propulsion, guidance, communications, sensor/actuators, payload, and other dynamic and geometric environments. IPOST models three degree of freedom trajectory events, such as launch/ascent, orbital coast, propulsive maneuvering (impulsive and finite burn), gravity assist, and atmospheric entry. Trajectory propagation is performed using a choice of Cowell, Encke, Multiconic, Onestep, or Conic methods. The user identifies a desired sequence of trajectory events, and selects which parameters are independent (controls) and dependent (targets), as well as other constraints and the cost function. Targeting and optimization is performed using the Stanford NPSOL algorithm. IPOST structure allows subproblems within a master optimization problem to aid in the general constrained parameter optimization solution. An alternate optimization method uses implicit simulation and collocation techniques.

Hong, P. E.↗

Applying Squeaky-Wheel Optimization Schedule Airborne Astronomy Observations

We apply the Squeaky Wheel Optimization (SWO) algorithm to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The problem contains complex constraints relating the feasibility of an astronomical observation to the position and time at which the observation begins, telescope elevation limits, special use airspace, and available fuel. Solving the problem requires making discrete choices (e.g. selection and sequencing of observations) and continuous ones (e.g. takeoff time and setting up observations by repositioning the aircraft). The problem also includes optimization criteria such as maximizing observing time while simultaneously minimizing total flight time. Previous approaches to the problem fail to scale when accounting for all constraints. We describe how to customize SWO to solve this problem, and show that it finds better flight plans, often with less computation time, than previous approaches.

Frank, Jeremy↗

Cell-cycle research with synchronous cultures: an evaluation

The baby-machine system, which produces new-born Escherichia coli cells from cultures immobilized on a membrane, was developed many years ago in an attempt to attain optimal synchrony with minimal disturbance of steady-state growth. In the present article, we put forward a model to describe the behaviour of cells produced by this method, and provide quantitative evaluation of the parameters involved, at each of four different growth rates. Considering the high level of selection achievable with this technique and the natural dispersion in interdivision times, we believe that the output of the baby machine is probably close to optimal in terms of both quality and persistence of synchrony. We show that considerable information on events in the cell cycle can be obtained from populations with age distributions very much broader than those achieved with the baby machine and differing only modestly from steady state. The data presented here, together with the long and fruitful history of findings employing the baby-machine technique, suggest that minimisation of stress on cells is the single most important factor for successful cell-cycle analysis.

Non-NASA Center↗

Fast Solution in Sparse LDA for Binary Classification

An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or computationally intractable in cases involving more than 30 variables or features. Therefore, one typically seeks approximate solutions by means of greedy search algorithms. The prior Sparse-LDA algorithm was a greedy algorithm that considered the best variable or feature to add/ delete to/ from its subsets in order to maximally discriminate between multiple classes of data. The present algorithm is designed for the special but prevalent case of 2-class or binary classification (e.g. 1 vs. 0, functioning vs. malfunctioning, or change versus no change). The present algorithm provides near-optimal solutions on large real-world datasets having hundreds or even thousands of variables or features (e.g. selecting the fewest wavelength bands in a hyperspectral sensor to do terrain classification) and does so in typical computation times of minutes as compared to days or weeks as taken by the prior art. Sparse LDA requires solving generalized eigenvalue problems for a large number of variable subsets (represented by the submatrices of the input within-class and between-class covariance matrices). In the general (fullrank) case, the amount of computation scales at least cubically with the number of variables and thus the size of the problems that can be solved is limited accordingly. However, in binary classification, the principal eigenvalues can be found using a special analytic formula, without resorting to costly iterative techniques. The present algorithm exploits this analytic form along with the inherent sequential nature of greedy search itself. Together this enables the use of highly-efficient partitioned-matrix-inverse techniques that result in large speedups of computation in both the forward-selection and backward-elimination stages of greedy algorithms in general.

Moghaddam, Baback↗

Optimal control laws for microburst encounter

Simplified structures for longitudinal control laws that reduce an aircraft's response to the strong head-tailwind and downdraft variations associated with microbursts are presented. They are based on non-zero-set-point linear-quadratic regulators that command throttle setting and angle of attack as functions of velocity and flight path angle, and they can incorporate direct measurements of the wind profile if available. Selection of cost functions to be minimized by feedback control has been aided by a prior study of classical control laws and exact nonlinear-optimal flight paths through realistic microburst wind profiles. The resulting optimal control laws have an adaptive, dual-mode structure that can be implemented either in flight-director logic or in an autopilot.

Stengel, R. F.↗

DSS-13 S-Band Design Optimization Using The Focal-Plane Method

In this paper, the Focal-Plane (Complex-Conjugate Phase-Matching) Method is used to select the appropriate gain and location of a feed for S-Band (2.295 GHz) operation of DSS-13, the new NSA/JPL Deep Space Network (DSN) 34-m Beam WaveGuide (BWG) antenna. It is found empirically that the Focal-Plane Method gives a better design in terms of the G/T figure than previous S-Band designs.

Focal Plane S-Band↗

Linear state feedback, quadratic weights, and closed loop eigenstructures

Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalue and the directional derivatives of closed loop eigenvectors. An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties. An algorithm is presented that can be used to select a feedback gain matrix for the linear state feedback problem which produces a specified asymptotic eigenstructure. Another algorithm is given to compute the asymptotic eigenstructure properties inherent in a given set of quadratic weights. Finally, it is shown that optimal root loci for nongeneric problems can be approximated by generic ones in the nonasymptotic region.

Thompson, P. M.↗