Search NASASearch

SEARCH · Search NASA

Results for “Problem Solving”

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 199 records · Page 11

Expert system technology

The expert system is a computer program which attempts to reproduce the problem-solving behavior of an expert, who is able to view problems from a broad perspective and arrive at conclusions rapidly, using intuition, shortcuts, and analogies to previous situations. Expert systems are a departure from the usual artificial intelligence approach to problem solving. Researchers have traditionally tried to develop general modes of human intelligence that could be applied to many different situations. Expert systems, on the other hand, tend to rely on large quantities of domain specific knowledge, much of it heuristic. The reasoning component of the system is relatively simple and straightforward. For this reason, expert systems are often called knowledge based systems. The report expands on the foregoing. Section 1 discusses the architecture of a typical expert system. Section 2 deals with the characteristics that make a problem a suitable candidate for expert system solution. Section 3 surveys current technology, describing some of the software aids available for expert system development. Section 4 discusses the limitations of the latter. The concluding section makes predictions of future trends.

Prince, Mary Ellen

Reflections on the relationship between artificial intelligence and operations research

Historically, part of Artificial Intelligence's (AI's) roots lie in Operations Research (OR). How AI has extended the problem solving paradigm developed in OR is explored. In particular, by examining how scheduling problems are solved using OR and AI, it is demonstrated that AI extends OR's model of problem solving through the opportunistic use of knowledge, problem reformulation and learning.

Fox, Mark S.

Balancing antagonistic time and resource utilization constraints in over-subscribed scheduling problems

In this paper, we report work aimed at applying concepts of constraint-based problem structuring and multi-perspective scheduling to an over-subscribed scheduling problem. Previous research has demonstrated the utility of these concepts as a means for effectively balancing conflicting objectives in constraint-relaxable scheduling problems, and our goal here is to provide evidence of their similar potential in the context of HST observation scheduling. To this end, we define and experimentally assess the performance of two time-bounded heuristic scheduling strategies in balancing the tradeoff between resource setup time minimization and satisfaction of absolute time constraints. The first strategy considered is motivated by dispatch-based manufacturing scheduling research, and employs a problem decomposition that concentrates local search on minimizing resource idle time due to setup activities. The second is motivated by research in opportunistic scheduling and advocates a problem decomposition that focuses attention on the goal activities that have the tightest temporal constraints. Analysis of experimental results gives evidence of differential superiority on the part of each strategy in different problem solving circumstances. A composite strategy based on recognition of characteristics of the current problem solving state is then defined and tested to illustrate the potential benefits of constraint-based problem structuring and multi-perspective scheduling in over-subscribe scheduling problems.

Smith, Stephen F.

Explorations of Quantum-Classical Approaches to Scheduling a Mars Lander Activity Problem

An effective approach to solving problems involving mixed (continuous and discrete) variables and constraints, such as hybrid systems, is to decompose them into subproblems and integrate dedicated solvers geared toward those subproblems. Here, we introduce a new framework based on a tree search algorithm to solve hybrid discrete-continuous problems that incorporates: (1) a quantum annealer that samples from the configuration space for the discrete portion and provides information about the quality of the samples, and (2) a classical computer that makes use of information from the quantum annealer to prune and focus the search as well as check a continuous constraint. We consider four variants of our algorithm, each with progressively more guidance from the results provided by the quantum annealer. We empirically test our algorithm and compare the variants on a simplified Mars Lander task scheduling problem. Variants with more guidance from the quantum annealer have better performance.

scheduling

Design and Analysis Techniques for Concurrent Blackboard Systems

Blackboard systems are a natural progression of knowledge-based systems into a more powerful problem solving technique. They provide a way for several highly specialized knowledge sources to cooperate to solve large, complex problems. Blackboard systems incorporate the concepts developed by rule-based and expert systems programmers and include the ability to add conventionally coded knowledge sources. The small and specialized knowledge sources are easier to develop and test, and can be hosted on hardware specifically suited to the task that they are solving. The Formal Model for Blackboard Systems was developed to provide a consistent method for describing a blackboard system. A set of blackboard system design tools has been developed and validated for implementing systems that are expressed using the Formal Model. The tools are used to test and refine a proposed blackboard system design before the design is implemented. My research has shown that the level of independence and specialization of the knowledge sources directly affects the performance of blackboard systems. Using the design, simulation, and analysis tools, I developed a concurrent object-oriented blackboard system that is faster, more efficient, and more powerful than existing systems. The use of the design and analysis tools provided the highly specialized and independent knowledge sources required for my concurrent blackboard system to achieve its design goals.

