Search NASA⌕ Search

SEARCH · Search NASA

Results for “Standard Problem”

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 361 records · Page 20

SUBOPT: A CAD program for suboptimal linear regulators

An interactive software package which provides design solutions for both standard linear quadratic regulator (LQR) and suboptimal linear regulator problems is described. Intended for time-invariant continuous systems, the package is easily modified to include sampled-data systems. LQR designs are obtained by established techniques while the large class of suboptimal problems containing controller and/or performance index options is solved using a robust gradient minimization technique. Numerical examples demonstrate features of the package and recent developments are described.

Fleming, P. J.↗

The Multimission Image Processing Laboratory's virtual frame buffer interface

Large image processing systems use multiple frame buffers with differing architectures and vendor supplied interfaces. This variety of architectures and interfaces creates software development, maintenance and portability problems for application programs. Several machine-dependent graphics standards such as ANSI Core and GKS are available, but none of them are adequate for image processing. Therefore, the Multimission Image Processing laboratory project has implemented a programmer level virtual frame buffer interface. This interface makes all frame buffers appear as a generic frame buffer with a specified set of characteristics. This document defines the virtual frame uffer interface and provides information such as FORTRAN subroutine definitions, frame buffer characteristics, sample programs, etc. It is intended to be used by application programmers and system programmers who are adding new frame buffers to a system.

Wolfe, T.↗

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

Combustion and fires in low gravity

Fire safety always receives priority attention in NASA mission designs and operations, with emphasis on fire prevention and material acceptance standards. Recently, interest in spacecraft fire-safety research and development has increased because improved understanding of the significant differences between low-gravity and normal-gravity combustion suggests that present fire-safety techniques may be inadequate or, at best, non-optimal; and the complex and permanent orbital operations in Space Station Freedom demand a higher level of safety standards and practices. This presentation outlines current practices and problems in fire prevention and detection for spacecraft, specifically the Space Station Freedom's fire protection. Also addressed are current practices and problems in fire extinguishment for spacecraft.

Friedman, Robert↗

Pilot interaction with cockpit automation 2: An experimental study of pilots' model and awareness of the Flight Management System

Technological developments have made it possible to automate more and more functions on the commercial aviation flight deck and in other dynamic high-consequence domains. This increase in the degrees of freedom in design has shifted questions away from narrow technological feasibility. Many concerned groups, from designers and operators to regulators and researchers, have begun to ask questions about how we should use the possibilities afforded by technology skillfully to support and expand human performance. In this article, we report on an experimental study that addressed these questions by examining pilot interaction with the current generation of flight deck automation. Previous results on pilot-automation interaction derived from pilot surveys, incident reports, and training observations have produced a corpus of features and contexts in which human-machine coordination is likely to break down (e.g., automation surprises). We used these data to design a simulated flight scenario that contained a variety of probes designed to reveal pilots' mental model of one major component of flight deck automation: the Flight Management System (FMS). The events within the scenario were also designed to probe pilots' ability to apply their knowledge and understanding in specific flight contexts and to examine their ability to track the status and behavior of the automated system (mode awareness). Although pilots were able to 'make the system work' in standard situations, the results reveal a variety of latent problems in pilot-FMS interaction that can affect pilot performance in nonnormal time critical situations.

Sarter, Nadine B.↗

Convergence Acceleration for Multistage Time-Stepping Schemes

The convergence of a Runge-Kutta (RK) scheme with multigrid is accelerated by preconditioning with a fully implicit operator. With the extended stability of the Runge-Kutta scheme, CFL numbers as high as 1000 could be used. The implicit preconditioner addresses the stiffness in the discrete equations associated with stretched meshes. Numerical dissipation operators (based on the Roe scheme, a matrix formulation, and the CUSP scheme) as well as the number of RK stages are considered in evaluating the RK/implicit scheme. Both the numerical and computational efficiency of the scheme with the different dissipation operators are discussed. The RK/implicit scheme is used to solve the two-dimensional (2-D) and three-dimensional (3-D) compressible, Reynolds-averaged Navier-Stokes equations. In two dimensions, turbulent flows over an airfoil at subsonic and transonic conditions are computed. The effects of mesh cell aspect ratio on convergence are investigated for Reynolds numbers between 5.7 x 10(exp 6) and 100.0 x 10(exp 6). Results are also obtained for a transonic wing flow. For both 2-D and 3-D problems, the computational time of a well-tuned standard RK scheme is reduced at least a factor of four.

Swanson, R. C.↗

A Convex Guidance Algorithm for Formation Reconfiguration

