Search NASASearch

SEARCH · Search NASA

Results for “dispatch”

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 19 records

The Mathematics of Dispatchability Revisited

Dispatchability is an important property for the efficient execution of temporal plans where the temporal constraints are represented as a Simple Temporal Network (STN). It has been shown that every STN may be reformulated as a dispatchable STN, and dispatchability ensures that the temporal constraints need only be satisfied locally during execution. Recently it has also been shown that Simple Temporal Networks with Uncertainty, augmented with wait edges, are Dynamically Controllable provided every projection is dispatchable. Thus, the dispatchability property has both theoretical and practical interest. One thing that hampers further work in this area is the underdeveloped theory. The existing definitions are expressed in terms of algorithms, and are less suitable for mathematical proofs. In this paper, we develop a new formal theory of dispatchability in terms of execution sequences. We exploit this to prove a characterization of dispatchability involving the structural properties of the STN graph. This facilitates the potential application of the theory to uncertainty reasoning.

control

The Mathematics of Dispatchability, Revisited

Dispatchability is an important property for the efficient execution of temporal plans where the temporal constraints are represented as a Simple Temporal Network (STN). It has been shown that every STN may be reformulated as a dispatchable STN, and dispatchability ensures that the temporal constraints need only be satisfied locally during execution. Recently, it has also been shown that Simple Temporal Networks with Uncertainty, augmented with wait edges, are Dynamically Controllable provided every projection is dispatchable. Thus, dispatchability has considerable theoretical as well as practical significance. One thing that hampers further work in this area is the underdeveloped theory. Moreover, the existing foundation is inadequate in certain respects. In this paper, we develop a new mathematical theory of dispatchability and its relationship to execution. We also provide several characterizations of dispatchability, including characterizations in terms of the structural properties of the STN graph. This facilitates the potential application of the theory to other areas.

mathematical models

Evaluation of a Dispatcher's Route Optimization Decision Aid to Avoid Aviation Weather Hazards

This document describes the results and analysis of the formal evaluation plan for the Honeywell software tool developed under the NASA AWIN (Aviation Weather Information) 'Weather Avoidance using Route Optimization as a Decision Aid' project. The software tool aims to provide airline dispatchers with a decision aid for selecting optimal routes that avoid weather and other hazards. This evaluation compares and contrasts route selection performance with the AWIN tool to that of subjects using a more traditional dispatcher environment. The evaluation assesses gains in safety, in fuel efficiency of planned routes, and in time efficiency in the pre-flight dispatch process through the use of the AWIN decision aid. In addition, we are interested in how this AWIN tool affects constructs that can be related to performance. The construct of Situation Awareness (SA), workload, trust in an information system, and operator acceptance are assessed using established scales, where these exist, as well as through the evaluation of questionnaire responses and subject comments. The intention of the experiment is to set up a simulated operations area for the dispatchers to work in. They will be given scenarios in which they are presented with stored company routes for a particular city-pair and aircraft type. A diverse set of external weather information sources is represented by a stand-alone display (MOCK), containing the actual historical weather data typically used by dispatchers. There is also the possibility of presenting selected weather data on the route visualization tool. The company routes have not been modified to avoid the weather except in the case of one additional route generated by the Honeywell prototype flight planning system. The dispatcher will be required to choose the most appropriate and efficient flight plan route in the displayed weather conditions. The route may be modified manually or may be chosen from those automatically displayed.

Dorneich, Michael C.

Uncertainties that flight crews and dispatchers must consider when calculating the fuel needed for a flight

In 1993, fuel accounted for approximately 15 percent of an airline's expenses. Fuel consumption increases as fuel reserves increase because of the added weight to the aircraft. Calculating fuel reserves is a function of Federal Aviation Regulations, airline company policy, and factors that impact or are impacted by fuel usage enroute. This research studied how pilots and dispatchers determined the fuel needed for a flight and identified areas where improvements in methods may yield measurable fuel savings by (1) listing the uncertainties that contribute to adding contingency fuel, (2) obtaining the pilots' and dispatchers' perspective on how often each uncertainty occurred, and (3) obtaining pilots' and dispatchers' perspective on the fuel used for each occurrence. This study found that for the majority of the time, pilots felt that dispatchers included enough fuel. As for the uncertainties that flight crews and dispatchers account for, air traffic control accounts for 28% and weather uncertainties account for 58 percent. If improvements can be made in these two areas, a great potential exists to decrease the reserve required, and therefore, fuel usage without jeopardizing safety.

Trujillo, Anna C.

On Why It Is Impossible to Prove that the BDX90 Dispatcher Implements a Time-sharing System

