Results for “problem solving complexity” — Page 11

NASA NTRS1990

Thick plate bending wave transmission using a mobility power flow approach

The mobility power flow (MPF) approach is used in this paper to describe the flexural behavior of an L-shaped plate structure consisting of thick plates with rotary inertia and shear deformation effects included in the analysis. The introduction of the thick plate effects significantly increases the complexity of the structural mobility functions used in the definitions of the power flow terms; however, because of the substructuring that is used in the MPF approach, the complexity of the problem is significantly reduced as compared to solving for the global structure. Additionally, with the MPF approach the modal behavior is described. The MPF analysis of the L-shaped plate is performed for the case of point force excitation on one plate, with the two plates being identical in both size and thickness. The results of this analysis are compared to results from the finite-element analysis (FEA) and the statistical energy analysis (SEA) and show very good agreement in the low- and high-frequency regimes, respectively.

Mccollum, M. D.↗

NASA NTRS1997

Improving Search Properties in Genetic Programming

With the advancing computer processing capabilities, practical computer applications are mostly limited by the amount of human programming required to accomplish a specific task. This necessary human participation creates many problems, such as dramatically increased cost. To alleviate the problem, computers must become more autonomous. In other words, computers must be capable to program/reprogram themselves to adapt to changing environments/tasks/demands/domains. Evolutionary computation offers potential means, but it must be advanced beyond its current practical limitations. Evolutionary algorithms model nature. They maintain a population of structures representing potential solutions to the problem at hand. These structures undergo a simulated evolution by means of mutation, crossover, and a Darwinian selective pressure. Genetic programming (GP) is the most promising example of an evolutionary algorithm. In GP, the structures that evolve are trees, which is a dramatic departure from previously used representations such as strings in genetic algorithms. The space of potential trees is defined by means of their elements: functions, which label internal nodes, and terminals, which label leaves. By attaching semantic interpretation to those elements, trees can be interpreted as computer programs (given an interpreter), evolved architectures, etc. JSC has begun exploring GP as a potential tool for its long-term project on evolving dextrous robotic capabilities. Last year we identified representation redundancies as the primary source of inefficiency in GP. Subsequently, we proposed a method to use problem constraints to reduce those redundancies, effectively reducing GP complexity. This method was implemented afterwards at the University of Missouri. This summer, we have evaluated the payoff from using problem constraints to reduce search complexity on two classes of problems: learning boolean functions and solving the forward kinematics problem. We have also developed and implemented methods to use additional problem heuristics to fine-tune the searchable space, and to use typing information to further reduce the search space. Additional improvements have been proposed, but they are yet to be explored and implemented.

Janikow, Cezary Z.↗

NASA NTRS1949

On the Theory of the Laval Nozzle

In the present paper, the motion of a gas in a plane-parallel Laval nozzle in the neighborhood of the transition from subsonic to supersonic velocities is studied. In a recently published paper, F. I. Frankl, applying the holograph method of Chaplygin, undertook a detailed investigation of the character of the flow near the line of transition from subsonic to supersonic velocities. From the results of Tricomi's investigation on the theory of differential equations of the mixed elliptic-hyperbolic type, Frankl introduced as one of the independent variables in place of the modulus of the velocity, a certain specially chosen function of this modulus. He thereby succeeded in explaining the character of the flow at the point of intersection of the transition line and the axis of symmetry (center of the nozzle) and in studying the behavior of the stream function in the neighborhood of this point by separating out the principal term having, together with its derivatives, the maximum value as compared with the corresponding corrections. This principal term is represented in Frankl's paper in the form of a linear combination of two hypergeometric functions. In order to find this linear combination, it is necessary to solve a number of boundary problems, which results in a complex analysis. In the investigation of the flow with which this paper is concerned, a second method is applied. This method is based on the transformation of the equations of motion to a form that may be called canonical for the system of differential equations of the mixed elliptic-hyperbolic type to which the system of equations of the motion of an ideal compressible fluid refers. By studying the behavior of the integrals of this system in the neighborhood of the parabolic line, the principal term of the solution is easily separated out in the form of a polynomial of the third degree. As a result, the computation of the transitional part of the nozzle is considerably simplified.

Falkovich, S. V.↗

NASA NTRSDate not supplied

Effects of Communication Delay on Human Spaceflight Missions

