SEARCH · Engineering Papers

Results for “planning scheduling optimization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

NASA NTRS2010

Multi-Objective Multi-User Scheduling for Space Science Missions

We have developed an architecture called MUSE (Multi-User Scheduling Environment) to enable the integration of multi-objective evolutionary algorithms with existing domain planning and scheduling tools. Our approach is intended to make it possible to re-use existing software, while obtaining the advantages of multi-objective optimization algorithms. This approach enables multiple participants to actively engage in the optimization process, each representing one or more objectives in the optimization problem. As initial applications, we apply our approach to scheduling the James Webb Space Telescope, where three objectives are modeled: minimizing wasted time, minimizing the number of observations that miss their last planning opportunity in a year, and minimizing the (vector) build up of angular momentum that would necessitate the use of mission critical propellant to dump the momentum. As a second application area, we model aspects of the Cassini science planning process, including the trade-off between collecting data (subject to onboard recorder capacity) and transmitting saved data to Earth. A third mission application is that of scheduling the Cluster 4-spacecraft constellation plasma experiment. In this paper we describe our overall architecture and our adaptations for these different application domains. We also describe our plans for applying this approach to other science mission planning and scheduling problems in the future.

science planning↗

NASA NTRS1990

Automated control of hierarchical systems using value-driven methods

An introduction is given to the Value-driven methodology, which has been successfully applied to solve a variety of difficult decision, control, and optimization problems. Many real-world decision processes (e.g., those encountered in scheduling, allocation, and command and control) involve a hierarchy of complex planning considerations. For such problems it is virtually impossible to define a fixed set of rules that will operate satisfactorily over the full range of probable contingencies. Decision Science Applications' value-driven methodology offers a systematic way of automating the intuitive, common-sense approach used by human planners. The inherent responsiveness of value-driven systems to user-controlled priorities makes them particularly suitable for semi-automated applications in which the user must remain in command of the systems operation. Three examples of the practical application of the approach in the automation of hierarchical decision processes are discussed: the TAC Brawler air-to-air combat simulation is a four-level computerized hierarchy; the autonomous underwater vehicle mission planning system is a three-level control system; and the Space Station Freedom electrical power control and scheduling system is designed as a two-level hierarchy. The methodology is compared with rule-based systems and with other more widely-known optimization techniques.

Pugh, George E.↗

NASA NTRS1998

A Hybrid Procedural/Deductive Executive for Autonomous Spacecraft

The New Millennium Remote Agent (NMRA) will be the first AI system to control an actual spacecraft. The spacecraft domain places a strong premium on autonomy and requires dynamic recoveries and robust concurrent execution, all in the presence of tight real-time deadlines, changing goals, scarce resource constraints, and a wide variety of possible failures. To achieve this level of execution robustness, we have integrated a procedural executive based on generic procedures with a deductive model-based executive. A procedural executive provides sophisticated control constructs such as loops, parallel activity, locks, and synchronization which are used for robust schedule execution, hierarchical task decomposition, and routine configuration management. A deductive executive provides algorithms for sophisticated state inference and optimal failure recover), planning. The integrated executive enables designers to code knowledge via a combination of procedures and declarative models, yielding a rich modeling capability suitable to the challenges of real spacecraft control. The interface between the two executives ensures both that recovery sequences are smoothly merged into high-level schedule execution and that a high degree of reactivity is retained to effectively handle additional failures during recovery.

Pell, Barney↗

NASA NTRS2026

Deep RL for Fast Long-Horizon Operations Scheduling on NASA's Carruthers Geocorona Observatory Mission

Spacecraft operations scheduling is a highly constrained, long-horizon combinatorial optimization problem that traditionally relies on heuristics, constraint programming, or manual planning. We present a scalable deep reinforcement learning framework developed and deployed for NASA’s Carruthers Geocorona Observatory mission. Our framework introduces a macro-action abstraction known as activity blocks coupled with dynamic action-masking to navigate the intractably large search space and strictly enforce complex power, thermal, and instrument constraints. The resulting architecture generates globally feasible schedules with overwhelming probability, establishes operational trust, and executes a full training cycle in under six hours, circumventing the need for policy robustness by enabling rapid, on-demand retraining. Further, resulting schedules outperform baseline heuristics in scheduled science quality. The deep reinforcement learning framework was deployed as the default operational scheduler for the Carruthers Geocorona Observatory mission from the outset of the mission, demonstrating that deep reinforcement learning can be trusted for real spacecraft operations under complex, evolving constraints.

