Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimal 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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Stanford Hardware Development Program

Architectures for high performance, digital signal processing, particularly for high resolution, wide band spectrum analysis were developed. These developments are intended to provide instrumentation for NASA's Search for Extraterrestrial Intelligence (SETI) program. The real time signal processing is both formal and experimental. The efficient organization and optimal scheduling of signal processing algorithms were investigated. The work is complemented by efforts in processor architecture design and implementation. A high resolution, multichannel spectrometer that incorporates special purpose microcoded signal processors is being tested. A general purpose signal processor for the data from the multichannel spectrometer was designed to function as the processing element in a highly concurrent machine. The processor performance required for the spectrometer is in the range of 1000 to 10,000 million instructions per second (MIPS). Multiple node processor configurations, where each node performs at 100 MIPS, are sought. The nodes are microprogrammable and are interconnected through a network with high bandwidth for neighboring nodes, and medium bandwidth for nodes at larger distance. The implementation of both the current mutlichannel spectrometer and the signal processor as Very Large Scale Integration CMOS chip sets was commenced.

Peterson, A.↗
NASA NTRS1989

Approximation algorithms for planning and control

A control system operating in a complex environment will encounter a variety of different situations, with varying amounts of time available to respond to critical events. Ideally, such a control system will do the best possible with the time available. In other words, its responses should approximate those that would result from having unlimited time for computation, where the degree of the approximation depends on the amount of time it actually has. There exist approximation algorithms for a wide variety of problems. Unfortunately, the solution to any reasonably complex control problem will require solving several computationally intensive problems. Algorithms for successive approximation are a subclass of the class of anytime algorithms, algorithms that return answers for any amount of computation time, where the answers improve as more time is allotted. An architecture is described for allocating computation time to a set of anytime algorithms, based on expectations regarding the value of the answers they return. The architecture described is quite general, producing optimal schedules for a set of algorithms under widely varying conditions.

Boddy, Mark↗
NASA NTRS1990

i-SAIRAS '90; Proceedings of the International Symposium on Artificial Intelligence, Robotics and Automation in Space, Kobe, Japan, Nov. 18-20, 1990

The present conference on artificial intelligence (AI), robotics, and automation in space encompasses robot systems, lunar and planetary robots, advanced processing, expert systems, knowledge bases, issues of operation and management, manipulator control, and on-orbit service. Specific issues addressed include fundamental research in AI at NASA, the FTS dexterous telerobot, a target-capture experiment by a free-flying robot, the NASA Planetary Rover Program, the Katydid system for compiling KEE applications to Ada, and speech recognition for robots. Also addressed are a knowledge base for real-time diagnosis, a pilot-in-the-loop simulation of an orbital docking maneuver, intelligent perturbation algorithms for space scheduling optimization, a fuzzy control method for a space manipulator system, hyperredundant manipulator applications, robotic servicing of EOS instruments, and a summary of astronaut inputs on automation and robotics for the Space Station Freedom.

Source record↗
NASA NTRS1996

Balancing Contention and Synchronization on the Intel Paragon

The Intel Paragon is a mesh-connected distributed memory parallel computer. It uses an oblivious and deterministic message routing algorithm: this permits us to develop highly optimized schedules for frequently needed communication patterns. The complete exchange is one such pattern. Several approaches are available for carrying it out on the mesh. We study an algorithm developed by Scott. This algorithm assumes that a communication link can carry one message at a time and that a node can only transmit one message at a time. It requires global synchronization to enforce a schedule of transmissions. Unfortunately global synchronization has substantial overhead on the Paragon. At the same time the powerful interconnection mechanism of this machine permits 2 or 3 messages to share a communication link with minor overhead. It can also overlap multiple message transmission from the same node to some extent. We develop a generalization of Scott's algorithm that executes complete exchange with a prescribed contention. Schedules that incur greater contention require fewer synchronization steps. This permits us to tradeoff contention against synchronization overhead. We describe the performance of this algorithm and compare it with Scott's original algorithm as well as with a naive algorithm that does not take interconnection structure into account. The Bounded contention algorithm is always better than Scott's algorithm and outperforms the naive algorithm for all but the smallest message sizes. The naive algorithm fails to work on meshes larger than 12 x 12. These results show that due consideration of processor interconnect and machine performance parameters is necessary to obtain peak performance from the Paragon and its successor mesh machines.

