Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scheduling and spacing”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Constraint based scheduling for the Goddard Space Flight Center distributed Active Archive Center's data archive and distribution system

The Goddard Space Flight Center (GSFC) Distributed Active Archive Center (DAAC) has been operational since October 1, 1993. Its mission is to support the Earth Observing System (EOS) by providing rapid access to EOS data and analysis products, and to test Earth Observing System Data and Information System (EOSDIS) design concepts. One of the challenges is to ensure quick and easy retrieval of any data archived within the DAAC's Data Archive and Distributed System (DADS). Over the 15-year life of EOS project, an estimated several Petabytes (10(exp 15)) of data will be permanently stored. Accessing that amount of information is a formidable task that will require innovative approaches. As a precursor of the full EOS system, the GSFC DAAC with a few Terabits of storage, has implemented a prototype of a constraint-based task and resource scheduler to improve the performance of the DADS. This Honeywell Task and Resource Scheduler (HTRS), developed by Honeywell Technology Center in cooperation the Information Science and Technology Branch/935, the Code X Operations Technology Program, and the GSFC DAAC, makes better use of limited resources, prevents backlog of data, provides information about resources bottlenecks and performance characteristics. The prototype which is developed concurrently with the GSFC Version 0 (V0) DADS, models DADS activities such as ingestion and distribution with priority, precedence, resource requirements (disk and network bandwidth) and temporal constraints. HTRS supports schedule updates, insertions, and retrieval of task information via an Application Program Interface (API). The prototype has demonstrated with a few examples, the substantial advantages of using HTRS over scheduling algorithms such as a First In First Out (FIFO) queue. The kernel scheduling engine for HTRS, called Kronos, has been successfully applied to several other domains such as space shuttle mission scheduling, demand flow manufacturing, and avionics communications scheduling.

Short, Nick, Jr.↗
NASA NTRS1994

Search Space Characterization for a Telescope Scheduling Application

This paper presents a technique for statistically characterizing a search space and demonstrates the use of this technique within a practical telescope scheduling application. The characterization provides the following: (i) an estimate of the search space size, (ii) a scaling technique for multi-attribute objective functions and search heuristics, (iii) a "quality density function" for schedules in a search space, (iv) a measure of a scheduler's performance, and (v) support for constructing and tuning search heuristics. This paper describes the random sampling algorithm used to construct this characterization and explains how it can be used to produce this information. As an example, we include a comparative analysis of an heuristic dispatch scheduler and a look-ahead scheduler that performs greedy search.

Bresina, John↗
NASA NTRS1993

A Genetic Algorithm Tool (splicer) for Complex Scheduling Problems and the Space Station Freedom Resupply Problem

The Space Station Freedom will require the supply of items in a regular fashion. A schedule for the delivery of these items is not easy to design due to the large span of time involved and the possibility of cancellations and changes in shuttle flights. This paper presents the basic concepts of a genetic algorithm model, and also presents the results of an effort to apply genetic algorithms to the design of propellant resupply schedules. As part of this effort, a simple simulator and an encoding by which a genetic algorithm can find near optimal schedules have been developed. Additionally, this paper proposes ways in which robust schedules, i.e., schedules that can tolerate small changes, can be found using genetic algorithms.

Wang, Lui↗
NASA NTRS1981

DSN scheduling system

The Deep Space Network (DSN) Scheduling Group provides the operationally oriented administrative support necessary for the effective scheduling of the DSN. The scheduling system plus the levels of schedules are explained.

Dorham, R.↗
NASA NTRS2013

Orion GNC Mitigation Efforts for Van Allen Radiation