The Software Implemented Fault Tolerance SIFT system, is written in PASCAL except for about a page of machine code. The SIFT system implements a small time sharing system in which PASCAL programs for separate application tasks are executed according to a schedule with real time constraints. The PASCAL language has no provision for handling the notion of an interrupt such as the B930 clock interrupt. The PASCAL language also lacks the notion of running a PASCAL subroutine for a given amount of time, suspending it, saving away the suspension, and later activating the suspension. Machine code was used to overcome these inadequacies of PASCAL. Code which handles clock interrupts and suspends processes is called a dispatcher. The time sharing/virtual machine idea is completely destroyed by the reconfiguration task. After termination of the reconfiguration task, the tasks run by the dispatcher have no relation to those run before reconfiguration. It is impossible to view the dispatcher as a time-sharing system implementing virtual BDX930s running concurrently when one process can wipe out the others.

Boyer, R. S.

Design of a cooperative problem-solving system for enroute flight planning: An empirical study of its use by airline dispatchers

In a previous report, an empirical study of 30 pilots using the Flight Planning Testbed was reported. An identical experiment using the Flight Planning Testbed (FPT), except that 27 airline dispatchers were studied, is described. Five general questions were addressed in this study: (1) under what circumstances do the introduction of computer-generated suggestions (flight plans) influence the planning behavior of dispatchers (either in a beneficial or adverse manner); (2) what is the nature of such influences (i.e., how are the person's cognitive processes changed); (3) how beneficial are the general design concepts underlying FPT (use of a graphical interface, embedding graphics in a spreadsheet, etc.); (4) how effective are the specific implementation decisions made in realizing these general design concepts; and (5) how effectively do dispatchers evaluate situations requiring replanning, and how effectively do they identify appropriate solutions to these situations.

Smith, Philip J.

Lila: Optimal Dispatching in Probabilistic Temporal Networks using Monte Carlo Tree Search

Executing a Probabilistic Simple Temporal Network (PSTN) amounts at scheduling, i.e. \textit{dispatch}, a set of events under time uncertainty. This constitutes a NP-hard online optimization problem. The right execution time must be dynamically assigned to each event of the PSTN such that the temporal constraints are met, whereas activity durations are progressively observed as the execution unfolds. We propose a dispatching algorithm based on Monte Carlo Tree Search, called Lila, with the following characteristics: (i) it is an anytime algorithm, both offline and online, proven asymptotically optimal; (ii) it returns the current probability of success, either before or at any moment during operations; (iii) it handles any possible continuous or discrete, even non-parametric, probability distributions, as well as inter-dependencies between random variables, exogenous and endogenous uncertainty; and (iv) can be easily extended to handle probabilistic external events, PSTNs with resources, PSTNs with cutoff times and precondition chains, etc. Lila is universal in the sense that it can handle any dispatching protocol, simply by specifying it to the algorithm. It has the unlimited flexibility offered by the simulation paradigm, whilst it asymptotically converges to optimal decisions and/or robustness approximations.

Chien, Steve A.

Managing Variability: A Cognitive Ethnography of the Work of Airline Dispatchers

Airline dispatchers' workflow is often described in broad terms like 'flight planning' and 'flight following'. Such high-level descriptions fail to recognize the number and complexity of tasks involved in these activities. An ethnographic study was conducted at three US airlines to understand the cognitive workload involved in flight planning. Fuel planning was identified as one of five key flight planning tasks. Fuel planning was conducted concurrently with other planning and monitoring tasks which often led to interruptions. Planning fuel was dynamic, with recalculations required whenever other factors varied (e.g., payload, route, alternates). This rework increased workload and opportunities for error while reducing efficiency. Four main factors contributed variability to fuel planning: contingency planning, load planning, pilots, and station operations. Strategies for managing variability included pattern identification, use of buffers, rounding up, and leveraging software tools. Software design often added to workload by forcing dispatchers to attend to low level tasks.

dispatcher

Advanced Free Flight Planner and Dispatcher's Workstation: Preliminary Design Specification

The National Aeronautics and Space Administration (NASA) has implemented the Advanced Air Transportation Technology (AATT) program to investigate future improvements to the national and international air traffic management systems. This research, as part of the AATT program, developed preliminary design requirements for an advanced Airline Operations Control (AOC) dispatcher's workstation, with emphasis on flight planning. This design will support the implementation of an experimental workstation in NASA laboratories that would emulate AOC dispatch operations. The work developed an airline flight plan data base and specified requirements for: a computer tool for generation and evaluation of free flight, user preferred trajectories (UPT); the kernel of an advanced flight planning system to be incorporated into the UPT-generation tool; and an AOC workstation to house the UPT-generation tool and to provide a real-time testing environment. A prototype for the advanced flight plan optimization kernel was developed and demonstrated. The flight planner uses dynamic programming to search a four-dimensional wind and temperature grid to identify the optimal route, altitude and speed for successive segments of a flight. An iterative process is employed in which a series of trajectories are successively refined until the LTPT is identified. The flight planner is designed to function in the current operational environment as well as in free flight. The free flight environment would enable greater flexibility in UPT selection based on alleviation of current procedural constraints. The prototype also takes advantage of advanced computer processing capabilities to implement more powerful optimization routines than would be possible with older computer systems.

Wilson, J.

Application of computer-aided dispatch in law enforcement: An introductory planning guide

A set of planning guidelines for the application of computer-aided dispatching (CAD) to law enforcement is presented. Some essential characteristics and applications of CAD are outlined; the results of a survey of systems in the operational or planning phases are summarized. Requirements analysis, system concept design, implementation planning, and performance and cost modeling are described and demonstrated with numerous examples. Detailed descriptions of typical law enforcement CAD systems, and a list of vendor sources, are given in appendixes.

Sohn, R. L.

The NASA/Baltimore Applications Project (BAP). Computer aided dispatch and communications system for the Baltimore Fire Department: A case study of urban technology application

An engineer and a computer expert from Goddard Space Flight Center were assigned to provide technical assistance in the design and installation of a computer assisted system for dispatching and communicating with fire department personnel and equipment in Baltimore City. Primary contributions were in decision making and management processes. The project is analyzed from four perspectives: (1) fire service; (2) technology transfer; (3) public administration; and (5) innovation. The city benefitted substantially from the approach and competence of the NASA personnel. Given the proper conditions, there are distinct advantages in having a nearby Federal laboratory provide assistance to a city on a continuing basis, as is done in the Baltimore Applications Project.

Levine, A. L.

Distributed problem solving by pilots and dispatchers

The study addressed the following question: Are flight planning problems solved differently by PILOTS and DISPATCHERS when they work alone versus when they work together? Aspect of their performance that were of interest include the following: Problem perception and definition; Problem solving strategies and information use; Options considered; Solution and rational; and errors.

Orasanu, Judith

Dynamic Controllability and Dispatchability Relationships

An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is Dynamically Controllable, i.e., whether the temporal requirements are feasible in the light of uncertain durations of some processes. We present a fast algorithm for Dynamic Controllability. We also note a correspondence between the reduction steps in the algorithm and the operations involved in converting the projections to dispatchable form. This has implications for the complexity for sparse networks.

controllability

Priority-Based Dispatching Algorithm

Tasks assigned to different queues based on priority. Proposed algorithm controls execution of transient tasks of different priorities in real-time computation.

Ouzts, G.

Cooperative Automation Supporting Pilot-Dispatch Negotiation of Enroute Trajectory Change Requests

The advent of advanced technologies in communication, navigation, and surveillance is enabling more integration between the aircraft and the ground systems in managing air traffic operations. As a result, automation has evolved to provide the flight crew, air traffic controllers, and traffic flow managers with capabilities for collaborating on information access, analysis, and decision making. In this paper, we investigate different cooperative schemes between these agents, supported by automation, in managing dynamic trajectory changes while the flight is en route to improve flight and system performance. The analysis was conducted using an abstract cognitive tasking framework to identify trajectory change tasks independently from the agent performing them. Cooperation schemes were then derived by assessing different levels of cooperation on each task between the air and ground agents and their automation. The assessment was based on which automation-supported agent is more capable of performing the task and the expected benefit mechanisms that result from cooperating. The cooperation schemes were compared based on a qualitative, but objective, assessment of the benefits expected from cooperation.

air-ground integration

Analysis of San Francisco Bar Pilot Dispatch Records: Preliminary Report

Maritime pilots licensed by the San Francisco Board of Pilot Commissioners perform safety-critical tasks in a demanding environment, working in all weather and at all times of day and night. Since 1850, San Francisco maritime pilots have been known as Bar Pilots because their duties include guiding ships safely across the large sand bar that lies west of the Golden Gate. Schedules and Work Hours Records for San Francisco Bay Bar Pilots were analyzed to determine the minimum and maximum work periods, the frequency of extended work hours, the frequency of night work and the rotation of work hours. A mathematical model is being applied to predict fatigue in order to identify schedules that may have a high likelihood of fatigue. This presentation provides a progress report on the research thus far.

marine pilots