Geocorona↗

NASA NTRS2020

The XRISM Science Data Center: Optimizing the Scientific Return from a Unique X-ray Observatory

The X-Ray Imaging and Spectroscopy Mission, XRISM, is currently scheduled to launch in 2022 with the objective of building on the brief, but significant, successes of the ASTRO-H (Hitomi) mission in solving outstanding astrophysical questions using high resolution X-ray spectroscopy. The XRISM Science Operations Team (SOT) consists of the JAXA-led Science Operations Center (SOC) and NASA-led Science Data Center (SDC), which work together to optimize the scientific output from the Resolve high-resolution spectrometer and the Xtend wide-field imager through planning and scheduling of observations, processing and distribution of data, development and distribution of software tools and the calibration database (CaldB), support of ground and in-flight calibration, and support of XRISM users in their scientific investigations of the energetic universe. Here, we summarize the roles and responsibilities of the SDC and its current status and future plans. The Resolve instrument poses particular challenges due to its unprecedented combination of high spectral resolution and throughput, broad spectral coverage, and relatively small field-of-view and large pixel-size. We highlight those challenges and how they are being met.

XRISM↗

NASA NTRS1988

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.↗

NASA NTRS1977

Integrated payload and mission planning, phase 3. Volume 4: Optimum utilization of Spacelab racks and pallets

The methodology to optimize the utilization of Spacelab racks and pallets and to apply this methodology to the early STS Spacelab missions was developed. A review was made of Spacelab Program requirements and flow plans, generic flow plans for racks and pallets were examined, and the principal optimization criteria and methodology were established. Interactions between schedule, inventory, and key optimization factors; schedule and cost sensitivity to optional approaches; and the development of tradeoff methodology were addressed. This methodology was then applied to early spacelab missions (1980-1982). Rack and pallet requirements and duty cycles were defined, a utilization assessment was made, and several trade studies performed involving varying degrees of Level IV integration, inventory level, and shared versus dedicated Spacelab racks and pallets.

Logston, R. G.↗

NASA NTRS2003

Runway Operations Planning: A Two-Stage Heuristic Algorithm

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, can also be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. This paper introduces a two stage heuristic algorithm for solving the Runway Operations Planning (ROP) problem. In the first stage, sequences of departure class slots and runway crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program with a Branch & Bound algorithm implementation. Preliminary results from this implementation of the two-stage algorithm on real-world traffic data are presented.

Anagnostakis, Ioannis↗

NASA NTRS2005

Optimizing observing sequence design for periodic and non-periodic phenomena : a Bayesian approach

In this paper we report on our progress on addressing these issues. We have developed an approximate expression for the uniformity of phase coverage that can be used when scheduling to assess candidate sample times. We describe the results obtained using this estimator, and compare them with detailed simulations. We describe our progress and plans for integrating optimizing criteria for both periodic and non-periodic observations into a single observation sequence.

Bayesian↗

NASA NTRS2016

Runway Scheduling for Charlotte Douglas International Airport

This paper describes the runway scheduler that was used in the 2014 SARDA human-in-the-loop simulations for CLT. The algorithm considers multiple runways and computes optimal runway times for departures and arrivals. In this paper, we plan to run additional simulation on the standalone MRS algorithm and compare the performance of the algorithm against a FCFS heuristic where aircraft avail of runway slots based on a priority given by their positions in the FCFS sequence. Several traffic scenarios corresponding to current day traffic level and demand profile will be generated. We also plan to examine the effect of increase in traffic level (1.2x and 1.5x) and observe trends in algorithm performance.

runway scheduling↗

NASA NTRSDate not supplied

Early Assessments of Crew Timelines for the Lunar Surface Habitat

