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 487 records · Page 27

SPRINT: Scheduling Planning Routing Intersatellite Network Tool

The Scheduling Planning Routing Intersatellite Network Tool (SPRINT) software system plans and schedules the operations (observations, inter-satellite crosslink communications, and ground communications) of Earth observation (EO) constellations of hundreds of resource-constrained small satellites to enable global, near real-time science. Historically, most CubeSats have flown radios only for direct-to-ground downlink of data; as a result, data availability is delayed by as long as it takes for the capturing satellite to pass over a ground station, typically hours. Current Planning and Scheduling (P&S) systems for constellations cannot handle data routing through a large, dynamic network topology, and all planning is handled on the ground without .the ability to autonomously prioritize important observations, or respond to unexpected changes in communication window or bandwidth. SPRINT directly handles both data routing for low latency bulk observation data downlink and replanning onboard to deal with dynamic priorities and fault response, maximizing the utility of downlinked data.

Kerri Cahoy↗

Integrated Planning and Scheduling for NASA’s Deep Space Network – from Forecasting to Real-time

Over a period of several years, the software systems that plan and schedule the use of NASA’s Deep Space Network (DSN) for the projects it serves have been upgraded from a disparate set of decades-old software components, to an integrated suite covering long-range planning and forecasting, all the way to real-time scheduling. The most recent component of this suite is known as LAPS, for Loading Analysis and Planning Software, and is responsible for long-term planning and forecasting, including studies and analysis of new missions, changed mission requirements, downtime, and new or changed antenna capabilities. This paper discusses the architecture of LAPS and its interfaces with other elements of DSN planning and scheduling, its user interfaces, and some lessons learned from development and deployment.

Lad, Jigna↗

Maximizing Dust Devil Follow-up Observations on Mars Using Cubesats and On-board Scheduling

Several million dust devil events occur on Mars every day. These events last, on average, about 30 minutes and range in size from meters to hundreds of meters in diameter. Designing low-cost missions that will improve our knowledge of dust devil formation and evolution, and their connection to atmospheric dynamics and the dust cycle, is fundamental to informing future crewed Mars lander missions about surface conditions. In this paper we present a mission for a constellation of low orbiting Mars cubesats, each carrying imagers with agile pointing capabilities. The goal is to maximize the number of dust devil follow-up observations through real-time, on-board scheduling. We study scenarios where cubesats are equipped with a 2.5 degree boresight angle camera that accommodates five slew positions (including nadir). We assume a concept of operations where the cubesats autonomously survey the surface of Mars and can autonomously detect dust devils from their surface imagery. When a dust devil is detected, the constellation is autonomously re-tasked through an on-board distributed scheduler to capture as many follow-on images of the event as possible, so as to study its evolution. The cubesat orbits are propagated assuming two-body dynamics and the ground tracks and camera field of view are computed assuming a spherical Mars. Realistic inter-agent communication link opportunities are computed and included in our optimization, which allow for real-time event detection information to be shared within the constellation. We compare against a powerful ``omniscient'' mission which has a priori knowledge of all dust devil activity to show the gap between predicted performance and the best possible outcome. In particular, we show that the communications are especially important for acquiring follow-up observations, and that a realistic distributed scheduling mechanism is sufficient to capture nearly all dust devil observations that are possible for a given orbit configuration.

Hook, Joshua Vander↗

Using Automated Scheduling for Mission Design: A Case Study for EMIT

The Earth Surface Mineral Dust Source InvesTigation (EMIT) is an Earth Ventures-Instrument (EVI-4) mission to map the surface mineralogy of arid dust source regions. EMIT used automated scheduling technology to analyze aspects of the mission design. The automated scheduling technology was used to construct schedules which were then automatically analyzed with respect to science acquired. These analyses can be performed for a range of spacecraft hardware configurations, observation strategies, and science requirements. By studying the effects of changes on the above inputs, better hardware configurations, observation strategies, and science requirements can be formulated. The use of a pointing mirror on EMIT was under consideration, and this analysis aided in determining whether or not to keep it as part of the design of the instrument. Clouds will also have a large impact on the coverage of science targets achievable by the mission. Analysis was done on how clouds could impact the coverage achievable as well as the data volume. This analysis with clouds also aided in determining the coverage criteria for the mission. It was necessary to find a criteria that was achievable with some margin as well as satisfies the science goals of the mission.

