Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convex programming”

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 163 records · Page 9

Roller bearing geometry design

A theory of kinematic stabilization of rolling cylinders is extended and applied to the design of cylindrical roller bearings. The kinematic stabilization mechanism puts a reverse skew into the rolling elements by changing the roller taper. Twelve basic bearing modification designs are identified amd modeled. Four have single transverse convex curvature in their rollers while eight have rollers which have compound transverse curvature made up of a central cylindrical band surrounded by symmetric bands with slope and transverse curvature. The bearing designs are modeled for restoring torque per unit axial displacement, contact stress capacity, and contact area including dynamic loading, misalignment sensitivity and roller proportion. Design programs are available which size the single transverse curvature roller designs for a series of roller slopes and load separations and which design the compound roller bearings for a series of slopes and transverse radii of curvature. The compound rollers are proportioned to have equal contact stresses and minimum size. Design examples are also given.

Savage, M.↗

Multi Objective Controller Design for Linear System via Optimal Interpolation

We propose a methodology for the design of a controller which satisfies a set of closed-loop objectives simultaneously. The set of objectives consists of: (1) pole placement, (2) decoupled command tracking of step inputs at steady-state, and (3) minimization of step response transients with respect to envelope specifications. We first obtain a characterization of all controllers placing the closed-loop poles in a prescribed region of the complex plane. In this characterization, the free parameter matrix Q(s) is to be determined to attain objectives (2) and (3). Objective (2) is expressed as determining a Pareto optimal solution to a vector valued optimization problem. The solution of this problem is obtained by transforming it to a scalar convex optimization problem. This solution determines Q(O) and the remaining freedom in choosing Q(s) is used to satisfy objective (3). We write Q(s) = (l/v(s))bar-Q(s) for a prescribed polynomial v(s). Bar-Q(s) is a polynomial matrix which is arbitrary except that Q(O) and the order of bar-Q(s) are fixed. Obeying these constraints bar-Q(s) is now to be 'shaped' to minimize the step response characteristics of specific input/output pairs according to the maximum envelope violations. This problem is expressed as a vector valued optimization problem using the concept of Pareto optimality. We then investigate a scalar optimization problem associated with this vector valued problem and show that it is convex. The organization of the report is as follows. The next section includes some definitions and preliminary lemmas. We then give the problem statement which is followed by a section including a detailed development of the design procedure. We then consider an aircraft control example. The last section gives some concluding remarks. The Appendix includes the proofs of technical lemmas, printouts of computer programs, and figures.

Ozbay, Hitay↗

Integrating UniTree with the data migration API

The Data Migration Application Programming Interface (DMAPI) has the potential to allow developers of open systems Hierarchical Storage Management (HSM) products to virtualize native file systems without the requirement to make changes to the underlying operating system. This paper describes advantages of virtualizing native file systems in hierarchical storage management systems, the DMAPI at a high level, what the goals are for the interface, and the integration of the Convex UniTree+HSM with DMAPI along with some of the benefits derived in the resulting product.

Schrodel, David G.↗

Computerized Generation and Simulation of Meshing and Contact of New Type of Novikov-Wildhaber Helical Gears

In this report, we propose a new geometry for low-noise, increased-strength helical gears of the Novikov-Wildhaber type. Contact stresses are reduced as a result of their convex-concave gear tooth surfaces. The gear tooth surfaces are crowned in the profile direction to localize bearing contact and in the longitudinal direction to obtain a parabolic function of transmission errors. Such a function results in the reduction of noise and vibrations. Methods for the generation of the proposed gear tooth surfaces by grinding and hobbing are considered, and a tooth contact analysis (TCA) computer program to simulate meshing and contact is applied. The report also investigates the influence of misalignment on transmission errors and shift of bearing contact. Numerical examples to illustrate the developed approaches are proposed. The proposed geometry was patented by Ford/UIC (Serial Number 09-340-824, pending) on June 28, 1999.

Litvin, Faydor L.↗

Computer subroutines for the estimation of nuclear reaction effects in proton-tissue-dose calculations