Mcmanus, John William

Solution of Third Computational Workshop Internal Propagation Problems using Low Order Schemes

The problems solved are propagation of sound waves through a transonic nozzle and shock-sound interaction. The first problem is solved using a MacCormack scheme. The second problem is solved by perturbation of a conservative Euler equation solution to the steady state. The problems are solved on evenly spaced grids. While solutions were found, the methods selected and not using stretched grids lead to solutions which do not compare well with those found using more accurate schemes. However, the perturbation of the mean flow scheme used to solve the second problem shows promise.

Miles, Jeffrey Hilton

Faster solutions to the interdiction defense problem using suboptimal solutions

The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. Here, we build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that return suboptimal solutions at no additional computation cost. We derive novel cuts from suboptimal solutions, reducing the number of iterations required for the algorithm to converge while maintaining optimality guarantees. We also present a heuristic that utilizes all obtained suboptimal solutions to select the next defense to evaluate at each iteration. We perform computational experiments applied to power grid interdiction on standard test cases. Our results demonstrate that the BRI-SS algorithm consistently outperforms the BRI algorithm across all test cases.

Computer science

Beyond rules: The next generation of expert systems

The PARAGON Representation, Management, and Manipulation system is introduced. The concepts of knowledge representation, knowledge management, and knowledge manipulation are combined in a comprehensive system for solving real world problems requiring high levels of expertise in a real time environment. In most applications the complexity of the problem and the representation used to describe the domain knowledge tend to obscure the information from which solutions are derived. This inhibits the acquisition of domain knowledge verification/validation, places severe constraints on the ability to extend and maintain a knowledge base while making generic problem solving strategies difficult to develop. A unique hybrid system was developed to overcome these traditional limitations.

Ferguson, Jay C.

Computation of rotor-stator interaction using the Navier-Stokes equations

The numerical scheme presented belongs to a family of codes known as UNCLE (UNsteady Computation of fieLd Equations) as reported by Whitfield (1995), that is being used to solve problems in a variety of areas including compressible and incompressible flows. This derivation is specifically developed for general unsteady multi-blade-row turbomachinery problems. The scheme solves the Reynolds-averaged N-S equations with the Baldwin-Lomax turbulence model.

Whitfield, David L.

Conflict Detection and Resolution for Future Air Transportation Management

With a Free Flight policy, the emphasis for air traffic control is shifting from active control to passive air traffic management with a policy of intervention by exception. Aircraft will be allowed to fly user preferred routes, as long as safety Alert Zones are not violated. If there is a potential conflict, two (or more) aircraft must be able to arrive at a solution for conflict resolution without controller intervention. Thus, decision aid tools are needed in Free Flight to detect and resolve conflicts, and several problems must be solved to develop such tools. In this report, we analyze and solve problems of proximity management, conflict detection, and conflict resolution under a Free Flight policy. For proximity management, we establish a system based on Delaunay Triangulations of aircraft at constant flight levels. Such a system provides a means for analyzing the neighbor relationships between aircraft and the nearby free space around air traffic which can be utilized later in conflict resolution. For conflict detection, we perform both 2-dimensional and 3-dimensional analyses based on the penetration of the Protected Airspace Zone. Both deterministic and non-deterministic analyses are performed. We investigate several types of conflict warnings including tactical warnings prior to penetrating the Protected Airspace Zone, methods based on the reachability overlap of both aircraft, and conflict probability maps to establish strategic Alert Zones around aircraft.

Krozel, Jimmy

Programming effort analysis of the ELLPACK language

ELLPACK is a problem statement language and system for elliptic partial differential equations which is implemented by a FORTRAN preprocessor. ELLPACK's principal purpose is as a tool for the performance evaluation of software. However, it is used here as an example with which to study the programming effort required for problem solving. It is obvious that problem statement languages can reduce programming effort tremendously; the goal is to quantify this somewhat. This is done by analyzing the lengths and effort (as measured by Halstead's software science technique) of various approaches to solving these problems.