Thompson, David R.↗

Improvements of the Load Schedule for the Machine Calibration of a Strain-Gage Balance

The load schedule for the calibration of a six-component force balance in a calibration machine was improved. Now, single-component loads are repeated in regular intervals during the calibration. This approach has several advantages. First, the number of single-component loads increases to about twenty-two percent of all loads and load combinations. Consequently, more accurate numerical estimates of the primary bridge sensitivities can be obtained if global regression is used for the analysis of the calibration data. In addition, single-component repeats make it possible to track the stability of the applied loads during the calibration process. Finally, interactions of single-component repeats can be compared with interactions that are observed during the application of manual loads to the balance. Machine calibration and manual data sets of two force balances are used to illustrate benefits of the new load schedule. It is shown in the examples how differences between the observed interactions of machine calibration and manual data can be quantified. The suggested improvements can also be implemented in the load schedule for the machine calibration of a moment or direct-read balance as long as single-component loads are included that are described in the design load format of the balance.

wind tunnel test↗

Automating Deep Space Network scheduling and conflict resolution

The Deep Space Network (DSN) is a central part of NASA's infrastructure for communicating with active space missions, from earth orbit to beyond the solar system. We describe our recent work in modeling the complexities of user requirements, and then scheduling and resolving conflicts on that basis. We emphasize our innovative use of background 'intelligent' assistants' that carry out search asynchrnously while the user is focusing on various aspects of the schedule.

conflict resolution↗

The JPL Resource Allocation Planning and Scheduling Office (RAPSO) process

The Jet Propulsion Laboratory's Resource Allocation Planning and Scheduling Office is chartered to divide the limited amount of tracking hours of the Deep Space Network amongst the various missions in as equitable allotment as can be achieved. To best deal with this division of assets and time, an interactive process has evolved that promotes discussion with agreement by consensus between all of the customers that use the Deep Space Network (DSN). Aided by a suite of tools, the task of division of asset time is then performed in three stages of granularity. Using this approach, DSN loads are either forecasted or scheduled throughout a moving 10-year window.

RAPSO Resource Allocation Planning and Scheduling ↗

Automated Planning and Scheduling for Space Mission Operations

Research Trends: a) Finite-capacity scheduling under more complex constraints and increased problem dimensionality (subcontracting, overtime, lot splitting, inventory, etc.) b) Integrated planning and scheduling. c) Mixed-initiative frameworks. d) Management of uncertainty (proactive and reactive). e) Autonomous agent architectures and distributed production management. e) Integration of machine learning capabilities. f) Wider scope of applications: 1) analysis of supplier/buyer protocols & tradeoffs; 2) integration of strategic & tactical decision-making; and 3) enterprise integration.

scheduling↗

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

Mixed Integer Programming↗

Estimation of Airline Benefits from Avionics Upgrade under Preferential Merge Re-sequence Scheduling

Modernization of the airline fleet avionics is essential to fully enable future technologies and procedures for increasing national airspace system capacity. However in the current national airspace system, system-wide benefits gained by avionics upgrade are not fully directed to aircraft/airlines that upgrade, resulting in slow fleet modernization rate. Preferential merge re-sequence scheduling is a best-equipped-best-served concept designed to incentivize avionics upgrade among airlines by allowing aircraft with new avionics (high-equipped) to be re-sequenced ahead of aircraft without the upgrades (low-equipped) at enroute merge waypoints. The goal of this study is to investigate the potential benefits gained or lost by airlines under a high or low-equipped fleet scenario if preferential merge resequence scheduling is implemented.

air traffic management↗

Runway Scheduling Using Generalized Dynamic Programming

A generalized dynamic programming method for finding a set of pareto optimal solutions for a runway scheduling problem is introduced. The algorithm generates a set of runway fight sequences that are optimal for both runway throughput and delay. Realistic time-based operational constraints are considered, including miles-in-trail separation, runway crossings, and wake vortex separation. The authors also model divergent runway takeoff operations to allow for reduced wake vortex separation. A modeled Dallas/Fort Worth International airport and three baseline heuristics are used to illustrate preliminary benefits of using the generalized dynamic programming method. Simulated traffic levels ranged from 10 aircraft to 30 aircraft with each test case spanning 15 minutes. The optimal solution shows a 40-70 percent decrease in the expected delay per aircraft over the baseline schedulers. Computational results suggest that the algorithm is promising for real-time application with an average computation time of 4.5 seconds. For even faster computation times, two heuristics are developed. As compared to the optimal, the heuristics are within 5% of the expected delay per aircraft and 1% of the expected number of runway operations per hour ad can be 100x faster.