Calculational methods for estimation of dose from external proton exposure of arbitrary convex bodies are briefly reviewed. All the necessary information for the estimation of dose in soft tissue is presented. Special emphasis is placed on retaining the effects of nuclear reaction, especially in relation to the dose equivalent. Computer subroutines to evaluate all of the relevant functions are discussed. Nuclear reaction contributions for standard space radiations are in most cases found to be significant. Many of the existing computer programs for estimating dose in which nuclear reaction effects are neglected can be readily converted to include nuclear reaction effects by use of the subroutines described herein.

Wilson, J. W.↗

Knots and entanglement

We extend the entanglement bootstrap program to (3+1)-dimensions. We study knotted excitations of (3+1)-dimensional liquid topological orders and exotic fusion processes of loops. As in previous work in (2+1)-dimensions [Ann. Phys. 418, 168164 (2020), Phys. Rev. B 103, 115150 (2021)], we define a variety of superselection sectors and fusion spaces from two axioms on the ground state entanglement entropy. In particular, we identify fusion spaces associated with knots. We generalize the information convex set to a new class of regions called immersed regions, promoting various theorems to this new context. Examples from solvable models are provided; for instance, a concrete calculation of knot multiplicity shows that the knot complement of a trefoil knot can store quantum information. We define spiral maps that allow us to understand consistency relations for torus knots as well as spiral fusions of fluxes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving the Dynamics-Aware Economic Dispatch Problem with the Koopman Operator

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, in contrast to T-ED, DED is a nonlinear, non-convex optimization problem that is computationally prohibitive to solve. We introduce a machine learning-based operator-theoretic approach for solving the DED problem efficiently. Specifically, we develop a novel discrete-time Koopman Operator (KO) formulation that embeds domain information into the structure of the KO to learn high-fidelity approximations of the generator dynamics. Using the KO approximation, the DED problem can be reformulated as a computationally tractable linear program (abbreviated DED-KO). We demonstrate the high solution quality and computational-time savings of the DED-KO model over the original DED formulation on a 9-bus test system.

King, Ethan↗

Using certification trails to achieve software fault tolerance

A conceptually novel and powerful technique to achieve fault tolerance in hardware and software systems is introduced. When used for software fault tolerance, this new technique uses time and software redundancy and can be outlined as follows. In the initial phase, a program is run to solve a problem and store the result. In addition, this program leaves behind a trail of data called a certification trail. In the second phase, another program is run which solves the original problem again. This program, however, has access to the certification trail left by the first program. Because of the availability of the certification trail, the second phase can be performed by a less complex program and can execute more quickly. In the final phase, the two results are accepted as correct; otherwise an error is indicated. An essential aspect of this approach is that the second program must always generate either an error indication or a correct output even when the certification trail it receives from the first program is incorrect. The certification trail approach to fault tolerance was formalized and it was illustrated by applying it to the fundamental problem of finding a minimum spanning tree. Cases in which the second phase can be run concorrectly with the first and act as a monitor are discussed. The certification trail approach was compared to other approaches to fault tolerance. Because of space limitations we have omitted examples of our technique applied to the Huffman tree, and convex hull problems. These can be found in the full version of this paper.

Sullivan, Gregory F.↗

Minimum Landing Error Powered-Descent Guidance for Planetary Missions

An algorithm improves the accuracy with which a lander can be delivered to the surface of Mars. The main idea behind this innovation is the use of a lossless convexification, which converts an otherwise non-convex constraint related to thruster throttling to a convex constraint, enabling convex optimization to be used. The convexification leads directly to an algorithm that guarantees finding the global optimum of the original nonconvex optimization problem with a deterministic upper bound on the number of iterations required for convergence. In this innovation, previous work in powered-descent guidance using convex optimization is extended to handle the case where the lander must get as close as possible to the target given the available fuel, but is not required to arrive exactly at the target. The new algorithm calculates the minimum-fuel trajectory to the target, if one exists, and calculates the trajectory that minimizes the distance to the target if no solution to the target exists. This approach poses the problem as two Second-Order Cone Programs, which can be solved to global optimality with deterministic bounds on the number of iterations required.

Blackmore, Lars↗

Novel Geometric Operations for Linear Programming

