Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem solving environment”

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 235 records · Page 13

Effect of heat rate constraint on minimum-fuel synergetic plane change

The synergetic plane change offers substantial fuel savings over the pure-propulsive alternative for certain noncoplanar orbital transfers. On the other hand, the thermal environment for a synergetic plane change vehicle can be quite severe. The minimum-fuel controls are computed approximately by parametrizing the controls and solving the resulting nonlinear programming problem. By considering several different levels of heat rate constraint, we characterize how the control strategy should be modified in order to keep the heat rate below the specified limit. Flight on the heat rate constraint boundary at high angle of attack is the key characteristic.

Mease, Kenneth D.↗

Efficient Agent-Based Cluster Ensembles

Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified clustering. Unfortunately current non-agent-based cluster combining methods do not work in a distributed environment, are not robust to corrupted clusterings and require centralized access to all original clusterings. Overcoming these issues will allow cluster ensembles to be used in fundamentally distributed and failure-prone domains such as data acquisition from satellite constellations, in addition to domains demanding confidentiality such as combining clusterings of user profiles. This paper proposes an efficient, distributed, agent-based clustering ensemble method that addresses these issues. In this approach each agent is assigned a small subset of the data and votes on which final cluster its data points should belong to. The final clustering is then evaluated by a global utility, computed in a distributed way. This clustering is also evaluated using an agent-specific utility that is shown to be easier for the agents to maximize. Results show that agents using the agent-specific utility can achieve better performance than traditional non-agent based methods and are effective even when up to 50% of the agents fail.

Agogino, Adrian↗

A Metric to Quantify Shared Visual Attention in Two-Person Teams

Introduction: Critical tasks in high-risk environments are often performed by teams, the members of which must work together efficiently. In some situations, the team members may have to work together to solve a particular problem, while in others it may be better for them to divide the work into separate tasks that can be completed in parallel. We hypothesize that these two team strategies can be differentiated on the basis of shared visual attention, measured by gaze tracking. 2) Methods: Gaze recordings were obtained for two-person flight crews flying a high-fidelity simulator (Gontar, Hoermann, 2014). Gaze was categorized with respect to 12 areas of interest (AOIs). We used these data to construct time series of 12 dimensional vectors, with each vector component representing one of the AOIs. At each time step, each vector component was set to 0, except for the one corresponding to the currently fixated AOI, which was set to 1. This time series could then be averaged in time, with the averaging window time (t) as a variable parameter. For example, when we average with a t of one minute, each vector component represents the proportion of time that the corresponding AOI was fixated within the corresponding one minute interval. We then computed the Pearson product-moment correlation coefficient between the gaze proportion vectors for each of the two crew members, at each point in time, resulting in a signal representing the time-varying correlation between gaze behaviors. We determined criteria for concluding correlated gaze behavior using two methods: first, a permutation test was applied to the subjects' data. When one crew member's gaze proportion vector is correlated with a random time sample from the other crewmember's data, a distribution of correlation values is obtained that differs markedly from the distribution obtained from temporally aligned samples. In addition to validating that the gaze tracker was functioning reasonably well, this also allows us to compute probabilities of coordinated behavior for each value of the correlation. As an alternative, we also tabulated distributions of correlation coefficients for synthetic data sets, in which the behavior was modeled as a first-order Markov process, and compared correlation distributions for identical processes with those for disparate processes, allowing us to choose criteria and estimate error rates. 3) Discussion: Our method of gaze correlation is able to measure shared visual attention, and can distinguish between activities involving different instruments. We plan to analyze whether pilots strategies of sharing visual attention can predict performance. Possible measurements of performance include expert ratings from instructors, fuel consumption, total task time, and failure rate. While developed for two-person crews, our approach can be applied to larger groups, using intra-class correlation coefficients instead of the Pearson product-moment correlation.

Gontar, Patrick↗

A Metric to Quantify Shared Visual Attention in Two-Person Teams

Critical tasks in high-risk environments are often performed by teams, the members of which must work together efficiently. In some situations, the team members may have to work together to solve a particular problem, while in others it may be better for them to divide the work into separate tasks that can be completed in parallel. We hypothesize that these two team strategies can be differentiated on the basis of shared visual attention, measured by gaze tracking.

Gontar, Patrick↗

Job Management Requirements for NAS Parallel Systems and Clusters