Bokhari, Shahid H.↗
NASA NTRS1994

Models of Human Information Requirements: "When Reasonable Aiding Systems Disagree"

Aircraft flight management and Air Traffic Control (ATC) automation are under development to maximize the economy of flight and to increase the capacity of the terminal area airspace while maintaining levels of flight safety equal to or better than current system performance. These goals are being realized by the introduction of flight management automation aiding and operations support systems on the flight deck and by new developments of ATC aiding systems that seek to optimize scheduling of aircraft while potentially reducing required separation and accounting for weather and wake vortex turbulence. Aiding systems on both the flight deck and the ground operate through algorithmic functions on models of the aircraft and of the airspace. These models may differ from each other as a result of variations in their models of the immediate environment. The resultant flight operations or ATC commands may differ in their response requirements (e.g. different preferred descent speeds or descent initiation points). The human operators in the system must then interact with the automation to reconcile differences and resolve conflicts. We have developed a model of human performance including cognitive functions (decision-making, rule-based reasoning, procedural interruption recovery and forgetting) that supports analysis of the information requirements for resolution of flight aiding and ATC conflicts. The model represents multiple individuals in the flight crew and in ATC. The model is supported in simulation on a Silicon Graphics' workstation using Allegro Lisp. Design guidelines for aviation automation aiding systems have been developed using the model's specification of information and team procedural requirements. Empirical data on flight deck operations from full-mission flight simulation are provided to support the model's predictions. The paper describes the model, its development and implementation, the simulation test of the model predictions, and the empirical validation process. The model and its supporting data provide a generalizable tool that is being expanded to include air/ground compatibility and ATC crew interactions in air traffic management.

Corker, Kevin↗
NASA NTRS2003

Expected Improvements in VLBI Measurements of the Earth's Orientation

Measurements of the Earth s orientation since the 1970s using space geodetic techniques have provided a continually expanding and improving data set for studies of the Earth s structure and the distribution of mass and angular momentum. The accuracy of current one-day measurements is better than 100 microarcsec for the motion of the pole with respect to the celestial and terrestrial reference frames and better than 3 microsec for the rotation around the pole. VLBI uniquely provides the three Earth orientation parameters (nutation and UTI) that relate the Earth to the extragalactic celestial reference frame. The accuracy and resolution of the VLBI Earth orientation time series can be expected to improve substantially in the near future because of refinements in the realization of the celestial reference frame, improved modeling of the troposphere and non-linear station motions, larger observing networks, optimized scheduling, deployment of disk-based Mark V recorders, full use of Mark IV capabilities, and e-VLBI. More radical future technical developments will be discussed.

Ma, Chopo↗
NASA NTRS2008

James Webb Space Telescope - Applying Lessons Learned to I&T

The James Webb Space Telescope (JWST) is part of a new generation of spacecraft acquiring large data volumes from remote regions in space. To support a mission such as the JWST, it is imperative that lessons learned from the development of previous missions such as the Hubble Space Telescope and the Earth Observing System mission set be applied throughout the development and operational lifecycles. One example of a key lesson that should be applied is that core components, such as the command and telemetry system and the project database, should be developed early, used throughout development and testing, and evolved into the operational system. The purpose of applying lessons learned is to reap benefits in programmatic or technical parameters such as risk reduction, end product quality, cost efficiency, and schedule optimization. In the cited example, the early development and use of the operational command and telemetry system as well as the establishment of the intended operational database will allow these components to be used by the developers of various spacecraft components such that development, testing, and operations will all use the same core components. This will reduce risk through the elimination of transitions between development and operational components and improve end product quality by extending the verification of those components through continual use. This paper will discuss key lessons learned that have been or are being applied to the JWST Ground Segment integration and test program.

Johns, Alan↗
NASA NTRSDate not supplied

TechEdSat-11: Prototyping Autonomous Communications in Orbit

Cognitive Engine 1 (CE-1) is a state-of-the-art automated system designed to manage routine operations and respond to adverse events without requiring human operator input. CE-1 will optimize scheduling capabilities, detect and react to link failures, and ensure data delivery deadlines are met efficiently. Seamless roaming between government and commercial providers will allow for a robust and cost-effective network. TechEdSat-11 will demonstrate two key components of CE-1: User Initiated Services (UIS) and Delay Tolerant Networking (DTN). The first phase of the experiment will use UIS to automate on-demand scheduling of a commercial S-band ground station. Later phases of the experiment will demonstrate DTN store-and-forward and space internetworking capabilities through the TechEdSat-11 S-band radio. This paper will discuss the CE-1 main components relevant to the experiment, the flight and ground software architecture, experiment concept of operations and preliminary results.