This report summarizes the work performed under the project "Linear Programming in Strongly Polynomial Time." Linear programming (LP) is a classic combinatorial optimization problem heavily used directly and as an enabling subroutine in integer programming (IP). Specifically IP is the same as LP except that some solution variables must take integer values (e.g. to represent yes/no decisions). Together LP and IP have many applications in resource allocation including general logistics, and infrastructure design and vulnerability analysis. The project was motivated by the PI's recent success developing methods to efficiently sample Voronoi vertices (essentially finding nearest neighbors in high-dimensional point sets) in arbitrary dimension. His method seems applicable to exploring the high-dimensional convex feasible space of an LP problem. Although the project did not provably find a strongly-polynomial algorithm, it explored multiple algorithm classes. The new medial simplex algorithms may still lead to solvers with improved provable complexity. We describe medial simplex algorithms and some relevant structural/complexity results. We also designed a novel parallel LP algorithm based on our geometric insights and implemented it in the Spoke-LP code. A major part of the computational step is many independent vector dot products. Our parallel algorithm distributes the problem constraints across processors. Current commercial and high-quality free LP solvers require all problem details to fit onto a single processor or multicore. Our new algorithm might enable the solution of problems too large for any current LP solvers. We describe our new algorithm, give preliminary proof-of-concept experiments, and describe a new generator for arbitrarily large LP instances.

97 MATHEMATICS AND COMPUTING↗

LARCRIM user's guide, version 1.0

LARCRIM is a relational database management system (RDBMS) which performs the conventional duties of an RDBMS with the added feature that it can store attributes which consist of arrays or matrices. This makes it particularly valuable for scientific data management. It is accessible as a stand-alone system and through an application program interface. The stand-alone system may be executed in two modes: menu or command. The menu mode prompts the user for the input required to create, update, and/or query the database. The command mode requires the direct input of LARCRIM commands. Although LARCRIM is an update of an old database family, its performance on modern computers is quite satisfactory. LARCRIM is written in FORTRAN 77 and runs under the UNIX operating system. Versions have been released for the following computers: SUN (3 & 4), Convex, IRIS, Hewlett-Packard, CRAY 2 & Y-MP.

Davis, John S.↗

Collaborative Decision Approach for Electricity Pricing-demand Response Stackelberg Game

Demand response programs are considered as a valuable resource in smart grids that provide several advantages of load shifting, peak load reduction, mediating intermittency of renewable energy integration, etc. Flexible price-based incentives have been recognized as a critical strategy in motivating and compensating consumers' load adjustment actions for successful implementation of demand response. Game theoretical approaches, especially Stackelberg games are popularly adopted to model the relationship between electricity price and customers' demand response and solved by the classical centralized backward induction (BI) method. However, the BI method generally requires convexity of the follower's model for necessary optimality conditions, and the computational time of any centralized approach increases sharply with larger problem instances. In this paper, the Stackelberg game of electricity pricing-demand response between a distribution system operator (DSO) and load aggregators (LAs) is decomposed based on a collaborative optimization (CO) framework, where each LA is treated as a discipline with its own domain constraints (e.g. building temperature control), while the DSO at the system level tries to reduce the solution discrepancy and guide the searching towards optimality. Several groups of comparison experiments have demonstrated the effectiveness of the proposed collaborative decision approach in solving the demand response game.

Chen, Yang↗

Volume serving and media management in a networked, distributed client/server environment

The E-Systems Modular Automated Storage System (EMASS) is a family of hierarchical mass storage systems providing complete storage/'file space' management. The EMASS volume server provides the flexibility to work with different clients (file servers), different platforms, and different archives with a 'mix and match' capability. The EMASS design considers all file management programs as clients of the volume server system. System storage capacities are tailored to customer needs ranging from small data centers to large central libraries serving multiple users simultaneously. All EMASS hardware is commercial off the shelf (COTS), selected to provide the performance and reliability needed in current and future mass storage solutions. All interfaces use standard commercial protocols and networks suitable to service multiple hosts. EMASS is designed to efficiently store and retrieve in excess of 10,000 terabytes of data. Current clients include CRAY's YMP Model E based Data Migration Facility (DMF), IBM's RS/6000 based Unitree, and CONVEX based EMASS File Server software. The VolSer software provides the capability to accept client or graphical user interface (GUI) commands from the operator's console and translate them to the commands needed to control any configured archive. The VolSer system offers advanced features to enhance media handling and particularly media mounting such as: automated media migration, preferred media placement, drive load leveling, registered MediaClass groupings, and drive pooling.