In this paper, a reconfiguration guidance algorithm for formation flying spacecraft is presented. The formation reconfiguration guidance problem is first formulated as a continuous-time minimum-fuel or minimum-energy optimal control problem with collision avoidance and control constraints. The optimal control problem is then discretized to obtain a finite dimensional parameter optimization problem. In this formulation, the collision avoidance constraints are imposed via separating planes between each pair of spacecraft. A heuristic is introduced to choose these separating planes that leads to the convexification of the collision avoidance constraints. Additionally, convex constraints are imposed to guarantee that no collisions occur between discrete time samples. The resulting finite dimensional optimization problem is a second order cone program, for which standard algorithms can compute the global optimum with deterministic convergence and a prescribed level of accuracy. Consequently, the formation reconfiguration algorithm can be implemented onboard a spacecraft for real-time operations.

formation reconfiguration↗

New Software for Predicting Charging of Spacecraft

Charging System Analyzer Program (Nascap-2K) is a comprehensive update, revision, and extension of several NASA and Air Force codes for predicting electrical charging of spacecraft. Nascap-2K integrates the capabilities and models included in four independent programs: NASCAP/LEO for low-Earth orbits, NASCAP/GEO for geosynchronous orbits, POLAR for auroral charging in polar orbits, and DynaPAC (Dynamic Plasma Analysis Code) for time-dependent plasma interactions. While each of the earlier codes works well for the range of problems for which it was designed, by today s standards these codes are difficult to learn, cumbersome to use, and overly restrictive in their geometric modeling capabilities. Nascap-2K incorporates these models into a single software package that includes spacecraft surface modeling, spatial gridding, environmental specifications, calculating scripting, and post-processing analysis and visualization. The provided material properties database includes values from earlier programs as well as values from recent measurements. Development of Nascap-2K continues with future capabilities to include interactions with dense plasma such as those produced by electric propulsion.

Mandell, Myron↗

Coilgun Acceleration Model Containing Multiple Interacting Coils

A coilgun operates by pulsing current through an axially-arranged series of independently-controlled coils inductively interacting with a small, electrically-conductive, azimuthally-symmetric projectile to accelerate it to high velocities. The electrical circuits are programmed to pulse current through the coils in such a way so as to impart further electromagnetic acceleration in each stage. A method is developed to calculate the mutual inductance between the coils and between each coil and the projectile. These terms are used to write a system of first-order ordinary differential equations governing the projectile velocity and the current flow in each coil. While the inclusion of the electromagnetic interactions between coils significantly complicates the equation set as more coil sets are included in the problem, casting the problem symbolically in mass matrix form permits solution using standard numerical Runge-Kutta techniques. Comparing a projectile with a single-turn to that comprised of nine-turns, the inductance of the former is much smaller, but this leads to a greater induced projectile current. The lower inductance and greater current appear to offset each other with little difference in the acceleration profile for the two cases. For the limited cases studied, coils with a discharge half-cycle equal to the time for a projectile to transit from one coil to the next yield increased efficiency.

Polzin, Kurt A.↗

Incompressible Navier-Stokes Computations with Heat Transfer

The existing pseudocompressibility method for the system of incompressible Navier-Stokes equations is extended to heat transfer problems by including the energy equation. The solution method is based on the pseudo compressibility approach and uses an implicit-upwind differencing scheme together with the Gauss-Seidel line relaxation method. Current computations use one-equation Baldwin-Barth turbulence model which is derived from a simplified form of the standard k-epsilon model equations. Both forced and natural convection problems are examined. Numerical results from turbulent reattaching flow behind a backward-facing step will be compared against experimental measurements for the forced convection case. The validity of Boussinesq approximation to simplify the buoyancy force term will be investigated. The natural convective flow structure generated by heat transfer in a vertical rectangular cavity will be studied. The numerical results will be compared by experimental measurements by Morrison and Tran.

Kiris, Cetin↗

Monte Carlo inversion of seismic data

The analytic solution to the linear inverse problem provides estimates of the uncertainty of the solution in terms of standard deviations of corrections to a particular solution, resolution of parameter adjustments, and information distribution among the observations. It is shown that Monte Carlo inversion, when properly executed, can provide all the same kinds of information for nonlinear problems. Proper execution requires a relatively uniform sampling of all possible models. The expense of performing Monte Carlo inversion generally requires strategies to improve the probability of finding passing models. Such strategies can lead to a very strong bias in the distribution of models examined unless great care is taken in their application.

Wiggins, R. A.↗

Joint Chance-Constrained Dynamic Programming

This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.

Ono, Masahiro↗

Geometric representation methods for multi-type self-defining remote sensing data sets

Efficient and convenient representation of remote sensing data is highly important for an effective utilization. The task of merging different data types is currently dealt with by treating each case as an individual problem. A description is provided of work which is carried out to standardize the multidata merging process. The basic concept of the new approach is that of the self-defining data set (SDDS). The creation of a standard is proposed. This standard would be such that data which may be of interest in a large number of earth resources remote sensing applications would be in a format which allows convenient and automatic merging. Attention is given to details regarding the multidata merging problem, a geometric description of multitype data sets, image reconstruction from track-type data, a data set generation system, and an example multitype data set.