Rachel Dudukovich↗
DOE OSTI2020

LBNF CMGC Delivery Method: ICE Process

The Construction Manager/General Contractor (CM/GC) delivery method is intended to benefit the design process, value engineering, risk mitigation, and schedule optimization while promoting construction and design innovation. This delivery method is particularly suited for complex projects that require significant consideration of contractor means and methods. Fermilab’s Far Site Conventional Facilities proceeded with a CM/GC delivery method to account for the unique conditions of excavating over 300,000 cubic yards of rock in tunnels and caverns that will be constructed approximately 5000-ft deep in the repurposed Homestake Mine in Lead, SD. The experiences of the Independent Cost Estimating (ICE) process are presented.

Pelletier, Douglas↗
DOE OSTI2024

Digital Twin Enabling Technologies for Online Condition Monitoring of Nuclear Power Plant Components

Online condition monitoring is an area of active research that may enable improved scheduling, maintenance, and safety of nuclear power plant components, reducing unnecessary derate while simultaneously improving operational capacity. Digital twins are one avenue to conduct online condition monitoring and are currently being explored by national laboratories and universities alike. Digital twins for online condition monitoring are, in essence, state concurrent models that emulate a physical process which predicts a parameter and compares it against a measured value. However, digital twins may also provide additional insights by combining and interpreting various sources of information. These insights may be used for preventative maintenance scheduling optimization or early fault detection and are projected to be valuable for meeting requirements under 10 CFR 50.55a. However, digital twin technologies are still under significant development; quantifying model uncertainties, improving unique fault identification, and multimodal sensor fusion are some areas under investigation. Therefore, in this work, we discuss and review the various enabling technologies, in the form of advanced sensors, instrumentation, and modelling methods, that may be used to implement and enhance digital twins for online condition monitoring. A potential use case for pump-motors is presented to demonstrate how these various pieces of enabling digital twin technologies may integrated together for online condition monitoring. Challenges and opportunities associated with the pump-motor digital twin enabling technologies are also identified and discussed.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Digital-Twin-Enabling Technologies for Online Condition Monitoring of Nuclear Power Plant Components

Online condition monitoring is an area of active research that may enable improved scheduling, maintenance, and safety of nuclear power plant components, reducing unnecessary derates while simultaneously improving operational capacity. Digital twins are one avenue to conduct online condition monitoring and are currently being explored by national laboratories and universities alike. Digital twins for online condition monitoring are, in essence, state concurrent models that emulate a physical process which predicts a parameter and compares it against a measured value. However, digital twins may also provide additional insights by combining and interpreting various sources of information. These insights may be used for preventative maintenance scheduling optimization or early fault detection and are projected to be valuable for meeting requirements under 10 CFR 50.55a. However, digital twin technologies are still under significant development; quantifying model uncertainties, improving unique fault identification, and multimodal sensor fusion are some areas under investigation. Therefore, in this work, we discuss and review the various enabling technologies, in the form of advanced sensors, instrumentation, and modelling methods, that may be used to implement and enhance digital twins for online condition monitoring. A potential use case for pump-motors is presented to demonstrate how these various pieces of enabling digital twin technologies may integrated together for online condition monitoring. Challenges and opportunities associated with the pump-motor digital twin enabling technologies are also identified and discussed.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

INTEGRATION OF DATA ANALYTICS WITH SYSTEM HEALTH PROGRAMS