optmization↗

Historical Mass, Power, Schedule, and Cost Growth for NASA Spacecraft

Although spacecraft developers have been moving towards standardized product lines as the aerospace industry has matured, NASA's continual need to push the cutting edge of science to accomplish unique, challenging missions can still lead to spacecraft resource growth over time. This paper assesses historical mass, power, cost, and schedule growth for multiple NASA spacecraft from the last twenty years and compares to industry reserve guidelines to understand where the guidelines may fall short. Growth is assessed from project start to launch, from the time of the preliminary design review (PDR) to launch and from the time of the critical design review (CDR) to launch. Data is also assessed not just at the spacecraft bus level, but also at the subsystem level wherever possible, to help obtain further insight into possible drivers of growth. Potential recommendations to minimize spacecraft mass, power, cost, and schedule growth for future missions are also discussed.

Schedule↗

Increasing Human Spaceflight Capabilities: Demonstration of Crew Autonomy Through Self-Scheduling Onboard International Space Station

For the first time in a spaceflight operational environment, our team enabled an ISS (International Space Station) crewmember to plan, reschedule, and execute their activities in real-time while abiding by flight and scheduling constraints. The Crew Autonomous Scheduling Test (CAST) investigated the novel concept of operations: allowing crew to manage their own timeline.

crew autonomy↗

Integration of Uncertain Ramp Area Aircraft Trajectories and Generation of Optimal Taxiway Schedules at Charlotte Douglas (CLT) Airport

The integration of aircraft maneuver characteristics into an optimal taxiway scheduling solution is challenging due to the uncertainties that are intrinsic to ramp area aircraft trajectories. To address the challenge, we build a stochastic model of ramp area aircraft trajectories that is used to generate a probabilistic measure of conflict within the Charlotte Douglas International Airport (CLT) ramp area. Parameters of the conflict distributions are estimated and passed to a Mixed Integer Linear Program that solves for an optimal taxiway schedule constrained to be conflict free in the presence of trajectory uncertainties. Here we extend our previous research by accounting for departing and arriving aircraft whereas our prior formulation only accounted for departing aircraft.

taxiway schedule↗

Alternatives for Scheduling Departures for Efficient Surface Metering in ATD-2: Exploration in a Human-in-the-Loop Simulation

Human-in-the-Loop (HITL) simulation was conducted to explore the impacts of various surface metering goals on operations and Ramp Controllers at Charlotte Douglas International Airport (CLT). Three conditions were compared: Baseline, with no surface metering, instructions to meet advisory times at the gate only, and instructions to meet advisory times at the gate as well as the times at the scheduled taxiway spot, where aircraft are delivered to Air Traffic Control (ATC). Results showed increased compliance for taxiway spot times when compliance was first met for gate advisories. Instructing Ramp Controllers to meet advisory times at the gate improves spot time compliance and therefore surface scheduling predictability at CLT. Results also demonstrated there was increased compliance overall with gate and spot times in the second condition. This was likely due to higher Ramp Controller workload in the third condition.

Airport surface scheduling↗

ATD-2 Phase 3 Scheduling in a Metroplex Environment Incorporating Trajectory Option Sets

The NASA Airspace Technology Demonstration 2 Phase 1 and 2 Field Evaluations have successfully demonstrated new technologies developed to manage the Integrated Arrival, Departure, and Surface traffic flows at a single airport. The Phase 3 Field Evaluation extends the capabilities to a Metroplex environment where multiple airports are interacting and sharing resources along the terminal boundary. This paper describes the scheduling algorithm enabling the coordinated scheduling and describes the interaction between airports within the Metroplex and the terminal boundary. We describe the metrics developed to inform flight operators about reroute opportunities and discuss the potential benefits to the rerouted flight and the system-wide aggregate benefits of a single reroute. We believe that the capabilities developed and the lessons learned during the Phase 3 Field Evaluation will set up the National Airspace System for future success.

Airspace Technology Demonstration 2↗