Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scheduling”

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 307 records · Page 17

NASA Deep Space Network Operations Scheduling

The functioning of the Deep Space Network Operations Scheduling, Jet Propulsion Laboratory, CA is reviewed. The primary objectives of the Operations Scheduling are: to schedule the worldwide global allocation of ground communications, tracking facilities, and equipment; and to provide deep space telecommunications for command, tracking, telemetry, and control in support of flight mission operations and tests. Elements of the earth set are Deep Space Stations (DSS) which provide the telecommunications link between the earth and spacecraft; NASA Communications Network; Network Data Processing Area; Network Operations Control Area which provides operational direction to the DSS; Mission Control and Computing systems; and Mission Support areas which provide flight control of the spacecraft. Elements of the space set include mission priorities and requirements which determine the spacecraft queue for allocating network resources. Scheduling is discussed in terms of long-range (3 years), mid-range (8 weeks), and short-range (2 weeks).

Enari, D. M.↗

Space power system scheduling using an expert system

A most pressing problem in space exploration is timely spacecraft power system sequence generation, which requires the scheduling of a set of loads given a set of resource constraints. This is particularly important after an anomaly or failure. This paper discusses the power scheduling problem and how the software program, Plan-It, can be used as a consultant for scheduling power system activities. Modeling of power activities, human interface, and two of the many strategies used by Plan-It are discussed. Preliminary results showing the development of a conflict-free sequence from an initial sequence with conflicts is presented. It shows that a 4-day schedule can be generated in a matter of a few minutes, which provides sufficient time in many cases to aid the crew in the replanning of loads and generation use following a failure or anomaly.

Bahrami, K. A.↗

Expert mission planning and replanning scheduling system for NASA KSC payload operations

EMPRESS (Expert Mission Planning and REplanning Scheduling System) is an expert system created to assist payload mission planners at Kennedy in the long range planning and scheduling of horizontal payloads for space shuttle flights. Using the current flight manifest, these planners develop mission and payload schedules detailing all processing to be performed in the Operations and Checkout building at Kennedy. With the EMPRESS system, schedules are generated quickly using standard flows that represent the tasks and resources required to process a specific horizontal carrier. Resources can be tracked and resource conflicts can be determined and resolved interactively. Constraint relationships between tasks are maintained and can be enforced when a task is moved or rescheduled. The domain, structure, and functionality of the EMPRESS system is briefly designed. The limitations of the EMPRESS system are described as well as improvements expected with the EMPRESS-2 development.

Pierce, Roger↗

A scheduling and resource management system for space applications

Every spacecraft, whether in orbit around the earth or an a deep space flight, has at its disposal limited amounts of the resources for it to accomplish its mission. Activity scheduling is currently a costly, human intensive task which requires a great deal of expertise. It belongs to a class of problems whose complexity increases exponentially with the number of operations. NASA has in the past accomplished this task by using a great deal of manpower, a large number of negotiating sessions, interminable bouts of phone tag, and mountains of paperwork. Lately the situation has improved with the introduction of automated scheduling techniques, but these to date still require expert involvement and fall short in some important ways. A prototype activity scheduler, MAESTRO, is introduced which is capable of meeting the needs of many NASA missions, eventually to include the Space Station. The approach to resource constrained scheduling is first discussed, then the intended domain for MAESTRO is described along with its design and current capabilities. A description of planned enhancements and revisions to the systems is also presented.

Britt, Daniel L.↗

Experiment scheduling for Spacelab missions

The Experiment Scheduling Program (ESP) is the heart of a group of programs developed at NASA-Marshall to schedule the experiment activities of Spacelab and other Shuttle missions. Other programs in the group either prepare input data for ESP or produce derivative information based on the schedule produced by ESP. The task of experiment scheduling can be simply stated as positioning the experiment activities in a mission to that they collect their desired data without interfering with other activities. The program's capabilities as seen by the user are described along with mission constraints the program handles, and how the expert system in the program handles these constraints.

Jaap, John↗

PLAN-IT - Scheduling assistant for solar system exploration