Missions onboard the International Space Station rely on the real-time availability of a large ground team of system experts to command the vehicle, solve safety-critical problems, and guide the crew during complex operations. Also, in Low Earth Orbit (LEO), supplies can be sent and crews evacuated quite quickly if needed. Future missions Beyond Low Earth Orbit (BLEO) will not have this 24/7, real-time safety net as communication latency increases, resupply difficulty increases, and evacuation opportunities diminish. There are few, if any, terrestrial analogs for human spaceflight missions BLEO that reflect the conditions—including extreme environments, long mission durations, and small crew sizes – that make these missions so high risk. Studies on specific conditions, such as communication delays and asynchronous interactions, have been performed in NASA Earth-based analog missions and have found that communication delays can disrupt ground-crew interactions and adversely impact team performance. However, there are gaps and limitations in studies conducted to date, notably on human spacecraft system failure response and recovery, the impacts of shorter lunar-relevant communication delays on complex operations, and the effectiveness of countermeasures. The work presented here breaks down real anomalies that occurred on ISS and Apollo missions and creates example scenarios fort Lunar Surface and Mars missions to explore the impact of communication delays of varying length on onboard operations and mission outcomes. Our analyses indicate that short communication delays (e.g., seconds to a minute) adversely impact the ability for ground to provide real-time oversight and guidance and to catch quickly emerging problems in time. Longer communication delays (e.g., up to 40 minutes on Mars missions) call for a shift of responsibility for tactical operations from ground to crew; crew must make time-critical decisions independently and respond to time-critical vehicle anomalies to prevent consequences.

human-systems integration↗

NASA NTRSDate not supplied

Effects of Communication Delay on Human Spaceflight Missions

Missions onboard the International Space Station rely on the real-time availability of a large ground team of system experts to command the vehicle, solve safety-critical problems, and guide the crew during complex operations. Also, in Low Earth Orbit (LEO), supplies can be sent and crews evacuated quite quickly if needed. Future missions Beyond Low Earth Orbit (BLEO) will not have this 24/7, real-time safety net as communication latency increases, resupply difficulty increases, and evacuation opportunities diminish. There are few, if any, terrestrial analogs for human spaceflight missions BLEO that reflect the conditions—including extreme environments, long mission durations, and small crew sizes – that make these missions so high risk. Studies on specific conditions, such as communication delays and asynchronous interactions, have been performed in NASA Earth-based analog missions and have found that communication delays can disrupt ground-crew interactions and adversely impact team performance. However, there are gaps and limitations in studies conducted to date, notably on human spacecraft system failure response and recovery, the impacts of shorter lunar-relevant communication delays on complex operations, and the effectiveness of countermeasures. The work presented here breaks down real anomalies that occurred on ISS and Apollo missions and creates example scenarios fort Lunar Surface and Mars missions to explore the impact of communication delays of varying length on onboard operations and mission outcomes. Our analyses indicate that short communication delays (e.g., seconds to a minute) adversely impact the ability for ground to provide real-time oversight and guidance and to catch quickly emerging problems in time. Longer communication delays (e.g., up to 40 minutes on Mars missions) call for a shift of responsibility for tactical operations from ground to crew; crew must make time-critical decisions independently and respond to time-critical vehicle anomalies to prevent consequences.

human-systems integration↗

NASA NTRS1992

A decomposition method for optimization of large-system reliability

This paper considers a decomposition approach for optimization of the reliability of a large system with a general network structure. A 3-level methodology is developed for optimal allocation of available resources among subsystems in order to ensure maximization of system-reliability. The decentralized nature of this methodology greatly reduces the complexity of the large problem and facilitates seeking the optimal solution. Two examples show that the complexity of a large system can be greatly reduced by solving several smaller-dimensional sub-problems iteratively. Sub-problems whose dimensions are small can be efficiently solved by any existing nonlinear programming method. Another important feature of this approach is the possible simplification of the objective function during the solution. This leads in some cases to an analytic solution for the lower-level optimization problems in a 3-level decomposition solution.

Li, Duan↗

NASA NTRS1989

The evaluative imaging of mental models - Visual representations of complexity

The paper deals with some design issues involved in building a system that could visually represent the semantic structures of training materials and their underlying mental models. In particular, hypermedia-based semantic networks that instantiate classification problem solving strategies are thought to be a useful formalism for such representations; the complexity of these web structures can be best managed through visual depictions. It is also noted that a useful approach to implement in these hypermedia models would be some metrics of conceptual distance.

Dede, Christopher↗

NASA NTRS1973

Robot, computer problem solving system

The TENEX computer system, the ARPA network, and computer language design technology was applied to support the complex system programs. By combining the pragmatic and theoretical aspects of robot development, an approach is created which is grounded in realism, but which also has at its disposal the power that comes from looking at complex problems from an abstract analytical point of view.

Becker, J. D.↗

NASA NTRS1998

Reveal, A General Reverse Engineering Algorithm for Inference of Genetic Network Architectures