Rice, J. R.

Information transfer and shared mental models for decision making

A study to determine how communication influences flight crew performance is presented. This analysis focuses on the content of communication, principally asking what an utterance does from a cognitive, problem solving viewpoint. Two questions are addressed in this study: how is language utilized to manage problems in the cockpit, and are there differences between two- and three-member crews in their communication and problem solving strategies?

Orasanu, Judith

Learning from external environments using Soar

Soar, like the previous PRODIGY and Theo, is a problem-solving architecture that attempts to learn from experience; unlike them, it takes a more uniform approach, using a single forward-chaining architecture for planning and execution. Its single learning mechanism, designated 'chunking', is domain-independent. Two developmental approaches have been employed with Soar: the first of these allows the architecture to attempt a problem on its own, while the second involves a degree of external guidance. This learning through guidance is integrated with general problem-solving and autonomous learning, leading to an avoidance of human interaction for simple problems that Soar can solve on its own.

Laird, John E.

Production system chunking in SOAR: Case studies in automated learning

A preliminary study of SOAR, a general intelligent architecture for automated problem solving and learning, is presented. The underlying principles of universal subgoaling and chunking were applied to a simple, yet representative, problem in artificial intelligence. A number of problem space representations were examined and compared. It is concluded that learning is an inherent and beneficial aspect of problem solving. Additional studies are suggested in domains relevant to mission planning and to SOAR itself.

Allen, Robert

A survey of intelligent tutoring systems: Implications for complex dynamic systems

An overview of the research in the field of intelligent tutorial systems (ITS) is provided. The various approaches in the design and implementation of ITS are examined and discussed in the context of problem solving in an environment of a complex dynamic system (CDS). Issues pertaining to a CDS and the nature of human problem solving especially in light of a CDS are considered. An overview of the architecture of an ITS is provided as the basis for the in-depth examination of various systems. Finally, the implications for the design and evaluation of an ITS are discussed.

Chu, Rose W.

Dynamic Restructuring Of Problems In Artificial Intelligence

"Dynamic tradeoff evaluation" (DTE) denotes proposed method and procedure for restructuring problem-solving strategies in artificial intelligence to satisfy need for timely responses to changing conditions. Detects situations in which optimal problem-solving strategies cannot be pursued because of real-time constraints, and effects tradeoffs among nonoptimal strategies in such way to minimize adverse effects upon performance of system.

Schwuttke, Ursula M.

High performance techniques for space mission scheduling

In this paper, we summarize current research at Carnegie Mellon University aimed at development of high performance techniques and tools for space mission scheduling. Similar to prior research in opportunistic scheduling, our approach assumes the use of dynamic analysis of problem constraints as a basis for heuristic focusing of problem solving search. This methodology, however, is grounded in representational assumptions more akin to those adopted in recent temporal planning research, and in a problem solving framework which similarly emphasizes constraint posting in an explicitly maintained solution constraint network. These more general representational assumptions are necessitated by the predominance of state-dependent constraints in space mission planning domains, and the consequent need to integrate resource allocation and plan synthesis processes. First, we review the space mission problems we have considered to date and indicate the results obtained in these application domains. Next, we summarize recent work in constraint posting scheduling procedures, which offer the promise of better future solutions to this class of problems.

Smith, Stephen F.

Cognitive perspectives on map displays for helicopter flight

Currently accessible technologies are providing entirely new display concepts for enhancing helicopter navigation. Yet the effectiveness of such displays depends on the extent to which they are configured according to principles from research on human performance. Computer generated map displays in the present study were configured according to previous research on maps, navigational problem solving, and spatial cognition in large scale environments. Interest centered on the representation of different spatial relationships that would best support helicopter navigational problem solving. One map display emphasized the global relationships between objects in the environment. The other map showed the pilot's relationship to objects as he traveled through the environment. Twenty skilled pilots used the maps to complete several navigational tasks that occurred within a realistic simulation program tailored for helicopter navigation. Findings indicate that the type of task and mode of flight (low level or Nap of the Earth (NOE)) are important determinants of map display effectiveness.

Harwood, Kelly