A frame-based expert scheduling system shell, PLAN-IT, is developed for spacecraft scheduling in the Request Integration Phase, using the Comet Rendezvous Asteroid Flyby (CRAF) mission as a development base. Basic, structured, and expert scheduling techniques are reviewed. Data elements such as activity representation and resource conflict representation are discussed. Resource constraints include minimum and maximum separation times between activities, percentage of time pointed at specific targets, and separation time between targeted intervals of a given activity. The different scheduling technique categories and the rationale for their selection are also considered.

Dias, William C.↗

PLAN-IT: Scheduling assistant for solar system exploration

A frame-based expert scheduling system shell, PLAN-IT, is developed for spacecraft scheduling in the Request Integration Phase, using the Comet Rendezvous Asteroid Flyby (CRAF) mission as a development base. Basic, structured, and expert scheduling techniques are reviewed. Data elements such as activity representation and resource conflict representation are discussed. Resource constraints include minimum and maximum separation times between activities, percentage of time pointed at specific targets, and separation time between targeted intervals of a given activity. The different scheduling technique categories and the rationale for their selection are also considered.

Dias, William C.↗

A survey of planning and scheduling research at the NASA Ames Research Center

NASA Ames Research Center has a diverse program in planning and scheduling. This paper highlights some of our research projects as well as some of our applications. Topics addressed include machine learning techniques, action representations and constraint-based scheduling systems. The applications discussed are planetary rovers, Hubble Space Telescope scheduling, and Pioneer Venus orbit scheduling.

Zweben, Monte↗

Ada task scheduling: A focused Ada investigation

The types of control that are important for real time task scheduling are discussed. Some closely related real time issues are mentioned and major committee and research activities in this area are delineated. Although there are some problems with Ada and its real time task scheduling, Ada presents fewer than any known alternative. Ada was designed for the domain of real time embedded systems, but Ada compilers may not contain a level of task scheduling support that is adequate for all real time applications. The question addressed is which implementations of Ada's task scheduling are adequate for effective real time systems for NASA applications.

Legrand, Sue↗

Automated observation scheduling for the VLT

It is becoming increasingly evident that, in order to optimize the observing efficiency of large telescopes, some changes will be required in the way observations are planned and executed. Not all observing programs require the presence of the astronomer at the telescope: for those programs which permit service observing it is possible to better match planned observations to conditions at the telescope. This concept of flexible scheduling has been proposed for the VLT: based on current and predicted environmental and instrumental observations which make the most efficient possible use of valuable time. A similar kind of observation scheduling is already necessary for some space observatories, such as Hubble Space Telescope (HST). Space Telescope Science Institute is presently developing scheduling tools for HST, based on the use of artificial intelligence software development techniques. These tools could be readily adapted for ground-based telescope scheduling since they address many of the same issues. The concept are described on which the HST tools are based, their implementation, and what would be required to adapt them for use with the VLT and other ground-based observatories.

Johnston, Mark D.↗

A survey of planning and scheduling research at the NASA Ames Research Center

NASA Ames Research Center has a diverse program in planning and scheduling. Some research projects as well as some applications are highlighted. Topics addressed include machine learning techniques, action representations and constraint-based scheduling systems. The applications discussed are planetary rovers, Hubble Space Telescope scheduling, and Pioneer Venus orbit scheduling.

Zweben, Monte↗

The MFIVE Space Station Crew Activity Scheduler and Stowage Logistics Clerk

An interactive computer scheduling tool, the MFIVE Space Station Crew Activity Scheduler and Stowage Logistics Clerk, is described. The MFIVE employs the intelligent perturbation method, which was developed to schedule complex time and resource constrained problems. This algorithm was used to minimize the completion time of sample scheduling problems and solutions were derived which averaged within 7 percent of optimum where standard solution techniques gave solutions 23 percent longer than optimum.

Kurtzman, Clifford R.↗

Optimum-AIV: A planning and scheduling system for spacecraft AIV