The Orion Crew Module (CM) is NASA's next generation manned space vehicle, scheduled to return humans to lunar orbit in the coming decade. The Orion avionics and GN&C architectures have progressed through a number of project phases and are nearing completion of a major milestone. The first unmanned test mission, dubbed "Exploration Flight Test One" (EFT-1) is scheduled to launch from NASA Kennedy Space Center late next year and provides the first integrated test of all the vehicle systems, avionics and software. The EFT-1 mission will be an unmanned test flight that includes a high speed re-entry from an elliptical orbit, which will be launched on an expendable launch vehicle (ELV). The ELV will place CM and the ELV upper stage into a low Earth orbit (LEO) for one revolution. After the first LEO, the ELV upper stage will re-ignite and place the combined upper stage/CM into an elliptical orbit whose perigee results in a high energy entry to test CM response in a relatively high velocity, high heating environment. While not producing entry velocities as high as those experienced in returning from a lunar orbit, the trajectory was chosen to provide higher stresses on the thermal protection and guided entry systems, as compared against a lower energy LEO entry. However the required entry geometry with constraints on inclination and landing site result in a trajectory that lingers for many hours in the Van Allen radiation belts. This exposes the vehicle and avionics to much higher levels of high energy proton radiation than a typical LEO or lunar trajectory would encounter. As a result, Van Allen radiation poses a significant risk to the Orion avionics system, and particularly the Flight Control Module (FCM) computers that house the GN&C flight software. The measures taken by the Orion GN&C, Flight Software and Avionics teams to mitigate the risks associated with the Van Allen radiation on EFT-1 are covered in the paper. Background on the Orion avionics subsystem is provided, as well as an overview of the GN&C software architecture. The measures taken to handle radiation induced failure of the one or both of the FCM's are presented, and finally simulation and actual hardware-in-the-loop (HWIL) results are shown confirming the validity of the implementation. The paper presents an overview of the Orion avionics architecture describing the GNC sensors, onboard data network as well as the flight control computers and their planned restart capabilities. GN&C sensors include two Orion Inertial Measurement Units (OIMU's), a Vision Processing Unit (VPU) to process camera images, three barometric altimeters and a single GPS receiver. All of the sensors communicate to one of two Power and Data Units (PDU's). The PDU's multiplex analog and serial data from the sensors and write the data to the Orion Data Network (ODN). The OIMU s write measurement messages directly as onto the ODN, but they are routed through PDU network switches.

King, Ellis T.↗
NASA NTRS2013

Orion GN and C Mitigation Efforts for Van Allen Radiation

The Orion Crew Module (CM) is NASA's next generation manned space vehicle, scheduled to return humans to lunar orbit in the coming decade. The Orion avionics and GN&C architectures have progressed through a number of project phases and are nearing completion of a major milestone. The first unmanned test mission, dubbed "Exploration Flight Test One" (EFT-1) is scheduled to launch from NASA Kennedy Space Center late next year and provides the first integrated test of all the vehicle systems, avionics and software.

King, Ellis T.↗
NASA NTRS2013

Space Technology Demonstrations Using Low Cost, Short-Schedule Airborne and Range Facilities at the Dryden Flight Research Center

There is a national effort to expedite advanced space technologies on new space systems for both government and commercial applications. In order to lower risk, these technologies should be demonstrated in a relevant environment before being installed in new space systems. This presentation introduces several low cost, short schedule space technology demonstrations using airborne and range facilities available at the Dryden Flight Research Center.

Carter, John↗
NASA NTRS2014

Improving Departure Throughput by Dynamically Adjusting Inter-Arrival Spacing

LaGuardia Airport (LGA) in New York has many unique challenges that create excess taxi-out delays. The purpose of this paper is to investigate the potential benefit that could be gained by tactically adjusting the Terminal Sequencing and Spacing (TSS) schedule to precisely manage inter-arrival spacing to maximize the number of departures per arrival pair. Three strategies for dynamically adjusting arrival schedules are proposed in this paper: Delay Control, Delay and Advance, and No Slack Capacity. The benefits of these strategies were examined on actual traffic data at LGA. The results showed that by applying these strategies, a 10 to 60 increase in departures and a reduction in un-utilized departure capacity (gaps) could be achieved during the airports busiest six-hour period. Significant increases in departure throughput would improve air traffic operations by reducing departure delay time. Furthermore, the concept could be used to resolve temporal mismatches between departure capacity and demand which also cause excessive departure delays.

Yoo, Hyo-Sang↗
NASA NTRS2013

Highly Automated Arrival Management and Control System Suitable for Early NextGen