Herring, Ralph H.↗

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Ortiz, Francisco↗

Effect of Nozzle Curvature on Supersonic Gas Jets Used in Laser-Plasma Acceleration

Supersonic gas jets produced by converging-diverging (C-D) nozzles are commonly used as targets for laser-plasma acceleration (LPA) experiments. A major point of interest for these targets is the gas density at the region of interaction where the laser ionizes the gas plume to create a plasma, providing the acceleration structure. Tuning the density profiles at this interaction region is crucial to LPA optimization. A "flat-top" density profile is desired at this line of interaction to control laser propagation and high energy electron acceleration, while a short high-density profile is often preferred for acceleration of lower-energy tightly-focused laser-plasma interactions. A particular design parameter of interest is the curvature of the nozzle's diverging section. We examine three nozzle designs with different curvatures: the concave "bell", straight conical and convex "trumpet" nozzles. We demonstrate that, at mm-scale distances from the nozzle exit, the trumpet and straight nozzles, if optimized, produce "flat-top" density profiles whereas the bell nozzle creates focused regions of gas with higher densities. An optimization procedure for the trumpet nozzle is derived and compared to the straight nozzle optimization process. We find that the trumpet nozzle, by providing an extra parameter of control through its curvature, is more versatile for creating flat-top profiles and its optimization procedure is more refined compared to the straight nozzle and the straight nozzle optimization process. Furthermore, we present results for different nozzle designs from computational fluid dynamics (CFD) simulations performed with the program ANSYS Fluent and verify them experimentally using neutral density interferometry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Global optimization methods for engineering design

The problem is to find a global minimum for the Problem P. Necessary and sufficient conditions are available for local optimality. However, global solution can be assured only under the assumption of convexity of the problem. If the constraint set S is compact and the cost function is continuous on it, existence of a global minimum is guaranteed. However, in view of the fact that no global optimality conditions are available, a global solution can be found only by an exhaustive search to satisfy Inequality. The exhaustive search can be organized in such a way that the entire design space need not be searched for the solution. This way the computational burden is reduced somewhat. It is concluded that zooming algorithm for global optimizations appears to be a good alternative to stochastic methods. More testing is needed; a general, robust, and efficient local minimizer is required. IDESIGN was used in all numerical calculations which is based on a sequential quadratic programming algorithm, and since feasible set keeps on shrinking, a good algorithm to find an initial feasible point is required. Such algorithms need to be developed and evaluated.

Arora, Jasbir S.↗

NASA/USRA advanced space design program: The laser powered interorbital vehicle

A preliminary design is presented for a low-thrust Laser Powered Interorbital Vehicle (LPIV) intended for cargo transportation between an earth space station and a lunar base. The LPIV receives its power from two iodide laser stations, one orbiting the earth and the other located on the surface of the moon. The selected mission utilizes a spiral trajectory, characteristic of a low-thrust spacecraft, requiring 8 days for a lunar rendezvous and an additional 9 days for return. The ship's configuration consists primarily of an optical train, two hydrogen plasma engines, a 37.1 m box beam truss, a payload module, and fuel tanks. The total mass of the vehicle fully loaded is 63300 kg. A single plasma, regeneratively cooled engine design is incorporated into the two 500 N engines. These are connected to the spacecraft by turntables which allow the vehicle to thrust tangentially to the flight path. Proper collection and transmission of the laser beam to the thrust chambers is provided through the optical train. This system consists of the 23 m diameter primary mirror, a convex parabolic secondary mirror, a beam splitter and two concave parabolic tertiary mirrors. The payload bay is capable of carrying 18000 kg of cargo. The module is located opposite the primary mirror on the main truss. Fuel tanks carrying a maximum of 35000 kg of liquid hydrogen are fastened to tracks which allow the tanks to be moved perpendicular to the main truss. This capability is required to prevent the center of mass from moving out of the thrust vector line. The laser beam is located and tracked by means of an acquisition, pointing and tracking system which can be locked onto the space-based laser station. Correct orientation of the spacecraft with the laser beam is maintained by control moment gyros and reaction control rockets. Additionally an aerobrake configuration was designed to provide the option of using the atmospheric drag in place of propulsion for a return trajectory.