As NASA progresses towards sustained crewed space missions, crew timelines will become increasingly important to achieving mission goals. While it is desirable to spend as much time as possible during crewed space missions on science activities and experiments, there are a large number of activities that crew members must perform each day in order to maintain both crew and vehicle health and safety. The time available for science activities in space is highly dependent on mandatory tasks required for crew and vehicle health and safety. The different crewed activities need to be planned accordingly long before the start of a mission in order to optimize crew time for science. To begin assessing the potential crew time for available for science, an understanding of the requirements to maintain crew and vehicle health and safety is needed. These additional activities may include sleep, exercise, vehicle maintenance, logistics handling, crew personal time, as well as many other tasks. The remaining time outside of these required tasks, within a reasonable crew work schedule, can be dedicated to science operations. This paper will detail a collaborative effort to analyzing crew times for sustained spaceflight missions and how the results of that analysis are applied to the crew timeline for the proposed Lunar Surface Habitat (SH).To determine the crew time for all of these required activities, an analysis was conducted utilizing defined agency requirements and historical crewed mission data. Predicted crew activity times were integrated into a daily schedule in order to optimize the crew’s time during the mission. This methodology was utilized to produce expected crew timelines for NASA’s proposed Artemis Base Camp (ABC) missions. The current plans for the ABC contain two different sustained habitats, the Pressurized Rover (PR) and the Surface Habitat (SH). While the crew are separated between the two habitats, the timelines for each element are dependent on the other element’s operations, so the two element timelines are formed in conjunction with one another. The results described in this paper, however, will focus solely on the crew timeline in the SH. This paper will explain the methodology behind predicting the required crew time spent in the SH for each activity, and the process of incorporating these predicted crew times into a coherent schedule.

Crew Time↗

NASA NTRS1986

An expert system for ground support of the Hubble space telescope

The Hubble Space Telescope is an orbiting optical observatory due to be launched by the Space Shuttle in late 1987. It is a complex, multi-instrument observatory whose resources will be available to the world-wide astronomical community. The 'Transformation' system is a hybrid system which utilizes a rule-based expert system to convert scientific proposals into pre-optimized linked hierarchies of spacecraft activities. These activities are generated in a format that can be directly scheduled by the planning and scheduling component of the Space Telescope ground support system. The Transformation system will be described in detail in this paper, with particular attention given to the rule base.

Rosenthal, Don↗

NASA NTRS1991

Development of technology needs for the SEI TNIM network

A comparison of the salient features of the SEI with previous space exploration programs shows the need for a telecommunications, navigation and information management (TNIM) system level reoptimization. An approach is developed that takes the various candidate mission plans and decomposes them into architectural building blocks, many of which are common to several of the plans. Once identified, each of these blocks can then be parametrically examined with respect to performance benefit, cost, technology, and schedule risk tradeoffs. As the Space Exploration Initiative plan is established, these TNIM building blocks may be fused into an optimized system architecture.

Wachs, M. R.↗

DOE OSTI2024

Multi-Timescale Optimal Operation Framework for Integrated Economic and Reliability Analysis of Hybrid Power Plants

This paper introduces a hierarchical modeling framework for hybrid power plants (HPP) to facilitate the operation of HPP in power systems similar to conventional generators (Congens) in the integrated multi-timescale optimal operation framework. To consider the uncertainties of HPP renewable power in the day-ahead scheduling, distributionally robust optimization (DRO) is used. To ensure that the state-of-charge (SOC) of energy storage systems in HPPs aligns closely with the planned value for long-term reliability, real-time SOC management is incorporated. In addition, an adjustable real-time control is designed for the robust delivery of HPP real-time services. Case studies performed on a revised IEEE 39-bus system demonstrate the effectiveness of the proposed framework for HPP operation. Simulation results highlight that the proposed framework not only can help operators schedule HPP similar to Congens in varying weather conditions but can also maintain the frequency reliability of the system.

frequency stability↗

NASA NTRS2001

Planning and Scheduling for Fleets of Earth Observing Satellites