Given the immanent gene expression mapping covering whole genomes during development, health and disease, we seek computational methods to maximize functional inference from such large data sets. Is it possible, in principle, to completely infer a complex regulatory network architecture from input/output patterns of its variables? We investigated this possibility using binary models of genetic networks. Trajectories, or state transition tables of Boolean nets, resemble time series of gene expression. By systematically analyzing the mutual information between input states and output states, one is able to infer the sets of input elements controlling each element or gene in the network. This process is unequivocal and exact for complete state transition tables. We implemented this REVerse Engineering ALgorithm (REVEAL) in a C program, and found the problem to be tractable within the conditions tested so far. For n = 50 (elements) and k = 3 (inputs per element), the analysis of incomplete state transition tables (100 state transition pairs out of a possible 10(exp 15)) reliably produced the original rule and wiring sets. While this study is limited to synchronous Boolean networks, the algorithm is generalizable to include multi-state models, essentially allowing direct application to realistic biological data sets. The ability to adequately solve the inverse problem may enable in-depth analysis of complex dynamic systems in biology and other fields.

Liang, Shoudan↗

NASA NTRS1996

Optimally Scaled H(sub infinity) Full Information Control Synthesis with Real Uncertainty

This paper presents an algorithm to synthesize optimal controllers for the scaled H(sub infinity). full information problem with real and complex uncertainty. The control problem is reduced to a linear matrix inequality which can be solved via a finite dimensional convex optimization. This technique is compared with the optimal scaled H(sub infinity). full information with only complex uncertainty and D - K iteration control design to synthesize controllers for a missile autopilot. Directly including real parametric uncertainty into the control design results in improved robust performance of the missile autopilot. The controller synthesized via D - K iteration achieves results similar to the optimal designs.

Balas, Gary J.↗

NASA NTRS1981

Operational considerations in utilization of microwave landing system approach and landing guidance

The characteristics of microwave landing system (MLS) equipment are reviewed and the flight performance of the terminal configured vehicle B-737 airplane during nearly five years of flight experience with MLS is summarized. Most of these flights involved curved, descending flight paths with automatic landings and final approaches as short as 0.44 n. mi. Possible uses to solve noise abatement problems with MLS equipment of varying degrees of complexity are discussed. It is concluded that altitude derived from MLS is superior to other sources near the airport traffic pattern.

White, W. F.↗

NASA NTRS1981

The role of the research simulator in the systems development of rotorcraft

Over the last 20 years, flight simulators became widely accepted as training tools. Moreover, research simulators were used extensively by the fixed-wing industry: in the design, testing, and certification of new aircraft. The rotorcraft industry, however, was slow to use man-in-the-loop simulation to solve its design problems, primarily because of the difficulty of modeling complex rotorcraft for realtime simulation and because of the need for a wide-angle visual system for low-level flight. A joint U.S. Army and NASA program was initiated to provide this simulation capability for exploitation by both government and industry. The potential application of the research simulator to future rotorcraft systems design, development, product improvement evaluations, and safety analysis is discussed.

Statler, I. C.↗

NASA NTRS1985

A Study on the Control of Third Generation Spacecraft

An overview of some studies which have recently been carried out on the control of third generation spcecraft, as modelled by the MSAT space vehicle configuration, is made. This spacecraft is highly nonsymmetrical and has appendages which cannot in general be assumed to be rigid. In particular, it is desired to design a controller for MSAT which stabilizes the system and satisfies certain attitude control, shape control, and possibly stationkeeping requirements; in addition, it is desired that the resultant controller should be robust and avoid any undesirable spill over effects. In addition, the controller obtained should have minimum complexity. The method of solution adopted to solve this class of problems is to formulate the problem as a robust servomechanism problem, and thence to obtain existence conditions and a controller characterization to solve the problem. The final controller obtained for MSAT has a distributed control configuration and appears to be quite satisfactory.

Davison, E. J.↗

NASA NTRS1991

AI techniques for a space application scheduling problem

Scheduling is a very complex optimization problem which can be categorized as an NP-complete problem. NP-complete problems are quite diverse, as are the algorithms used in searching for an optimal solution. In most cases, the best solutions that can be derived for these combinatorial explosive problems are near-optimal solutions. Due to the complexity of the scheduling problem, artificial intelligence (AI) can aid in solving these types of problems. Some of the factors are examined which make space application scheduling problems difficult and presents a fairly new AI-based technique called tabu search as applied to a real scheduling application. the specific problem is concerned with scheduling application. The specific problem is concerned with scheduling solar and stellar observations for the SOLar-STellar Irradiance Comparison Experiment (SOLSTICE) instrument in a constrained environment which produces minimum impact on the other instruments and maximizes target observation times. The SOLSTICE instrument will gly on-board the Upper Atmosphere Research Satellite (UARS) in 1991, and a similar instrument will fly on the earth observing system (Eos).

Thalman, N.↗

NASA NTRS1994

A linguistic geometry for space applications