Source record↗

Volumetric Assessment of UPRITE Exercises From Marker-Based Motion Capture

BACKGROUND Lack of volumetric data on full-body movement of exercises presents a challenge to ensuring the fit of crew member’s full range of motion on the International Space Station (ISS). The Upright Proprioception Retention via In-flight Training and Evaluation (UPRITE) is a sensorimotor countermeasure device designed for maintaining crew members’ proprioception in a microgravity environment. A footplate—attached to a static base—rotates in two degrees of freedom (pitch and roll) up to a 20 deg angle. An initial volumetric assessment assuming an upright standing posture produced a cone-like shape with a narrow bottom and wide top. Such general volumetric assessments risk creating an overly conservative volume estimate, taking up more space than is necessary on the already limited interior space of the ISS, and neglecting necessary volume due to oversimplifying assumptions. Rather, higher-fidelity volumetric assessments offer more comprehensive insights in an environment where every area counts. The main objective of this work is to provide the spatial parameters of exercises on the UPRITE such that it is placed on the ISS according to its volumetric demands or that usage is adjusted to fit the available space. METHODS In 2023, a data collection was performed originally to inform loads and dynamics of system use and was recently leveraged for volumetric assessment. Three human subjects representing different body types (~63-76 inches in stature) performed a variety of board manipulations using UPRITE with body weight offload. The test collected the 3D positional data of a modified full-body Plug-in Gait marker set [1] via a 16-camera OptiTrack MoCap system. After processing – filling marker gaps and trimming data – in OptiTrack Motive, the recorded marker location data, which included device markers, was exported to a readable trajectory file. To accurately represent the full volume defining landmarks, additional markers were digitally added to an unscaled Modified Full Body Model [2]. The model was then scaled according to its subject parameters upon which an inverse kinematics analysis was performed. A custom plugin yielded model marker location data files. Volumetric analyses were performed on the recorded trajectory and model trajectory files using a custom Python-built tool that extracted the marker location data and plotted it in a 3D space. Concerned with only the maximum volume of the motion, a 3D convex hull analysis was applied to the plot, extracting the vertices or external points of the eventual 3D CAD output, dubbed aptly as a “volume shell”. This overall approach was based on guidance in a NASA-STD-3001 Technical Brief [3]. RESULTS AND DISCUSSION Batch volumetric assessment on the exercises for each subject was performed, producing high-fidelity volume shells in minimal time. Preliminary results highlighted the value in higher-fidelity volumes based on collected data when possible. For example, revolving a single posture in the cone assessment would not have sufficiently captured a single leg stance; rather, it would need to involve swinging the leg both forward and back. Additional observations and the maximal dimensions of the volumes, including those based on scaled data for ISS anthropometric requirements, will be presented at the Human Research Program Investigator’s Workshop. CONCLUSIONS While this work’s primary objective was for the UPRITE-to-ISS integration, the tool built to conduct this analysis has wide applications for future exercise systems as an informational tool for optimal device placement. The tool and its findings also have implications for exercise device design and spacecraft interior considerations on Gateway, the Lunar Pressurized Rover, and beyond. REFERENCES [1] Bell, C. A., et al. (2023) Recent Improvements and Verification of a Full Body Model in OpenSim. NASA Human Research Program Investigator’s Workshop. https://ntrs.nasa.gov/citations/20230001080 [2] Lostroscio, K., et al (2023) The Digital Astronaut Simulation. AHFE International Conference on Human Factors in Design, Engineering, and Computing for All. [3] Exercise Overview. (2023) NASA-STD-3001 Technical Brief. https://www.nasa.gov/wp-content/uploads/2023/12/ochmo-tb-031-exercise-overview.pdf?emrc=9d454c?emrc=9d454c

L D Quinto↗