Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedule”

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 1,099 records · Page 61
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Multi-agent planning and scheduling, execution monitoring and incremental rescheduling: Application to motorway traffic

This article describes a planning method applicable to agents with great perception and decision-making capabilities and the ability to communicate with other agents. Each agent has a task to fulfill allowing for the actions of other agents in its vicinity. Certain simultaneous actions may cause conflicts because they require the same resource. The agent plans each of its actions and simultaneously transmits these to its neighbors. In a similar way, it receives plans from the other agents and must take account of these plans. The planning method allows us to build a distributed scheduling system. Here, these agents are robot vehicles on a highway communicating by radio. In this environment, conflicts between agents concern the allocation of space in time and are connected with the inertia of the vehicles. Each vehicle made a temporal, spatial, and situated reasoning in order to drive without collision. The flexibility and reactivity of the method presented here allows the agent to generate its plan based on assumptions concerning the other agents and then check these assumptions progressively as plans are received from the other agents. A multi-agent execution monitoring of these plans can be done, using data generated during planning and the multi-agent decision-making algorithm described here. A selective backtrack allows us to perform incremental rescheduling.

Mourou, Pascal↗
NASA NTRS1992

An extended abstract: A heuristic repair method for constraint-satisfaction and scheduling problems

The work described in this paper was inspired by a surprisingly effective neural network developed for scheduling astronomical observations on the Hubble Space Telescope. Our heuristic constraint satisfaction problem (CSP) method was distilled from an analysis of the network. In the process of carrying out the analysis, we discovered that the effectiveness of the network has little to do with its connectionist implementation. Furthermore, the ideas employed in the network can be implemented very efficiently within a symbolic CSP framework. The symbolic implementation is extremely simple. It also has the advantage that several different search strategies can be employed, although we have found that hill-climbing methods are particularly well-suited for the applications that we have investigated. We begin the paper with a brief review of the neural network. Following this, we describe our symbolic method for heuristic repair.

Minton, Steven↗
NASA NTRS1993

Decision theory for computing variable and value ordering decisions for scheduling problems

Heuristics that guide search are critical when solving large planning and scheduling problems, but most variable and value ordering heuristics are sensitive to only one feature of the search state. One wants to combine evidence from all features of the search state into a subjective probability that a value choice is best, but there has been no solid semantics for merging evidence when it is conceived in these terms. Instead, variable and value ordering decisions should be viewed as problems in decision theory. This led to two key insights: (1) The fundamental concept that allows heuristic evidence to be merged is the net incremental utility that will be achieved by assigning a value to a variable. Probability distributions about net incremental utility can merge evidence from the utility function, binary constraints, resource constraints, and other problem features. The subjective probability that a value is the best choice is then derived from probability distributions about net incremental utility. (2) The methods used for rumor control in Bayesian Networks are the primary way to prevent cycling in the computation of probable net incremental utility. These insights lead to semantically justifiable ways to compute heuristic variable and value ordering decisions that merge evidence from all available features of the search state.

Linden, Theodore A.↗
NASA NTRS1990

Knowledge based automated scheduling and planning tools for IUE

The International Ultraviolet Explorer has been successfully operated as a real time user-interactive space observatory for twelve years. It is expected to continue operation for up to five additional years, but under increasing constraints. The option to operate IUE in a more automated, non user-interactive mode is under consideration. A sophisticated software system to support such an operation is a clear requirement. The conceptual framework of such a system is described. Results of a preliminary tests are presented for which a hypothetical four day schedule of space-craft activities at a time resolutions as low as ten minutes was generated.

Shrader, Chris R.↗
NASA NTRS1992

Scheduling message processing for reducing rollback propagation

Traditional checkpointing and rollback recovery techniques for parallel systems have typically assumed the communication pattern is specified by program behavior. In this paper we exploit the property that the communication pattern can often be changed at run-time without affecting program correctness. A scheduling algorithm for message processing and its implementation for reducing rollback propagation are described. The algorithm incorporates a user-transparent prioritized scheme based upon the run-time communication and checkpointing history. Communication trace-driven simulation for several parallel programs written in the Chare Kernel language demonstrates that the probability of rollback propagation can be reduced at the cost of slight additional performance degradation.

Wang, Yi-Min↗
NASA NTRS1955

Statistical Survey of Icing Data Measured on Scheduled Airline Flights over the United States and Canada from November 1951 to June 1952

A statistical survey and a preliminary analysis are made of icing data collected from scheduled flights over the United States and Canada from November 1951 to June 1952 by airline aircraft equipped with NACA pressure-type icing-rate meters. This interim report presents information obtained from a continuing program sponsored by the NACA with the cooperation of the airlines. An analysis of over 600 icing encounters logged by three airlines operating in the United States, one operating in Canada and one operating up the coast to Alaska, is presented. The icing conditions encountered provided relative frequencies of many icing-cloud variables, such as horizontal extent, vertical thickness, temperatures, icing rate, liquid-water content, and total ice accumulation. Liquid-water contents were higher than data from earlier research flights in layer-type clouds but slightly lower than previous data from cumulus clouds. Broken-cloud conditions, indicated by intermittent icing, accounted for nearly one-half of all the icing encounters. About 90 percent of the encounters did not exceed a distance of 120 miles, and continuous icing did not exceed 50 miles for 90 percent of the unbroken conditions. Icing cloud thicknesses measured during climbs and descents were less than 4500 feet for 90 percent of the vertical cloud traverses.