A job management system is a critical component of a production supercomputing environment, permitting oversubscribed resources to be shared fairly and efficiently. Job management systems that were originally designed for traditional vector supercomputers are not appropriate for the distributed-memory parallel supercomputers that are becoming increasingly important in the high performance computing industry. Newer job management systems offer new functionality but do not solve fundamental problems. We address some of the main issues in resource allocation and job scheduling we have encountered on two parallel computers - a 160-node IBM SP2 and a cluster of 20 high performance workstations located at the Numerical Aerodynamic Simulation facility. We describe the requirements for resource allocation and job management that are necessary to provide a production supercomputing environment on these machines, prioritizing according to difficulty and importance, and advocating a return to fundamental issues.

Saphir, William↗

The NASA Materials Science Research Program: It's New Strategic Goals and Opportunities

In the past year, the NASA s Office of Biological and Physical Research (OBPR) has formulated a long term plan to perform strategical and fundamental research bringing together physics, chemistry, biology, and engineering to solve problems needed for current and future agency mission goals. Materials Science is one of basic disciplines within the Enterprise s Division of Physical Sciences Research. The Materials Science Program participates to utilize effective use of International Space Station (ISS) and various world class ground laboratory facilities to solve new scientific and technology questions and transfer these results for public and agency benefits. The program has recently targeted new investigative research in strategic areas necessary to expand NASA knowledge base for exploration of the universe and some of these experiments will need access to the microgravity of space. The program is implementing a wide variety of traditional ground and flight based research related types of fundamental science related to materials crystallization, fundamental processing, and properties characterization in order to obtain basic understanding of various phenomena effects and relationships to the structures, processing, and properties of materials. , In addition new initiatives in radiation protection, materials for propulsion and In-space fabrication and repair focus on research helping the agency solve problems needed for future transportation into the solar system. A summary of the types and sources for this research is presented including those experiments planned for a low gravity environment. Areas to help expand the science basis for NASA future missions are described. An overview of the program is given including the scope of the current and future NASA Research Announcements with emphasis on new materials science initiatives. A description of the planned flight experiments to be conducted on the International Space Station program along with the planned facility class Materials Science Research Rack (MSRR) and Microgravity Glovebox (MSG) type investigations. Some initial results from the first three materials experiments are given.

Schlagheck, Ronald A.↗

Distributed Computing Framework for Synthetic Radar Application

We are developing an extensible software framework, in response to Air Force and NASA needs for distributed computing facilities for a variety of radar applications. The objective of this work is to develop a Python based software framework, that is the framework elements of the middleware that allows developers to control processing flow on a grid in a distributed computing environment. Framework architectures to date allow developers to connect processing functions together as interchangeable objects, thereby allowing a data flow graph to be devised for a specific problem to be solved. The Pyre framework, developed at the California Institute of Technology (Caltech), and now being used as the basis for next-generation radar processing at JPL, is a Python-based software framework. We have extended the Pyre framework to include new facilities to deploy processing components as services, including components that monitor and assess the state of the distributed network for eventual real-time control of grid resources.

synthetic aperture radar (SAR)↗

A knowledge-based system with learning for computer communication network design

Computer communication network design is well-known as complex and hard. For that reason, the most effective methods used to solve it are heuristic. Weaknesses of these techniques are listed and a new approach based on artificial intelligence for solving this problem is presented. This approach is particularly recommended for large packet switched communication networks, in the sense that it permits a high degree of reliability and offers a very flexible environment dealing with many relevant design parameters such as link cost, link capacity, and message delay.

Pierre, Samuel↗

Hot gas environment around STOVL aircraft in ground proximity. II - Numerical study

Ingestion of hot exhaust gases by the engines of STOVL aircraft has been an important research problem for several years. The hot gas environment around STOVL aircraft is three-dimensional and turbulent. In this study, the Navier-Stokes equations governing the hot gas ingestion flowfield are solved by an efficient finite-difference calculation procedure. The complete geometry including the head wind and the fuselage is simulated. Four demonstration calculations with variations in the height of the fuselage and the head wind velocity are presented. It is shown that the calculation procedure efficiently provides a solution to the governing equations and produces realistic descriptions of the flow and temperature fields.

Tafti, D. K.↗

Using a Portfolio of Algorithms for Planning and Scheduling