This is a presentation of previously published work conducted in the development of the Terminal Area Precision Scheduling and Spacing (TAPSS) system. Included are concept and technical descriptions of the TAPSS system and results from human in the loop simulations conducted at Ames Research Center. The Terminal Area Precision Scheduling and Spacing system has demonstrated through research and extensive high-fidelity simulation studies to have benefits in airport arrival throughput, supporting efficient arrival descents, and enabling mixed aircraft navigation capability operations during periods of high congestion. NASA is currently porting the TAPSS system into the FAA TBFM and STARS system prototypes to ensure its ability to operate in the FAA automation Infrastructure. NASA ATM Demonstration Project is using the the TAPSS technologies to provide the ground-based automation tools to enable airborne Interval Management (IM) capabilities. NASA and the FAA have initiated a Research Transition Team to enable potential TAPSS and IM Technology Transfer.

Swenson, Harry N.↗
NASA NTRS2020

Scheduling NASA's Deep Space Network: Priorities, Preferences, and Optimization

NASA's Deep Space Network (DSN) is the primary resource for communications and navigation for interplanetary space missions, for both NASA and partner agencies. Growth in mission demand, both in number of spacecraft and in data return, has led to increased loading levels on the network, and actual demand frequently exceeds network capacity. The DSN scheduling process involves peer-to-peer collaborative negotiation, which consumes significant time and resources in order to reach a baseline version of the schedule, and then to manage and agree to changes. Process delays are exacerbated by the high level of oversubscription experienced by the DSN: it is not unusual for the scheduling process to start with 20-40\% more requested time can be accommodated on the available antennas. The other NASA networks make use of a static mission priority list to address a similar problem: missions are ranked in priority order, then the schedule is populated by priority from highest to lowest. Such a mechanism would not work for DSN due to the heterogeneity of the mission set, and to the time-varying mission requirements with mission phase. This paper describes an alternative approach for the DSN that addresses key problems inherent in the current process --- oversubsubscription and how to "fairly'" reduce it to a manageable level. The main characteristics of the new approach are the use of loading-based limits based on balancing requested time, along with priorities and user preferences as the basis for optimization criteria that can be used by new algorithms.

Johnston, Mark D↗
NASA NTRS1992

Iterative refinement scheduling

We present a heuristics-based approach to deep space mission scheduling which is modeled on the approach used by expert human schedulers in producing schedules for planetary encounters. New chronological evaluation techniques are used to focus the search by using information gained during the scheduling process to locate, classify, and resolve regions of conflict. Our approach is based on the assumption that during the construction of a schedule there exist several disjunct temporal regions where the demand for one resource type or a single temporal constraint dominates (bottleneck regions). If the scheduler can identify these regions and classify them based on their dominant constraint, then the scheduler can select the scheduling heuristic.

Biefeld, Eric↗
NASA NTRS1999

STS-103 Flight Day Highlights and Crew Activity Report

The crew of Discovery, Mission Commander Curtis L. Brown, Pilot Scott J. Kelly, Mission Specialists Steven L. Smith, C. Michael Foale, John M. Grunsfeld, Claude Nicollier, and Jean-Francois Clervoy are seen executing various activities. Live footage of Clervoy powering up the robotic arm is seen. While Clervoy powers the robotic arm, Brown and Kelly set up the tools for the various different space walks scheduled, Grunsfeld and Nicollier check out the space suits, and Smith and Foale tend to the space walk tools. Foale, Brown, Kelly and Clervoy are also shown participating in a series of interviews.

Source record↗
NASA NTRS2018

Spacecraft Block Scheduling for NASA’s Deep Space Network