Perkins, Porter J↗
NASA NTRS1994

Window-Based Graphics For Scheduling

XOPPS computer program generates window-based graphics for scheduling and planning projects. Provides easy and fast on-screen "what-you-see-is-what-you-get" editing capabilities. Object-oriented, but unique in its capability for creating objects that have date attributes. Can be used in conjunction with project-management software. Written in C language for Sunseries workstations running SunOS. XOPPS was developed in 1992, based on the Sunview version of OPPS (NPO-18439) developed in 1990. It is copyrighted work with all copyright vested in NASA.

Mulnix, Cassie↗
NASA NTRS1992

A statistical-based scheduling algorithm in automated data path synthesis

In this paper, we propose a new heuristic scheduling algorithm based on the statistical analysis of the cumulative frequency distribution of operations among control steps. It has a tendency of escaping from local minima and therefore reaching a globally optimal solution. The presented algorithm considers the real world constraints such as chained operations, multicycle operations, and pipelined data paths. The result of the experiment shows that it gives optimal solutions, even though it is greedy in nature.

Jeon, Byung Wook↗
NASA NTRS1993

An intelligent planning and scheduling system for the HST servicing missions

A new, intelligent planning and scheduling system has been delivered to NASA-Goddard Space Flight Center (GSFC) to provide support for the up-coming Hubble Space Telescope (HST) Servicing Missions. This new system is the Servicing Mission Planning and Replanning Tool (SM/PART). SM/PART is written in C and runs on a UNlX-based workstation (IBM RS/6000) under Motif. SM/PART effectively automates the complex task of building or rebuilding integrated timelines and command plans which are required by HST Servicing Mission personnel at their consoles during the missions. SM/PART is able to quickly build or rebuild timelines based on information stored in a Knowledge Base (KB) by using an Artificial Intelligence (AI) tool called the Planning And Resource Reasoning (PARR) shell. After a timeline has been built in the batch mode, it can be displayed and edited in an interactive mode with help from the PARR shell. Finally a detailed command plan is generated. The capability to quickly build or rebuild timelines and command plans provides an additional safety factor for the HST, Shuttle and Crew.

Johnson, Jay↗
NASA NTRS1994

On-board emergent scheduling of autonomous spacecraft payload operations

This paper describes a behavioral competency level concerned with emergent scheduling of spacecraft payload operations. The level is part of a multi-level subsumption architecture model for autonomous spacecraft, and it functions as an action selection system for processing a spacecraft commands that can be considered as 'plans-as-communication'. Several versions of the selection mechanism are described, and their robustness is qualitatively compared.

Lindley, Craig A.↗
NASA NTRS1994

A software tool for dataflow graph scheduling

A graph-theoretic design process and software tool is presented for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described using a dataflow graph and are intended to be executed repetitively on multiple processors. The dataflow paradigm is very useful in exposing the parallelism inherent in algorithms. It provides a graphical and mathematical model which describes a partial ordering of algorithm tasks based on data precedence.

Jones, Robert L., III↗
NASA NTRS1994

Generic mission planning and scheduling: The AXAF solution

During SpaceOps 92 the idea of generic mission planning concepts for space astronomy missions, that could be applied to future missions in order to simplify software development, was introduced. It was proposed that mission planning systems could be decomposed into functional elements that could be standardized and then organized into optimal functional flows for each individual mission. In addition, it was further suggested that these flows themselves could be reduced to a small set of possibilities by describing them in terms of generic mission type, such as manned, unmanned, high orbit, low orbit, etc. The Advanced X-ray Astrophysics Facility (AXAF), planned for launch in the latter part of '98, represents the first application of this idea on an unmanned mission. This paper examines the AXAF Mission Planning and Scheduling concept in light of the generic system theory. Each functional element is evaluated according to AXAF characteristics and requirements and then compared to its generic counterpart. Functional flow considerations are then derived from the overall AXAF mission planning concept to determine the viability and sensitivity of the generic flow to actual requirements. The results of this analysis are then used to update the generic system concept and to define the level of commonality and core system components that are practical to achieve across multiple missions.

Guffin, O. T.↗
NASA NTRS1994

Cost and schedule analytical techniques development

This contract provided technical services and products to the Marshall Space Flight Center's Engineering Cost Office (PP03) and the Program Plans and Requirements Office (PP02) for the period of 3 Aug. 1991 - 30 Nov. 1994. Accomplishments summarized cover the REDSTAR data base, NASCOM hard copy data base, NASCOM automated data base, NASCOM cost model, complexity generators, program planning, schedules, NASA computer connectivity, other analytical techniques, and special project support.