The Automated Scheduling and Planning Environment (ASPEN) software system, aspects of which have been reported in several previous NASA Tech Briefs articles, includes a subsystem that utilizes a portfolio of heuristic algorithms that work synergistically to solve problems. The nature of the synergy of the specific algorithms is that their likelihoods of success are negatively correlated: that is, when a combination of them is used to solve a problem, the probability that at least one of them will succeed is greater than the sum of probabilities of success of the individual algorithms operating independently of each other. In ASPEN, the portfolio of algorithms is used in a planning process of the iterative repair type, in which conflicts are detected and addressed one at a time until either no conflicts exist or a user-defined time limit has been exceeded. At each choice point (e.g., selection of conflict; selection of method of resolution of conflict; or choice of move, addition, or deletion) ASPEN makes a stochastic choice of a combination of algorithms from the portfolio. This approach makes it possible for the search to escape from looping and from solutions that are locally but not globally optimum.

Sherwood, Robert↗

Research on blackboard architectures at the Heuristic Programming Project (HPP)

Researchers are entering the second decade of research in the Blackboard problem solving framework with focus in the following areas: (1) extensions to the basic concepts implemented in AGE-1 to address, for example, reasoning with uncertain data; (2) a new architecture and development environment, BB1, that implements methods for explicity controlling the reasoning; and (3) the design of and experimentation with multiprocessor architectures using the Blackboard as an organizing framework. A summary of these efforts is presented.

Nii, H. Penny↗

An efficient three-dimensional Poisson solver for SIMD high-performance-computing architectures

We present an algorithm that solves the three-dimensional Poisson equation on a cylindrical grid. The technique uses a finite-difference scheme with operator splitting. This splitting maps the banded structure of the operator matrix into a two-dimensional set of tridiagonal matrices, which are then solved in parallel. Our algorithm couples FFT techniques with the well-known ADI (Alternating Direction Implicit) method for solving Elliptic PDE's, and the implementation is extremely well suited for a massively parallel environment like the SIMD architecture of the MasPar MP-1. Due to the highly recursive nature of our problem, we believe that our method is highly efficient, as it avoids excessive interprocessor communication.

Cohl, H.↗

A Framework for a Supervisory Expert System for Robotic Manipulators with Joint-Position Limits and Joint-Rate Limits

This report addresses the problem of path planning and control of robotic manipulators which have joint-position limits and joint-rate limits. The manipulators move autonomously and carry out variable tasks in a dynamic, unstructured and cluttered environment. The issue considered is whether the robotic manipulator can achieve all its tasks, and if it cannot, the objective is to identify the closest achievable goal. This problem is formalized and systematically solved for generic manipulators by using inverse kinematics and forward kinematics. Inverse kinematics are employed to define the subspace, workspace and constrained workspace, which are then used to identify when a task is not achievable. The closest achievable goal is obtained by determining weights for an optimal control redistribution scheme. These weights are quantified by using forward kinematics. Conditions leading to joint rate limits are identified, in particular it is established that all generic manipulators have singularities at the boundary of their workspace, while some have loci of singularities inside their workspace. Once the manipulator singularity is identified the command redistribution scheme is used to compute the closest achievable Cartesian velocities. Two examples are used to illustrate the use of the algorithm: A three link planar manipulator and the Unimation Puma 560. Implementation of the derived algorithm is effected by using a supervisory expert system to check whether the desired goal lies in the constrained workspace and if not, to evoke the redistribution scheme which determines the constraint relaxation between end effector position and orientation, and then computes optimal gains.

Mutambara, Arthur G. O.↗

Dynamic Load-Balancing for Distributed Heterogeneous Computing of Parallel CFD Problems

The developed methodology is aimed at improving the efficiency of executing block-structured algorithms on parallel, distributed, heterogeneous computers. The basic approach of these algorithms is to divide the flow domain into many sub- domains called blocks, and solve the governing equations over these blocks. Dynamic load balancing problem is defined as the efficient distribution of the blocks among the available processors over a period of several hours of computations. In environments with computers of different architecture, operating systems, CPU speed, memory size, load, and network speed, balancing the loads and managing the communication between processors becomes crucial. Load balancing software tools for mutually dependent parallel processes have been created to efficiently utilize an advanced computation environment and algorithms. These tools are dynamic in nature because of the chances in the computer environment during execution time. More recently, these tools were extended to a second operating system: NT. In this paper, the problems associated with this application will be discussed. Also, the developed algorithms were combined with the load sharing capability of LSF to efficiently utilize workstation clusters for parallel computing. Finally, results will be presented on running a NASA based code ADPAC to demonstrate the developed tools for dynamic load balancing.

Ecer, A.↗

A Concurrent Distributed System for Aircraft Tactical Decision Generation