We develop a formal theory, the so-called Linguistic Geometry, in order to discover the inner properties of human expert heuristics, which were successful in a certain class of complex control systems, and apply them to different systems. This research relies on the formalization of search heuristics of high-skilled human experts which allow for the decomposition of complex system into the hierarchy of subsystems, and thus solve intractable problems reducing the search. The hierarchy of subsystems is represented as a hierarchy of formal attribute languages. This paper includes a formal survey of the Linguistic Geometry, and new example of a solution of optimization problem for the space robotic vehicles. This example includes actual generation of the hierarchy of languages, some details of trajectory generation and demonstrates the drastic reduction of search in comparison with conventional search algorithms.

Stilman, Boris↗

NASA NTRS1998

Tetrahedral Finite-Volume Solutions to the Navier-Stokes Equations on Complex Configurations

A review of the algorithmic features and capabilities of the unstructured-grid flow solver USM3Dns is presented. This code, along with the tetrahedral grid generator, VGRIDns, is being extensively used throughout the U.S. for solving the Euler and Navier-Stokes equations on complex aerodynamic problems. Spatial discretization is accomplished by a tetrahedral cell-centered finite-volume formulation using Roe's upwind flux difference splitting. The fluxes are limited by either a Superbee or MinMod limiter. Solution reconstruction within the tetrahedral cells is accomplished with a simple, but novel, multidimensional analytical formula. Time is advanced by an implicit backward-Euler time-stepping scheme. Flow turbulence effects are modeled by the Spalart-Allmaras one-equation model, which is coupled with a wall function to reduce the number of cells in the near-wall region of the boundary layer. The issues of accuracy and robustness of USM3Dns Navier-Stokes capabilities are addressed for a flat-plate boundary layer, and a full F-16 aircraft with external stores at transonic speed.

Frink, Neal T.↗

NASA NTRS1998

Tetrahedral Finite-Volume Solutions to the Navier-Stokes Equations on Complex Configurations

A review of the algorithmic features and capabilities of the unstructured-grid flow solver USM3Dns is presented. This code, along with the tetrahedral grid generator, VGRIDns, is being extensively used throughout the U.S. for solving the Euler and Navier-Stokes equations on complex aerodynamic problems. Spatial discretization is accomplished by a tetrahedral cell-centered finite-volume formulation using Roe's upwind flux difference splitting. The fluxes are limited by either a Superbee or MinMod limiter. Solution reconstruction within the tetrahedral cells is accomplished with a simple, but novel, multidimensional analytical formula. Time is advanced by an implicit backward-Euler time-stepping scheme. Flow turbulence effects are modeled by the Spalart-Allmaras one-equation model, which is coupled with a wall function to reduce the number of cells in the near-wall region of the boundary layer. The issues of accuracy and robustness of USM3Dns Navier-Stokes capabilities are addressed for a flat-plate boundary layer, and a full F-16 aircraft with external stores at transonic speed.

Frink, N. T.↗

NASA NTRS2017

NASA Affordable Vehicle Avionics (AVA)

Small satellites are becoming ever more capable of performing valuable missions for both government and commercial customers. However, currently these satellites can be launched affordably only as secondary payloads. This makes it difficult for the small satellite mission to launch when needed, to the desired orbit, and with acceptable risk. What is needed is a class of low-cost launchers, so that launch costs to low-Earth orbit (LEO) are commensurate with payload costs. Several private and government-sponsored launch vehicle developers are working toward just that-the ability to affordably insert small payloads into LEO. But until now, cost of the complex avionics remained disproportionately high. AVA (Affordable Vehicle Avionics) solves this problem. Significant contributors to the cost of launching nanosatellites to orbit are the avionics and software systems that steer and control the launch vehicles, sequence stage separation, deploy payloads, and telemeter data. The high costs of these guidance, navigation and control (GNC) avionics systems are due in part to the current practice of developing unique, single-use hardware and software for each launch. High-performance, high-reliability inertial sensors components with heritage from legacy launchers also contribute to costs-but can low-cost commercial inertial sensors work just as well? NASA Ames Research Center has developed and tested a prototype low-cost avionics package for space launch vehicles that provides complete GNC functionality in a package smaller than a tissue box (100 millimeters by 120 millimeters by 69 millimeters; 4 inches by 4.7 inches by 2.7 inches), with a mass of less than 0.84 kilogram (2 pounds. AVA takes advantage of commercially available, low-cost, mass-produced, miniaturized sensors, filtering their more noisy inertial data with real-time GPS (Global Positioning Satellite) data. The goal of the AVA project is to produce and light-verify a common suite of avionics and software that deliver affordable, capable GNC and telemetry avionics with application to multiple nanolaunch vehicles at 1 percent of the cost of current state-of-the-art avionics.

space technology↗