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.
In this paper, we present an approach that enables the automatic generation of high quality schedules, with respect to a given objective function. The approach involves the combination of two techniques: GenH, which automatically generates a search heuristic specialized to the given problem instance, and HBSS, which employs the generated heuristic as a bias within a stochastic sampling method.
Efficient and reliable scheduling of maintenance for power generation and transmission infrastructure is essential for minimizing operational costs and ensuring grid stability. This paper introduces an integrated optimization framework for coordinated maintenance scheduling of generators and transmission lines under resource and reliability constraints. The model minimizes a composite cost function including maintenance and generation costs, as well as penalties for delayed maintenance, while satisfying N−1 security constraints, operational limits, and crew availability. Case studies on the IEEE 300-bus test system demonstrate the effectiveness of the proposed approach in producing feasible and cost-effective maintenance schedules. To address scalability and combinatorial complexity, the model is mapped into a Quadratic Unconstrained Binary Optimization (QUBO) problem, enabling exploration of solution approaches based on Quantum Imaginary Time Evolution (QITE). While the QUBO reformulation provides a foundation for future quantum-inspired optimization, this study focuses primarily on the development and demonstration of the classical optimization framework and illustrates the potential applicability of QITE in large-scale maintenance scheduling.
The NASA Stratospheric Observatory for Infrared Astronomy (SOFIA) is a joint US/German project to develop and operate a gyro-stabilized 2.5-meter telescope in a Boeing 747SP. SOFIA's first science observations were made in December 2010. During 2011, SOFIA accomplished 30 flights in the "Early Science" program as well as a deployment to Germany. The new observing period, known as Cycle 1, is scheduled to begin in 2012. It includes 46 science flights grouped in four multi-week observing campaigns spread through a 13-month span. Automation of the flight scheduling process offers a major challenge to the SOFIA mission operations. First because it is needed to mitigate its relatively high cost per unit observing time compared to space-borne missions. Second because automated scheduling techniques available for ground-based and space-based telescopes are inappropriate for an airborne observatory. Although serious attempts have been made in the past to solve part of the problem, until recently mission operations staff was still manually scheduling flights. We present in this paper a new automated solution for generating SOFIA long-term schedules that will be used in operations from the Cycle 1 observing period. We describe the constraints that should be satisfied to solve the SOFIA scheduling problem in the context of real operations. We establish key formulas required to efficiently calculate the aircraft course over ground when evaluating flight schedules. We describe the foundations of the SOFIA long-term scheduler, the constraint representation, and the random search based algorithm that generates observation and instrument schedules. Finally, we report on how the new long-term scheduler has been used in operations to date.
Techniques for scheduling with resource-constraints are investigated. In particular, the use of zero-one programming and dispatching methods are discussed. An algorithm which combines characteristics of both existing methods to generate a valid schedule to experiments is introduced. Examples and test results are presented to illustrate the feasibility of the use of this algorithm on data typical to Spacelab missions.
NASA's Airspace Technology Demonstration-2 (ATD-2) integrates arrival, departure, and surface operations to extend integrated traffic sequencing all the way from the gate to the overhead stream and back again for multi-airport, metroplex environments. A key concept of ATD-2 centers on surface scheduling that allows aircraft to taxi, climb, and insert within the overhead stream with minimal interruptions. A core principle is to allow aircraft to absorb delay at the gate prior to engine start in order to reduce overall fuel burn and emissions. To achieve these goals, it is necessary for the scheduler to properly balance the demand at the runway with the available capacity while also predicting accurate takeoff times. This paper provides a data-driven analysis of the runway demand capacity balancing and measures the accuracy of schedules that are generated while running in a live operational environment at the Charlotte Douglas International Airport. We found that using minimum-time wake vortex separation constraints to define runway capacity resulted in scheduling departure operations at a slightly higher rate than the runway was operating and we discovered a surprising relationship between the runway rate and the accuracy of the schedules.
NASA's Airspace Technology Demonstration-2 (ATD-2) integrates arrival, departure, and surface operations to extend integrated traffic sequencing all the way from the gate to the overhead stream and back again for multi-airport, metroplex environments. A key concept of ATD-2 centers on surface scheduling that allows aircraft to taxi, climb, and insert within the overhead stream with minimal interruptions. A core principle is to allow aircraft to absorb delay at the gate prior to engine start in order to reduce overall fuel burn and emissions. To achieve these goals, it is necessary for the scheduler to properly balance the demand at the runway with the available capacity while also predicting accurate takeoff times. This paper provides a data-driven analysis of the runway demand capacity balancing and measures the accuracy of schedules that are generated while running in a live operational environment at the Charlotte Douglas International Airport. We found that using minimum-time wake vortex separation constraints to define runway capacity resulted in scheduling departure operations at a slightly higher rate than the runway was operating and we discovered a surprising relationship between the runway rate and the accuracy of the schedules.
An ERBS-TDRSS Contact Planning System (ERBS-TDRSS CPS) is described which uses a graphics interface and the NASA Transportable Inference Engine. The procedure involves transfer of the ERBS-TDRSS Ground Track Orbit Prediction data to the ERBS flight operations area, where the ERBS-TDRSS CPS automatically generates requests for TDRSS service. As requested events are rejected, alternative context sensitive strategies are employed to generate new requested events until a schedule is completed. A report generator builds schedule requests for separate ERBS-TDRSS contacts.
An ERBS-TDRSS Contact Planning System (ERBS-TDRSS CPS) is described which uses a graphics interface and the NASA Transportable Interference Engine. The procedure involves transfer of the ERBS-TDRSS Ground Track Orbit Prediction data to the ERBS flight operations area, where the ERBS-TDRSS CPS automatically generates requests for TDRSS service. As requested events are rejected, alternative context sensitive strategies are employed to generate new requested events until a schedule is completed. A report generator builds schedule requests for separate ERBS-TDRSS contacts.
This final report summarizes research performed under NASA contract NCC 2-531 toward generalization of constraint-based scheduling theories and techniques for application to space telescope observation scheduling problems. Our work into theories and techniques for solution of this class of problems has led to the development of the Heuristic Scheduling Testbed System (HSTS), a software system for integrated planning and scheduling. Within HSTS, planning and scheduling are treated as two complementary aspects of the more general process of constructing a feasible set of behaviors of a target system. We have validated the HSTS approach by applying it to the generation of observation schedules for the Hubble Space Telescope. This report summarizes the HSTS framework and its application to the Hubble Space Telescope domain. First, the HSTS software architecture is described, indicating (1) how the structure and dynamics of a system is modeled in HSTS, (2) how schedules are represented at multiple levels of abstraction, and (3) the problem solving machinery that is provided. Next, the specific scheduler developed within this software architecture for detailed management of Hubble Space Telescope operations is presented. Finally, experimental performance results are given that confirm the utility and practicality of the approach.
One-way range and Doppler methods for providing user orbit and time determination are examined. Forward link beacon tracking, with on-board processing of independent navigation signals broadcast continuously by TDAS spacecraft; forward link scheduled tracking; with on-board processing of navigation data received during scheduled TDAS forward link service intervals; and return link scheduled tracking; with ground-based processing of user generated navigation data during scheduled TDAS return link service intervals are discussed. A system level definition and requirements assessment for each alternative, an evaluation of potential navigation performance and comparison with TDAS mission model requirements is included. TDAS satellite tracking is also addressed for two alternatives: BRTS and VLBI tracking.
In the framework of NASA's return to the Moon efforts, the Lunar Reconnaissance Orbiter (LRO) is the first step. It is an unmanned mission to create a comprehensive atlas of the Moon's features and resources necessary to design and build a lunar outpost. LRO is scheduled for launch in April, 2009. LRO carries a payload comprised of six instruments and one technology demonstration. In addition to its scientific mission LRO will use new technologies, systems and flight operations concepts to reduce risk and increase productivity of future missions. As part of the effort to achieve robust and efficient operations, the LRO Mission Operations Team (MOT) will use its Mission Planning System (MPS) to manage the operational activities of the mission during the Lunar Orbit Insertion (LOI) and operational phases of the mission. The MPS, based on GMV's flexplan tool and developed for NASA with Honeywell Technology Solutions (prime contractor), will receive activity and slew maneuver requests from multiple science operations centers (SOC), as well as from the spacecraft engineers. flexplan will apply scheduling rules to all the requests received and will generate conflict free command schedules in the form of daily stored command loads for the orbiter and a set of daily pass scripts that help automate nominal real-time operations.
The mission planners for NASA's Europa Clipper deep-space mission use automated scheduling software to generate activity plans and command sequences for multiple instruments and subsystems before sending the sequences for execution on board. Both science and engineering planners must translate their intents into expressions of mission constraints, goals, and preferences that the scheduling engine understands. This paper describes the ongoing development of a dedicated domain-specific java-embedded language that can efficiently and accurately capture such concerns for the Europa Clipper mission, along with a user-interface companion for the language.
Defining requirements, missions, technologies, and concepts for space exploration involves multiple levels of organizations, teams of people with complementary skills, and analytical models and simulations. Analytical activities range from filling a To-Be-Determined (TBD) in a requirement to creating animations and simulations of exploration missions. In a program as large as returning to the Moon, there are hundreds of simultaneous analysis activities. A way to manage and integrate efforts of this magnitude is to deploy a centralized database that provides the capability to define tasks, identify resources, describe products, schedule deliveries, and generate a variety of reports. This paper describes a web-accessible task management system and explains the lessons learned during the development and deployment of the database. Through the database, managers and team leaders can define tasks, establish review schedules, assign teams, link tasks to specific requirements, identify products, and link the task data records to external repositories that contain the products. Data filters and spreadsheet export utilities provide a powerful capability to create custom reports. Import utilities provide a means to populate the database from previously filled form files. Within a four month period, a small team analyzed requirements, developed a prototype, conducted multiple system demonstrations, and deployed a working system supporting hundreds of users across the aeros pace community. Open-source technologies and agile software development techniques, applied by a skilled team enabled this impressive achievement. Topics in the paper cover the web application technologies, agile software development, an overview of the system's functions and features, dealing with increasing scope, and deploying new versions of the system.
The Chrysler/ERDA baseline automotive gas turbine engine was used to experimentally determine the power augmentation and emissions reductions achieved by the effect of variable compressor and power engine geometry, water injection downstream of the compressor, and increases in gas generator speed. Results were dependent on the mode of variable geometry utilization. Over 20 percent increase in power was accompanied by over 5 percent reduction in SFC. A fuel economy improvement of at least 6 percent was estimated for a vehicle with a 75 kW (100 hp) engine which could be augmented to 89 kW (120 hp) relative to an 89 Kw (120 hp) unaugmented engine.
This contract provided technical services and products to the Marshall Space Flight Center's Engineering Cost Office (PP03) and the Program Plans and Requirements Office (PP02) for the period of 3 Aug. 1991 - 30 Nov. 1994. Accomplishments summarized cover the REDSTAR data base, NASCOM hard copy data base, NASCOM automated data base, NASCOM cost model, complexity generators, program planning, schedules, NASA computer connectivity, other analytical techniques, and special project support.
Mathematical-analytical methods as used in Operations Research approaches are often insufficient for scheduling problems. This is due to three reasons: the combinatorial complexity of the search space, conflicting objectives for production optimization, and the uncertainty in the production process. Knowledge-based techniques, especially approximate reasoning and constraint relaxation, are promising ways to overcome these problems. A case study from an industrial CIM environment, namely high-grade steel production, is presented to demonstrate how knowledge-based scheduling with the desired capabilities could work. By using fuzzy set theory, the applied knowledge representation technique covers the uncertainty inherent in the problem domain. Based on this knowledge representation, a classification of jobs according to their importance is defined which is then used for the straightforward generation of a schedule. A control strategy which comprises organizational, spatial, temporal, and chemical constraints is introduced. The strategy supports the dynamic relaxation of conflicting constraints in order to improve tentative schedules.
We propose an optimization framework for stochastic optimal power flow with uncertain loads and renewable generator capacity. Our model follows previous work in assuming that generator outputs respond to load imbalances according to an affine control policy, but introduces a model of saturation of generator reserves by assuming that when a generator’s target level hits its limit, it abandons the affine policy and produces at that limit. This is a particularly interesting feature in models where wind power plants, which have uncertain upper generation limits, are scheduled to provide reserves to balance load fluctuations. Here, the resulting model is a nonsmooth nonconvex two-stage stochastic program, and we use a stochastic approximation method to find stationary solutions to a smooth approximation. Computational results on 6-bus and 118-bus test instances demonstrate that by considering the effects of saturation, our model can yield solutions with lower expected generation costs (at the same target line violation probability level) than those obtained from a model that enforces the affine policy to stay within generator limits with high probability.
The optimal scheduling of hydropower generation holds significant importance to power system operation. The unique requirements of environmental constraints and the power system, depending on their respective objectives, demand distinct flow patterns. While power system stakeholders strive to optimize revenue in electricity markets, stakeholders from boating recreation seeks to identify flow ranges that optimize the boating experience. In pursuit of a win-win solution, this study aims to reconcile the interests of various stakeholders in hydropower scheduling. The maximum revenue from day-ahead electricity market is explored through an optimization process considering both plant operation constraints, boating flow constraints, water availability, and market prices. Results of real world case studies at a river in California show that the proposed approach can achieve dual objectives: maximizing market revenue while addressing boating recreation necessities. In addition, as the accuracy of electricity price forecasting and flow forecasting increase, the optimal revenue becomes increasingly advantageous to hydropower plant operators.