Industry equipment reliability and asset management programs are essential elements that help ensure the safe and economical operation of nuclear power plants. The effectiveness of these programs is addressed in several industry developed and regulatory programs. However, these programs have proven to be labor intensive and expensive. There is an opportunity to significantly enhance the collection, analysis, and use of this information to provide more cost-effective plant operation. Additionally, there is an acute industry need to leverage advanced technology to reduce costs and improve operational effectiveness. The goal of this paper is to provide effective and efficient analytical methods and tools to support risk-informed decisions for the equipment reliability and asset management programs at nuclear power plants. This is accomplished by creating a direct bridge between component health/lifecycle data and decision making (e.g., maintenance scheduling and project prioritization). Here we are supporting typical system engineer decisions regarding maintenance activity scheduling and component ageing management. This is performed in a risk-informed context where herein the term “risk” is broadly constructed to include both plant reliability and economics. This framework combines data analytics tools to analyze equipment reliability data with risk-informed methods designed to support system engineer decisions (e.g., maintenance and replacement schedules, optimal maintenance posture) in a customizable workflow. A challenge is that the structure of this workflow strongly depends on the decision that needs to be made, the type of data available, and the constraints that need to be considered. Current methods are designed to provide specific answers to specific problems; however, these methods might prove to be inadequate even when problem settings slightly change (e.g., different types of requirements, additional dependencies between system reliability and economics). We tackled this challenge by designing framework in a flexible and modular fashion such that the user can assemble and customize his/her own workflow that integrates SSC economic lifecycle models (e.g., maintenance and replacement costs), system reliability models, and optimization methods.

97 - MATHEMATICS AND COMPUTING↗
NASA NTRS1987

Optimal pre-scheduling of problem remappings

A large class of scientific computational problems can be characterized as a sequence of steps where a significant amount of computation occurs each step, but the work performed at each step is not necessarily identical. Two good examples of this type of computation are: (1) regridding methods which change the problem discretization during the course of the computation, and (2) methods for solving sparse triangular systems of linear equations. Recent work has investigated a means of mapping such computations onto parallel processors; the method defines a family of static mappings with differing degrees of importance placed on the conflicting goals of good load balance and low communication/synchronization overhead. The performance tradeoffs are controllable by adjusting the parameters of the mapping method. To achieve good performance it may be necessary to dynamically change these parameters at run-time, but such changes can impose additional costs. If the computation's behavior can be determined prior to its execution, it can be possible to construct an optimal parameter schedule using a low-order-polynomial-time dynamic programming algorithm. Since the latter can be expensive, the performance is studied of the effect of a linear-time scheduling heuristic on one of the model problems, and it is shown to be effective and nearly optimal.

Nicol, David M.↗
NASA NTRSDate not supplied

Sensitivity of Optimal Midcourse Correction Scheduling for Robust Cislunar Trajectory Design

A new approach to optimal trajectory design is the determination of optimal trajectories that are robust to initial trajectory dispersions, navigation errors, maneuver execution errors, and environment modeling errors. This paper investigates the sensitivity of cislunar robust optimal trajectory design to launch date, duration of navigation measurement passes, and navigation measurement frequency. For a given cislunar trajectory from translunar injection (TLI) to lunar orbit insertion (LOI), the optimal locations of midcourse corrections, also known as trajectory correction maneuvers (TCM) are determined by minimizing the final 3-σ ∆v subject to a final 3-σ position dispersion constraint for a given launch date, specified measurement pass duration prior to each maneuver, and measurement frequency. Optical navigation (OpNav) is assumed, and OpNav field-of-view (FOV) and lighting constraints are employed. These constraints turn out to be important elements of the problem. The sensitivity of the optimal TCM locations are then investigated by varying the launch date, duration of OpNav measurement passes, and the OpNav measurement frequency, and then re-optimizing the locations of the TCMs. Given the problem parameters provided herein, results show that while the optimal TCM locations with respect to TLI vary greatly from one launch date to another, their locations with respect to LOI are nearly invariant over a 2-month launch window. Results also show that in all cases the optimal location of the last TCM is found to be at the point where the OpNav lunar FOV constraint is first violated. For all other TCMs, OpNav measurement pass duration and measurement frequency can have a moderate to large affect on the optimal TCM locations.

Linear Covariance Analysis↗
NASA NTRS2017

Integrating Growth Stage Deficit Irrigation into a Process Based Crop Model

