SEARCH · Engineering Papers
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.
Automated planning and scheduling, including automated path planning, has been integrated with an internet-based distributed operations system for planetary rover operations.
The findings are documented of the OMP research task, which investigated the applicability of artificial intelligence (AI) technology in support of automated scheduling. The goals of the effort are summarized and the technical accomplishments are highlighted. The OMP task succeeded in identifying how AI technology could be applied and demonstrated an AI-based automated scheduling approach through the OMP prototypes.
A general scheduling algorithm for aircraft from terminal area entry to touchdown is developed. The method has the following novel features: (1) many speed classes of aircraft are considered and speed variations within classes and along portions of the flight path are permitted; (2) multiple paths are considered which may merge or diverge - the analysis is not restricted to a single runway nor to departures only; (3) landings are scheduled along conflict free flight paths in minimum time. The algorithm is currently being incorporated in a fast-time simulation of a STOL air traffic system.
It is anticipated that in order to make effective use of many future high performance architectures, programs will have to exhibit at least a medium grained parallelism. A framework is presented for partitioning very sparse triangular systems of linear equations that is designed to produce favorable preformance results in a wide variety of parallel architectures. Efficient methods for solving these systems are of interest because: (1) they provide a useful model problem for use in exploring heuristics for the aggregation, mapping and scheduling of relatively fine grained computations whose data dependencies are specified by directed acrylic graphs, and (2) because such efficient methods can find direct application in the development of parallel algorithms for scientific computation. Simple expressions are derived that describe how to schedule computational work with varying degrees of granularity. The Encore Multimax was used as a hardware simulator to investigate the performance effects of using the partitioning techniques presented in shared memory architectures with varying relative synchronization costs.
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.
In this paper we describe the use of our planning and scheduling framework, HSTS, to reduce the complexity of science mission planning. This work is part of an overall project to enable a small team of scientists to control the operations of a spacecraft. The present process is highly labor intensive. Users (scientists and operators) rely on a non-codified understanding of the different spacecraft subsystems and of their operating constraints. They use a variety of software tools to support their decision making process. This paper considers the types of decision making that need to be supported/automated, the nature of the domain constraints and the capabilities needed to address them successfully, and the nature of external software systems with which the core planning/scheduling engine needs to interact. HSTS has been applied to science scheduling for EUVE and Cassini and is being adapted to support autonomous spacecraft operations in the New Millennium initiative.
This paper describes the problem of scheduling observations for an airborne telescope. Given a set of prioritized observations to choose from, and a wide range of complex constraints governing legitimate choices and orderings, how can we efficiently and effectively create a valid flight plan which supports high priority observations? This problem is quite different from scheduling problems which are routinely solved automatically in industry. For instance, the problem requires making choices which lead to other choices later, and contains many interacting complex constraints over both discrete and continuous variables. Furthermore, new types of constraints may be added as the fundamental problem changes. As a result of these features, this problem cannot be solved by traditional scheduling techniques. The problem resembles other problems in NASA and industry, from observation scheduling for rovers and other science instruments to vehicle routing. The remainder of the paper is organized as follows. In 2 we describe the observatory in order to provide some background. In 3 we describe the problem of scheduling a single flight. In 4 we compare flight planning and other scheduling problems and argue that traditional techniques are not sufficient to solve this problem. We also mention similar complex scheduling problems which may benefit from efforts to solve this problem. In 5 we describe an approach for solving this problem based on research into a similar problem, that of scheduling observations for a space-borne probe. In 6 we discuss extensions of the flight planning problem as well as other problems which are similar to flight planning. In 7 we conclude and discuss future work.
ASTER schedules are generated by an automated scheduling system. This scheduler will generate psuedo-optimal schedules based on a priority scheme. This priority scheme is controlled by the Science Team.
Automated planning and scheduling technology - we'll call it automated planning systems, for the sake of brevity-is applicable to a wide spectrum of spaceflight missions, from those with limited onboard computational capabilities, such as Lunar Prospector, to those with highly sophisticated software, such as Cassini.
As satellite equipment and mission operations become more costly, the drive to keep working equipment running with less man-power rises.Demonstrating the feasibility of autonomous satellite servicing was the main goal behind the Orbital Express (OE) mission. Planning the satellite mission operations for OE required the ability to create a plan which could be executed autonomously over variable conditions. The Automated-Scheduling and Planning Environment (ASPEN)tool, developed at the Jet Propulsion Laboratory, was used to create the schedule of events in each daily plan for the two satellites of the OE mission. This paper presents an introduction to the ASPEN tool, the constraints of the OE domain, the variable conditions that were presented within the mission, and the solution to operations that ASPEN provided. ASPEN has been used in several other domains, including research rovers, Deep Space Network scheduling research, and in flight operations for the ASE project's EO1 satellite. Related work is discussed, as are the future of ASPEN and the future of autonomous satellite servicing.
The Autonomous Power System (APS) project at NASA LeRC is designed to demonstrate the applications of integrated intelligent diagnosis, control, and scheduling techniques to space power distribution systems. The project consists of three elements: the Autonomous Power Expert System (APEX) for Fault Diagnosis, Isolation, and Recovery (FDIR); the Autonomous Intelligent Power Scheduler (AIPS) to efficiently assign activities start times and resources; and power hardware (Brassboard) to emulate a space-based power system. The AIPS scheduler was tested within the APS system. This scheduler is able to efficiently assign available power to the requesting activities and share this information with other software agents within the APS system in order to implement the generated schedule. The AIPS scheduler is also able to cooperatively recover from fault situations by rescheduling the affected loads on the Brassboard in conjunction with the APEX FDIR system. AIPS served as a learning tool and an initial scheduling testbed for the integration of FDIR and automated scheduling systems. Many lessons were learned from the AIPS scheduler and are now being integrated into a new scheduler called SCRAP (Scheduler for Continuous Resource Allocation and Planning). This paper will service three purposes: an overview of the AIPS implementation, lessons learned from the AIPS scheduler, and a brief section on how these lessons are being applied to the new SCRAP scheduler.
A number of successful applications of automated planning and scheduling applications to spacecraft operations have recently been reported in the literature. However, these applications have been one-of-a-kind applications that required a substantial amount of development effort. In this paper, we describe ASPEN, a modular, reconfigurable application framework which is capable of supporting a wide variety of planning applications. We describe the architecture of ASPEN, as well as a number of current spacecraft control/operations applications in progress.
The goal of this research is to improve the performance of automated schedulers by designing and implementing an algorithm by automatically generating heuristics by selecting a schedule. The particular application selected by applying this method solves the problem of scheduling telescope observations, and is called the Associate Principal Astronomer. The input to the APA scheduler is a set of observation requests submitted by one or more astronomers. Each observation request specifies an observation program as well as scheduling constraints and preferences associated with the program. The scheduler employs greedy heuristic search to synthesize a schedule that satisfies all hard constraints of the domain and achieves a good score with respect to soft constraints expressed as an objective function established by an astronomer-user.
Information on Space Station Freedom scheduling problems and techniques are presented in viewgraph form. Topics covered include automated scheduling systems, user interface standards, benefits of interactive scheduling systems, incremental scheduling, software engineering, computer graphics interface, distributed resource management, and advanced applications.
This paper describes the Automated Scheduling and Planning Environment (ASPEN). ASPEN encodes complex spacecraft knowledge of operability constraints, flight rules, spacecraft hardware, science experiments and operations procedures to allow for automated generation of low level spacecraft sequences.