A project undertaken for the European Space Agency (ESA) is presented. The project is developing a knowledge based software system for planning and scheduling of activities for spacecraft assembly, integration, and verification (AIV). The system extends into the monitoring of plan execution and the plan repair phase. The objectives are to develop an operational kernel of a planning, scheduling, and plan repair tool, called OPTIMUM-AIV, and to provide facilities which will allow individual projects to customize the kernel to suit its specific needs. The kernel shall consist of a set of software functionalities for assistance in initial specification of the AIV plan, in verification and generation of valid plans and schedules for the AIV activities, and in interactive monitoring and execution problem recovery for the detailed AIV plans. Embedded in OPTIMUM-AIV are external interfaces which allow integration with alternative scheduling systems and project databases. The current status of the OPTIMUM-AIV project, as of Jan. 1991, is that a further analysis of the AIV domain has taken place through interviews with satellite AIV experts, a software requirement document (SRD) for the full operational tool was approved, and an architectural design document (ADD) for the kernel excluding external interfaces is ready for review.

Arentoft, M. M.↗

Long range science scheduling for the Hubble Space Telescope

Observations with NASA's Hubble Space Telescope (HST) are scheduled with the assistance of a long-range scheduling system (SPIKE) that was developed using artificial intelligence techniques. In earlier papers, the system architecture and the constraint representation and propagation mechanisms were described. The development of high-level automated scheduling tools, including tools based on constraint satisfaction techniques and neural networks is described. The performance of these tools in scheduling HST observations is discussed.

Miller, Glenn↗

An expert system for planning and scheduling in a telerobotic environment

A knowledge based approach to assigning tasks to multi-agents working cooperatively in jobs that require a telerobot in the loop was developed. The generality of the approach allows for such a concept to be applied in a nonteleoperational domain. The planning architecture known as the task oriented planner (TOP) uses the principle of flow mechanism and the concept of planning by deliberation to preserve and use knowledge about a particular task. The TOP is an open ended architecture developed with a NEXPERT expert system shell and its knowledge organization allows for indirect consultation at various levels of task abstraction. Considering that a telerobot operates in a hostile and nonstructured environment, task scheduling should respond to environmental changes. A general heuristic was developed for scheduling jobs with the TOP system. The technique is not to optimize a given scheduling criterion as in classical job and/or flow shop problems. For a teleoperation job schedule, criteria are situation dependent. A criterion selection is fuzzily embedded in the task-skill matrix computation. However, goal achievement with minimum expected risk to the human operator is emphasized.

Ntuen, Celestine A.↗

Distributed planning and scheduling for instrument and platform operations

Distributed planning and scheduling for instruments and platform operations in resource constrained environments are discussed. NASA has repeatedly faced the situation of multiple users having differing goals, objectives, and requirements interacting with a planning and scheduling system. Current examples include the Hubble Space Telescope and Space Station Freedom. The paper provides a brief description of the instrument and platform operations domain, discusses both traditional and distributed planning and scheduling in the context of this domain, and looks at examples of NASA environments in which planning and scheduling is or will be performed in a distributed system.

Hull, Larry G.↗

Evaluating scheduling algorithms for traffic with heterogeneous performance objectives

Two types of network traffic are considered: traffic with deadlines, for which the most important performance objective is based on loss rate, and packets without deadlines, for which the most important performance objective is based on mean delay. An optimal scheduling algorithm is presented to minimize weighted loss rate and weighted mean delay in the queues that form at the switches and at the network access points of a packet-switched network, where weights reflect the relative importance of packets. Although not practical for implementation, the algorithm is intended as a standard for the comparison of the performance of other scheduling algorithms. The algorithm is more general and lower computational complexity than previously published algorithms, enabling performance evaluation of some important scenarios that could not previously have been considered. Using the optimal performance results of this algorithm, the performance of the first-come-first-served, static priority, and earliest deadline first scheduling algorithms is evaluated. The results suggest that network efficiency could be improved by using a more sophisticated heuristic scheduling algorithm rather than one of the aforementioned algorithms.

Peha, Jon M.↗

SPIKE: AI scheduling techniques for Hubble Space Telescope

AI (Artificial Intelligence) scheduling techniques for HST are presented in the form of the viewgraphs. The following subject areas are covered: domain; HST constraint timescales; HTS scheduling; SPIKE overview; SPIKE architecture; constraint representation and reasoning; use of suitability functions by scheduling agent; SPIKE screen example; advantages of suitability function framework; limiting search and constraint propagation; scheduling search; stochastic search; repair methods; implementation; and status.

Johnston, Mark D.↗