Current rates of agricultural water use are unsustainable in many regions, creating an urgent need to identify improved irrigation strategies for water limited areas. Crop models can be used to quantify plant water requirements, predict the impact of water shortages on yield, and calculate water productivity (WP) to link water availability and crop yields for economic analyses. Many simulations of crop growth and development, especially in regional and global assessments, rely on automatic irrigation algorithms to estimate irrigation dates and amounts. However, these algorithms are not well suited for water limited regions because they have simplistic irrigation rules, such as a single soil-moisture based threshold, and assume unlimited water. To address this constraint, a new modeling framework to simulate agricultural production in water limited areas was developed. The framework consists of a new automatic irrigation algorithm for the simulation of growth stage based deficit irrigation under limited seasonal water availability; and optimization of growth stage specific parameters. The new automatic irrigation algorithm was used to simulate maize and soybean in Gainesville, Florida, and first used to evaluate the sensitivity of maize and soybean simulations to irrigation at different growth stages and then to test the hypothesis that water productivity calculated using simplistic irrigation rules underestimates WP. In the first experiment, the effect of irrigating at specific growth stages on yield and irrigation water use efficiency (IWUE) in maize and soybean was evaluated. In the reproductive stages, IWUE tended to be higher than in the vegetative stages (e.g. IWUE was 18% higher than the well watered treatment when irrigating only during R3 in soybean), and when rainfall events were less frequent. In the second experiment, water productivity (WP) was significantly greater with optimized irrigation schedules compared to non-optimized irrigation schedules in water restricted scenarios. For example, the mean WP across 38 years of maize production was 1.1 kg/cu m for non-optimized irrigation schedules with 50 mm of seasonal available water and 2.1 kg/cu m optimized ion schedules, a 91% improvement in WP with optimized irrigation schedules. The framework described in this work could be used to estimate WP for regional to global assessments, as well as derive location specific irrigation guidance.

crop model↗
DOE OSTI2025

Optimal Network Reconfiguration and Scheduling With Hardware-in-the-Loop Validation for Improved Microgrid Resilience

With the increased occurrence of various major extreme weather events, power outages and prompt power system restorations have recently drawn more attention to the resilience and recovery of power systems. From the perspective of a more resilient power delivery at the distribution grid, system restoration using network topology reconfiguration together with optimal scheduling of distributed energy resources are adopted in this paper. The proposed optimization model aims at minimizing the total load shedding cost and other operational costs, in which linearized topological constraints borrowed from graph theory and linearized DistFlow models are respectively used to maintain the radial network topology and power flow balance after system contingencies. To demonstrate the applicability of the proposed strategy, a real-world case study of a networked three-microgrid system in Adjuntas, Puerto Rico, is used with the consideration of different independent/interconnected microgrid scenarios, contingencies, and fairness settings. Furthermore, hardware-in-the-loop testing is conducted for the same three-microgrid network, where the closely matched results with the simulated ones have validated the effectiveness of the proposed restoration strategy, which is now ready to move one step forward towards field deployment. Finally, to test the proposed restoration strategy in a larger networked system, the modified IEEE-33 bus test distribution system is considered, and the results show a more resilient power delivery for critical loads under three and four line outages.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2012

HURON (HUman and Robotic Optimization Network) Multi-Agent Temporal Activity Planner/Scheduler

HURON solves the problem of how to optimize a plan and schedule for assigning multiple agents to a temporal sequence of actions (e.g., science tasks). Developed as a generic planning and scheduling tool, HURON has been used to optimize space mission surface operations. The tool has also been used to analyze lunar architectures for a variety of surface operational scenarios in order to maximize return on investment and productivity. These scenarios include numerous science activities performed by a diverse set of agents: humans, teleoperated rovers, and autonomous rovers. Once given a set of agents, activities, resources, resource constraints, temporal constraints, and de pendencies, HURON computes an optimal schedule that meets a specified goal (e.g., maximum productivity or minimum time), subject to the constraints. HURON performs planning and scheduling optimization as a graph search in state-space with forward progression. Each node in the graph contains a state instance. Starting with the initial node, a graph is automatically constructed with new successive nodes of each new state to explore. The optimization uses a set of pre-conditions and post-conditions to create the children states. The Python language was adopted to not only enable more agile development, but to also allow the domain experts to easily define their optimization models. A graphical user interface was also developed to facilitate real-time search information feedback and interaction by the operator in the search optimization process. The HURON package has many potential uses in the fields of Operations Research and Management Science where this technology applies to many commercial domains requiring optimization to reduce costs. For example, optimizing a fleet of transportation truck routes, aircraft flight scheduling, and other route-planning scenarios involving multiple agent task optimization would all benefit by using HURON.

Hua, Hook↗