Currently, NASA’s Deep Space Network (DSN) is responsible for uplink to, downlink from, and/or tracking of dozens of missions for space agencies across the world. The DSN scheduling process starts about four months prior to the start of the schedule week, a process in which requirements are defined and then the schedule is created, de-conflicted, and negotiated over the next 2–3 weeks with a team of mission representatives. Now scheduled for late 2019, Exploration Mission1 (EM-1) will deploy upwards of 12 SmallSat missions that will be served by the DSN. This will increase the DSN’s actively serviced spacecraft by up to 30%, further increasing the difficulty of meeting all mission needs via the over subscribed network. To mitigate their impact on DSN scheduling, a block scheduling process is proposed for scheduling the SmallSats. Block scheduling consists of aggregating spacecraft together into larger “pseudo-spacecraft” based on geometric alignment that then follow the same process as any other DSN mission to receive segments of track time. These tracks are then decomposed into tracks for individual users based on their specific requirements. This paper describes a full novel scheduling tool set for building candidate blocks, evaluating the efficacy of these blocks, and optimal and suboptimal de-blocking schemes. To demonstrate these developed tools, results from three simulations are presented: a blocking example with lunar SmallSats, blocking potential in the greater DSN spacecraft catalog, and opportunistic multiple spacecraft per aperture potential for the DSN spacecraft catalog. Block scheduling has the potential to reduce overhead and scheduling resources for the EM-1 SmallSats while also providing them with a better means to meet their mission requirements.

Bilén, Sven G.↗
NASA NTRS2021

Scheduling the NASA Deep Space Network with Deep Reinforcement Learning

With three complexes spread evenly across the Earth, NASA’s Deep Space Network (DSN) is the primary means of communications as well as a significant scientific instrument for dozens of active missions around the world. A rapidly rising number of spacecraft and increasingly complex scientific instruments with higher bandwidth requirements have resulted in demand that exceeds the network’s capacity across its 12 antennae. The existing DSN scheduling process operates on a rolling weekly basis and is time-consuming; for a given week, generation of the final baseline schedule of spacecraft tracking passes takes roughly 5 months from the initial requirements submission deadline, with several weeks of peer-to-peer negotiations in between. This paper proposes a deep reinforcement learning (RL) approach to generate candidate DSN schedules from mission requests and spacecraft ephemeris data with demonstrated capability to address real-world operational constraints. A deep RL agent is developed that takes mission requests for a given week as input, and interacts with a DSN scheduling environment to allocate tracks such that its reward signal is maximized. A comparison is made between an agent trained using Proximal Policy Optimization and its random, untrained counterpart. The results represent a proof-of-concept that, given a well-shaped reward signal, a deep RL agent can learn the complex heuristics used by experts to schedule the DSN. A trained agent can potentially be used to generate candidate schedules to bootstrap the scheduling process and thus reduce the turnaround cycle for DSN scheduling.

Wilson, Brian↗
NASA NTRS2014

Calculation of Flight Deck Interval Management Assigned Spacing Goals Subject to Multiple Scheduling Constraints

The Federal Aviation Administration's Next Generation Air Transportation System will combine advanced air traffic management technologies, performance-based procedures, and state-of-the-art avionics to maintain efficient operations throughout the entire arrival phase of flight. Flight deck Interval Management (FIM) operations are expected to use sophisticated airborne spacing capabilities to meet precise in-trail spacing from top-of-descent to touchdown. Recent human-in-the-loop simulations by the National Aeronautics and Space Administration have found that selection of the assigned spacing goal using the runway schedule can lead to premature interruptions of the FIM operation during periods of high traffic demand. This study compares three methods for calculating the assigned spacing goal for a FIM operation that is also subject to time-based metering constraints. The particular paradigms investigated include: one based upon the desired runway spacing interval, one based upon the desired meter fix spacing interval, and a composite method that combines both intervals. These three paradigms are evaluated for the primary arrival procedures to Phoenix Sky Harbor International Airport using the entire set of Rapid Update Cycle wind forecasts from 2011. For typical meter fix and runway spacing intervals, the runway- and meter fix-based paradigms exhibit moderate FIM interruption rates due to their inability to consider multiple metering constraints. The addition of larger separation buffers decreases the FIM interruption rate but also significantly reduces the achievable runway throughput. The composite paradigm causes no FIM interruptions, and maintains higher runway throughput more often than the other paradigms. A key implication of the results with respect to time-based metering is that FIM operations using a single assigned spacing goal will not allow reduction of the arrival schedule's excess spacing buffer. Alternative solutions for conducting the FIM operation in a manner more compatible with the arrival schedule are discussed in detail.

ATD-1↗