We address the problem of scheduling observations for a collection of earth observing satellites. This scheduling task is a difficult optimization problem, potentially involving many satellites, hundreds of requests, constraints on when and how to service each request, and resources such as instruments, recording devices, transmitters, and ground stations. High-fidelity models are required to ensure the validity of schedules; at the same time, the size and complexity of the problem makes it unlikely that systematic optimization search methods will be able to solve them in a reasonable time. This paper presents a constraint-based approach to solving the Earth Observing Satellites (EOS) scheduling problem, and proposes a stochastic heuristic search method for solving it.

Frank, Jeremy↗

NASA NTRS2013

Mission Data System Java Edition Version 7

The Mission Data System framework defines closed-loop control system abstractions from State Analysis including interfaces for state variables, goals, estimators, and controllers that can be adapted to implement a goal-oriented control system. The framework further provides an execution environment that includes a goal scheduler, execution engine, and fault monitor that support the expression of goal network activity plans. Using these frameworks, adapters can build a goal-oriented control system where activity coordination is verified before execution begins (plan time), and continually during execution. Plan failures including violations of safety constraints expressed in the plan can be handled through automatic re-planning. This version optimizes a number of key interfaces and features to minimize dependencies, performance overhead, and improve reliability. Fault diagnosis and real-time projection capabilities are incorporated. This version enhances earlier versions primarily through optimizations and quality improvements that raise the technology readiness level. Goals explicitly constrain system states over explicit time intervals to eliminate ambiguity about intent, as compared to command-oriented control that only implies persistent intent until another command is sent. A goal network scheduling and verification process ensures that all goals in the plan are achievable before starting execution. Goal failures at runtime can be detected (including predicted failures) and handled by adapted response logic. Responses can include plan repairs (try an alternate tactic to achieve the same goal), goal shedding, ignoring the fault, cancelling the plan, or safing the system.

Reinholtz, William K.↗

NASA NTRS2016

Strategic Design of Long-Haul and Oceanic Aircraft Trajectories in Aviation Operations

Long-Haul Aircraft consume most of their fuel during the cruise phase of flight. The inefficiency in cruise flights compared to efficient routes varies is around 3 to 4. The efficiency of oceanic flights is low due to limited navigational and communication equipment, congestion and airspace restrictions. The availability of Automated Dependent Surveillance-Broadcast (ADS-B) and other improvements provides opportunity for better strategic planning of trajectories. Transatlantic flights between US and Europe constitute one of the busiest oceanic airspace regions in the world. This talk examines the benefits of a wind-optimal trajectory concept with a strategic de-confliction component compared to the current flight planning using the North Atlantic Tracks. The analysis is based on air traffic between US and Europe during July 2012. The potential fuel savings are in the range of (420-970) kg per flight for a Boeing 767-300, the most widely used aircraft between the city-pairs in this study. The talk also describes a global simulation of aviation operations combining flight plans and real air traffic data with historical commercial city-pair aircraft type and schedule data and global atmospheric data. The resulting capability extends the simulation and optimization functions of NASAs Future Air Traffic Management Concept Evaluation Tool (FACET) to global scale. This new capability is used to characterize the evolution of global air traffic, analyze fuel savings and seasonal variations in the long-haul wind-optimal traffic patterns in six major regions of the world.

strategic trajectory design↗

NASA NTRS1991

A trajectory planning scheme for spacecraft in the space station environment

Simulated annealing is used to solve a minimum fuel trajectory problem in the space station environment. The environment is special because the space station will define a multivehicle environment in space. The optimization surface is a complex nonlinear function of the initial conditions of the chase and target crafts. Small permutations in the input conditions can result in abrupt changes to the optimization surface. Since no prior knowledge about the number or location of local minima on the surface is available, the optimization must be capable of functioning on a multimodal surface. It was reported in the literature that the simulated annealing algorithm is more effective on such surfaces than descent techniques using random starting points. The simulated annealing optimization was found to be capable of identifying a minimum fuel, two-burn trajectory subject to four constraints which are integrated into the optimization using a barrier method. The computations required to solve the optimization are fast enough that missions could be planned on board the space station. Potential applications for on board planning of missions are numerous. Future research topics may include optimal planning of multi-waypoint maneuvers using a knowledge base to guide the optimization, and a study aimed at developing robust annealing schedules for potential on board missions.

Soller, Jeffrey Alan↗