Anuta, P. E.↗

Apollo experience report: Spacecraft structural windows

The window structural design and verification experience is presented for the Apollo command and lunar modules. This report presents window design philosophy, design criteria, hardware description, and qualification and acceptance test programs and discusses the problems encountered and solutions developed in these areas. The structural characteristics of glass are not generally well understood by designers. The optics and instrument glass covers were not considered to be structural components and thus were not normally subjected to the design, qualification, and acceptance standards necessary to preclude failures. These two factors contributed significantly to window problems on both Apollo spacecraft.

Pigg, O. E.↗

Application of Computer Tomography for Life Detection

Perhaps one of the most fundamentally difficult challenges facing those who would search for life is that of scale determination. Spatial scales of life on Earth range over more than 15 orders of magnitude in mass and volume, and more than 8 orders of magnitude in 2 dimensional space. If the distribution of life is sparse in comparison to the background on which it is found, then the choice of the right scale is critical to finding that life. But how does one identify the proper scale? To put this in other words, how does one recognize the "haystacks" in which the needles (biosignatures and evidence of life) might be most profitably searched for? The problem is further exacerbated when conditions get extreme because much of the life moves from the clement surface environment into the pores and more clement environments inside of rocks, minerals and soils. Once encased in their lithic homes, these microbes become nearly impossible to study by standard techniques because of the opacity of the rocks. It is this problem that we propose to address in the work proposed here. Computer Tomography (CT) has been a very valuable tool in medicine, where the best resolution available has typically been of the order of about 0.5 mm. However, to adapt the approach for life detection of microbial endoliths, the resolution needs to be moved to the micrometer and even submicrometer levels. Thus for the studies proposed here, we begin with a commercially available instrument that can yield resolution of approximately 10 micrometers. The rational for this is twofold: first, this is the "state of the art" in laboratory instruments; and second, that while the usual size of a microbial cell is about 1 micron, microorganisms tend to live in communities that usually exceed the 10 micrometer size range. The resolution also depends on the sample size itself, so having a small lab instrument into which small samples can be placed will be beneficial to the resolution. We have now used several different CT systems, beginning with the medical scanners (Arcadia CT group) for the detection of layered communities in sandstone rocks from Antarctica. Even this crude instrument was able to point to the areas of the rock that were dominated by microbial populations - this provides the critical first information that says, "Go back and look at these sites with other methods." We showed that without sample preparation or destruction it was possible to gain knowledge as to the presence of density differences suggestive of life.

Tsapin, A.↗

Investigations into the shape-preserving interpolants using symbolic computation

Shape representation is a central issue in computer graphics and computer-aided geometric design. Many physical phenomena involve curves and surfaces that are monotone (in some directions) or are convex. The corresponding representation problem is given some monotone or convex data, and a monotone or convex interpolant is found. Standard interpolants need not be monotone or convex even though they may match monotone or convex data. Most of the methods of investigation of this problem involve the utilization of quadratic splines or Hermite polynomials. In this investigation, a similar approach is adopted. These methods require derivative information at the given data points. The key to the problem is the selection of the derivative values to be assigned to the given data points. Schemes for choosing derivatives were examined. Along the way, fitting given data points by a conic section has also been investigated as part of the effort to study shape-preserving quadratic splines.

Lam, Maria↗

Accelerating Continuous Variable Coherent Ising Machines Via Momentum

The Coherent Ising Machine (CIM) is a non-conventional architecture that takes inspiration from physical annealing processes to solve Ising problems heuristically. Its dynamics are naturally continuous and described by a set of ordinary differential equations that have been proven to be useful for the optimization of continuous variables nonconvex quadratic optimization problems. The dynamics of such Continuous Variable CIMs (CV-CIM) encourage optimization via optical pulses whose amplitudes are determined by the negative gradient of the objective; however, standard gradient descent is known to be trapped by local minima and hampered by poor problem conditioning. In this work, we propose to modify the CV-CIM dynamics using more sophisticated pulse injections based on tried-and-true optimization techniques such as momentum and Adam. Through numerical experiments, we show that the momentum and Adam updates can significantly speed up the CV-CIM’s convergence and improve sample diversity over the original CV-CIM dynamics. We also find that the Adam-CV-CIM’s performance is more stable as a function of feedback strength, especially on poorly conditioned instances, resulting in an algorithm that is more robust, reliable, and easily tunable. More broadly, we identify the CIM dynamical framework as a fertile opportunity for exploring the intersection of classical optimization and modern analog computing.

Ising Model↗