Source record↗
NASA NTRS1994

A scheduling and diagnostic system for scientific satellite GEOTAIL using expert system

The Intelligent Satellite Control Software (ISACS) for the geoMagnetic tail observation satellite named GEOTAIL (launched in July 1992) has been successfully developed. ISACS has made it possible by applying Artificial Intelligence (AI) technology including an expert system to autonomously generate a tracking schedule, which originally used to be conducted manually. Using ISACS, a satellite operator can generate a maximum four day period of stored command stream autonomously and can easily confirm its safety. The ISACS system has another function -- to diagnose satellite troubles and to suggest necessary remedies. The workload of satellite operators has drastically been reduced since ISACS has been introduced into the operations of GEOTAIL.

Nakatani, I↗
NASA NTRS1994

Generic astronomy mission planning and scheduling: The AXAF solution

During SpaceOps 92 the idea of generic mission planning concepts for space astronomy missions, that could be applied to future missions in order to simplify software development, was introduced. It was proposed that mission planning systems could be decomposed into functional elements that could be standardized and then organized into optimal functional flows for each individual mission. In addition, it was further suggested that these flows themselves could be reduced to a small set of possibilities by describing them in terms of generic mission type, such as manned, unmanned, high orbit, low orbit, etc. The Advanced X-ray Astrophysics Facility (AXAF), planned for launch in the latter part of 1998, represents the first application of this idea on an unmanned mission. This paper examines the AXAF Mission Planning and Scheduling concept in light of the generic system theory. Each functional element is evaluated according to AXAF characteristics and requirements and then compared to its generic counterpart. Functional flow considerations are then derived from the overall AXAF mission planning concept to determine the viability and sensitivity of the generic flow to actual requirements. The results of this analysis are then used to update the generic system concept and to define the level of commonality and core system components that are practical to achieve across multiple missions.

Guffin, O. T.↗
NASA NTRS1996

Scheduled Civil Aircraft Emission Inventories for 1976 and 1984: Database Development and Analysis

This report describes the development of a three-dimensional database of aircraft fuel burn and emissions (fuel burned, NOx, CO, and hydrocarbons) from scheduled commercial aircraft for four months (February, May, August, and November) of 1976 and 1984. Combining this data with earlier published data for 1990 and 1992, trend analyses for fuel burned, NOx, carbon monoxide, and hydrocarbons were calculated for selected regions (global, North America, Europe, North Atlantic, and North Pacific). These emissions inventories are available for use by atmospheric scientists conducting the Atmospheric Effects of Aviation Project (AEAP) modeling studies. Fuel burned and emissions of nitrogen oxides (NOx as NO2), carbon monoxide, and hydrocarbons have been calculated on a 1 degree latitude x 1 degree longitude x 1 kilometer altitude grid and delivered to NASA as electronic files.

Baughcum, Steven L.↗
NASA NTRS1996

Scheduled civil aircraft emission inventories for 1992: Database development and analysis

This report describes the development of a three-dimensional database of aircraft fuel burn and emissions (fuel burned, NOx, CO, and hydrocarbons) from scheduled commercial aircraft for each month of 1992. The seasonal variation in aircraft emissions was calculated for selected regions (global, North America, Europe, North Atlantic, and North Pacific). A series of parametric calculations were done to quantify the possible errors introduced from making approximations necessary to calculate the global emission inventory. The effects of wind, temperature, load factor, payload, and fuel tankering on fuel burn were evaluated to identify how they might affect the accuracy of aircraft emission inventories. These emissions inventories are available for use by atmospheric scientists conducting the Atmospheric Effects of Aviation Project (AEAP) modeling studies. Fuel burned and emissions of nitrogen oxides (NOx as N02), carbon monoxide, and hydrocarbons have been calculated on a 1 degree latitude x 1 degree longitude x 1 kilometer altitude grid and delivered to NASA as electronic files.

Baughcum, Steven L.↗
NASA NTRS1992

Generation and Exploitation of Aggregation Abstractions for Scheduling and Resource Allocation

Our research is investigating abstraction of computational theories for scheduling and resource allocation. These theories are represented in a variant of first order predicate calculus, parameterized multisorted logic, that facilitates specification of large problems. A particular problem is conceptually stated as a set of ground sentences that are consistent with a quantified theory. We are mainly investigating the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. We are also investigating the interaction of aggregation abstractions with the more thoroughly investigated abstractions of weakening operator preconditions. The purpose of the theories for aggregated demand/capacity is threefold: first, to answer queries about aggregate properties, such as gross feasibility; second, to reduce computational costs by using the solution of aggregate problems to guide the solution of detailed problems; and third, to facilitate reformulating theories to approximate problems for which there are efficient problem solving methods. We also describe novel methods for exploiting aggregation abstractions.

Linden, Theodore A.↗