A research program investigating the use of artificial intelligence (AI) techniques to aid in the development of a Tactical Decision Generator (TDG) for Within Visual Range (WVR) air combat engagements is discussed. The application of AI programming and problem solving methods in the development and implementation of a concurrent version of the Computerized Logic For Air-to-Air Warfare Simulations (CLAWS) program, a second generation TDG, is presented. Concurrent computing environments and programming approaches are discussed and the design and performance of a prototype concurrent TDG system are presented.

McManus, John W.↗

Benefit Assessment of the Integrated Demand Management Concept for Multiple New York Metroplex Airports

Benefits of the Integrated Demand Management (IDM) concept were assessed utilizing a newly developed automated simulation capability called ‘Traffic Management Initiative Automated Simulation (TMIAutoSim).’ The IDM concept focuses on improving traffic flow management (TFM) by coordinating the FAA’s strategic Traffic Flow Management System (TFMS) with its more tactical Time-Based Flow Management (TBFM) system. The IDM concept leverages a new TFMS capability called Collaborative Trajectory Options Program (CTOP) to strategically pre-condition traffic demand flowing into a TBFM-managed arrival environment, where TBFM is responsible for tactically managing traffic by generating precise arrival schedules. The IDM concept was developed over a multi-year effort, focusing on solving New York metroplex airport arrival problems. TMIAutoSim closely mimics NASA’s high-fidelity simulation capabilities while enabling more data to be collected at higher speed. Using this new capability, the IDM concept was evaluated using realistic traffic across various weather scenarios. Six representative weather days were selected after clustering three months of historical data. For those selected six days, Newark Liberty International Airport (EWR) and LaGuardia Airport (LGA) arrival traffic scenarios were developed. For each selected day, the historical data were analyzed to accurately simulate actual operations and the weather impact of the day. The current day operations and the IDM concept operations were simulated for the same weather scenarios and the results were compared. The selected six days were categorized into two groups: ‘clear weather’ for days without Ground Delay Programs (GDP) and ‘convective weather’ for days with GDP and significant weather around New York metroplex airports. For the clear weather scenarios, IDM operations reduced last minute, unanticipated departure delays for short-haul flights within TBFM control boundaries with minimal to no impact on throughput and total delay. For the convective weather scenarios, IDM significantly reduced delays and increased throughput to the destination airports.

Traffic Management Initiative Automated Simulation↗

"Virtual Cockpit Window" for a Windowless Aerospacecraft

A software system processes navigational and sensory information in real time to generate a three-dimensional-appearing image of the external environment for viewing by crewmembers of a windowless aerospacecraft. The design of the particular aerospacecraft (the X-38) is such that the addition of a real transparent cockpit window to the airframe would have resulted in unacceptably large increases in weight and cost. When exerting manual control, an aircrew needs to see terrain, obstructions, and other features around the aircraft in order to land safely. The X-38 is capable of automated landing, but even when this capability is utilized, the crew still needs to view the external environment: From the very beginning of the United States space program, crews have expressed profound dislike for windowless vehicles. The wellbeing of an aircrew is considerably promoted by a three-dimensional view of terrain and obstructions. The present software system was developed to satisfy the need for such a view. In conjunction with a computer and display equipment that weigh less than would a real transparent window, this software system thus provides a virtual cockpit window. The key problem in the development of this software system was to create a realistic three-dimensional perspective view that is updated in real time. The problem was solved by building upon a pre-existing commercial program LandForm C3 that combines the speed of flight-simulator software with the power of geographic-information-system software to generate real-time, three-dimensional-appearing displays of terrain and other features of flight environments. In the development of the present software, the pre-existing program was modified to enable it to utilize real-time information on the position and attitude of the aerospacecraft to generate a view of the external world as it would appear to a person looking out through a window in the aerospacecraft. The development included innovations in realistic horizon-limit modeling, three-dimensional stereographic display, and interfaces for utilization of data from inertial-navigation devices, Global Positioning System receivers, and laser rangefinders.

Abernathy, Michael F.↗

Preventing Ventilation On Sailboard Skegs

Design effort undertaken to solve spinout problem plaguing high-performance sailboards. Proposed skeg section designed by use of computer model of pressure field and boundary layer. Prevents ventilation by maintaining attached boundary-layer flow throughout operating environment. Cavitation also avoided by preventing valleys in pressure distribution while skeg operated throughout its range.

Caldwell, Richard A.↗