Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedule”

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 1,207 records · Page 67

Evapotranspiration-Based Irrigation Scheduling in Salinas Valley Vegetable Crops

Crop evapotranspiration (ETc) monitoring may support improved irrigation water management in California's Central Coast agricultural region. The CropManage (CM) web-application, developed and operated by the University of California, informs irrigation and nitrogen scheduling decisions made by growers and crop consultants. Daily weather conditions are accounted for by use of grass reference ET data imported from the California Dept. Water Resources. Satellite observations of crop development from NASA's Satellite Irrigation Management Support can be imported and used by CM to adjust crop phenology. A replicated irrigation trial was performed July-October 2018 to investigate yield response of drip-irrigated celery (Apium graveolens) to applied water volume, and to further calibrate CM for use in that crop. Water was uniformly applied by sprinklers to establish the crop, and CM was then used to guide surface drip irrigation treatments applied three times weekly at 50%, 75%, 100%, 125% and 150% of ETc replacement level. Nitrogen fertilizer totaling 380 kg/ha was applied through the drip system generally once per week. Treatments were evaluated for commercial yield 85 and 93 days after transplanting (DAT). The 100% ETc treatment yielded 83 Mg/ha 93 DAT, which was 10 Mg/ha higher than the reported regional average yield in 2017. The 100% treatment received a seasonal total of 34 cm of water, compared with reported grower average exceeding 48 cm. Higher yields of 102 and 108 Mg/ha were observed in the 125% and 150% ETc treatments, respectively. Regarding crop quality, however, the 150% ETc treatment suffered greater incidence of pith breakdown and basal rot than the 100% treatment. Yields from the 50% and 75% treatments were below regional average. Aboveground biomass was evaluated 87 DAT. Fresh and dry biomass accumulations were positively related to applied water volume. Additional findings will be presented for a cauliflower trial conducted spring/summer 2019.

Johnson, Lee F.↗

X-57 High-Lift Propeller Control Schedule Development

The NASA X-57 distributed electric propulsion flight demonstrator uses a high-lift propeller system to maintain low-speed capability with a highly loaded, cruise-efficient wing. Previous research showed that the control scheme for the high-lift propellers was a crucial factor to enable an adequate balance between stabilized glideslope control and appropriate lift margin during the approach-to-landing phase of flight. This paper expands the high-lift propeller control considerations to include all phases of low-speed flight, including preflight, taxi, takeoff, initial climb, approach, and landing. Two control modes, termed airspeed and fixed mode, are developed in this paper. The airspeed mode varies propeller torque based on equivalent airspeed to account for different phases of ground and flight operations. The fixed mode operates the high-lift propeller system at a fixed rotational speed to account for failures in the air data system, preflight checkout, and high-performance takeoff operations. Modeling of the high-lift propellers within the X-57 low-speed flight envelope shows that (1) the structural rotational speed limit of the propeller blades limits their effectiveness at higher altitudes and airspeeds, (2) the speed setting of the fixed mode is set by the maximum torque of the airspeed mode, and (3) minimizing the potential for windmilling in non-standard conditions sets the torque schedule at higher speeds. Additionally, the fixed mode is shown to provide an increased climb rate during normal takeoff operations.

Nicholas K. Borer↗

Heuristic Area Cost Estimation for Observational Coverage Schedulers

This paper presents a comparison of heuris- tics used to estimate the amount of time it would take for a spacecraft to image an area using Boustrophedon decomposition (Choset and Pignon 1998). Machine learning tech- niques are used to characterize algorithmic performance of coverage algorithms. It is shown that an ordinary least-squares linear model is among the most accurate in a set of constant and linear order regression models both in terms of memory consumption and schedule duration. These are demonstrated using the ASPEN planning system (Fukunaga et al. 1997) on the Eagle Eye domain.

Knight, Russell↗

Prototyping an Onboard Scheduler for the Mars 2020 Rover

Efficiently operating a rover on the surface of Mars is challenging. Two factors combine to make this job particularly difficult: 1) communication opportunities are limited, 2) certain aspects of rover performance are difficult to predict. With limited communications, the rover must be given instructions on what to do for one or more Martian days at a time. In addition, the duration of many rover activities can be hard to predict, which leads to unpredictable energy use. Traditionally, conservatism is used to keep the rover safe and healthy. This approach, however can lead to a measurable loss in rover productivity. To regain some of this productivity, the Mars 2020 mission is prototyping the use of onboard scheduling software. The primary objective of this software is to identify and utilize opportunities that arise when actual rover performance is more efficient than the original, conservative prediction.

Benowitz, Ed↗

Analysis of the cost, schedule, and risk for Lynx mirror assembly production

This paper analyzes a recently published model for Lynx Mirror Assembly production duration, to understand the sensitivity of duration to various factors. The factors considered are finite process yield, knowledge of the individual process times and finite server reliability. In all of these cases, closed form estimates are given along with numerical examples. This initial analysis indicates that accurate and precise knowledge of the process times is fundamental to making an accurate prediction of schedule duration. Analysis of the failure of any given server is also explained and can be used as the basis of a rational sparing policy.

Jonathan W. Arenberg↗

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Monte Carlo Tree Search Approach

Numerous unmanned aircraft systems operating at low altitudes to deliver goods and services may one day become ubiquitous in our cities. In the Unmanned Aircraft Systems (UAS) Traffic Management (UTM) framework, such a concept is envisioned, where aerial vehicles operate beyond visual line of sight (BVLOS) within specifically reserved and time stamped “corridors” in the airspace. For example, these corridors or operational intent volumes can connect an aerial vehicle’s origin site to its destination site for package delivery operations. There may also be more than one corridor available for an aerial vehicle to choose from and often different corridors may intersect with one another. Thus, it is imperative to ensure flight trajectories belonging to different aerial vehicles are not in conflict. Per the UTM CONOPs, we assume that a vehicle almost always stays inside its corridor or operational volume. This work provides a framework for strategic deconfliction of UTM or package delivery drones, where we schedule the departure time of all vehicles subject to various temporal constraints (including the corridor deconfliction at the intersections). We present the “multi-route weighted package delivery problem” which serves as an exemplifying model for strategic deconfliction in UTM. In the multi-route weighted package delivery problem, a graph network is given which consists of a set of depots (source) and drop-off (destination) nodes, with multiple routes (defined as a sequence of waypoints) connecting the depots to drop-off nodes. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is for a known set of aerial vehicles to depart from the depots, choose a route and take off time, while avoiding conflicts with other aerial vehicles, and minimizing both risk and distance traveled. We provide a mixed integer linear programming (MILP) formulation of the problem, as well as a heuristic solution based on Monte Carlo Tree Search (MCTS) – a method used in game theory and artificial intelligence – to overcome limitations inherent to optimal solvers. Computational results show the advantages of using MCTS over the MILP formulation; the former can provide a sub-optimal solution quickly, and may sometimes even reach an optimal solution, whereas the latter may not even produce a solution in reasonable time. Furthermore, results from both the MILP formulation and MCTS methods were validated using a preliminary agent-based simulator implementing the UTM concept of operations. Thus, the MCTS method can be seen as a scalable solution to the complex multi-route weighted package delivery problem and may possibly be extended to similar complex optimization problems.

Kenny Chour↗

Automated Scheduling of Federated Observations in the NOS Testbed

The advancement of remote and in-situ sensing technology, combined with the emergence of New Space ventures, is producing a variety of new measurements for Earth Science phenomena. New observation techniques must combine and leverage these federated systems. In developing this new paradigm, NASA’s Earth Science Technology Office is developing the New Observing Strategies (NOS) Testbed to validate and demonstrate new operations concepts. As a part of this effort, we have developed a planning and scheduling system to support automated retasking

Chien, Steve↗

Monte Carlo Tree Search Methods for the Earth-Observing Satellite Scheduling Problem

This work explores on-board planning for the single spacecraft, multiple ground station Earth-observing satellite scheduling problem through artificial neural network function approximation of state–action value estimates generated by Monte Carlo tree search (MCTS). An extensive hyperparameter search is conducted for MCTS on the basis of performance, safety, and downlink opportunity utilization to determine the best hyperparameter combination for data generation. A hyperparameter search is also conducted on neural network architectures. The learned behavior of each network is explored, and each network architecture’s robustness to orbits and epochs outside of the training distributions is investigated. Furthermore, each algorithm is compared with a genetic algorithm, which serves to provide a baseline for optimality. MCTS is shown to compute near-optimal solutions in comparison to the genetic algorithm. The state–action value networks are shown to match or exceed the performance of MCTS in six orders of magnitude less execution time, showing promise for execution on board spacecraft.

Adam P. Herrmann↗

Artemis III Sleep Scheduling with HYPNOS Mission Planning Tool HLS Yawn Prevention N Outer Space (HYPNOS)

HYPNOS ingests critical event data, such as burns and docking, and automatically shifts the crew’s sleep schedule to support these events where possible, while still being compliant with medical restrictions. HYPNOS analyzes the crew’s timeline in 3 states: 1) Awake, meaning the crew is active for work hours 2) Pre- and Post-Sleep, awake periods of limited activity as the crew gets ready to sleep or is waking up 3) Sleep, where the crew is inactive as they rest

Levi Gosdin↗

The NCRC Grid Scheduling Environment

In support of the NCRC, a joint computing center between NOAA and ORNL, a grid-based scheduling infrastructure was designed to allow geographically separate computing resources to be used as production resources in climate and weather research workflows. These workflows require job coordination between the two centers in order to provide a complete workflow of data staging, computation, post-analysis and archival. This paper details the design, implementation and initial production phase of the infrastructure and lessons learned from the process.

99 GENERAL AND MISCELLANEOUS↗

2012 Gordon Research Conference on Microbial Stress Response, Schedule and Speaker/Poster Program

The Gordon Research Conference on Microbial Stress Response was held at Mount Holyoke College, South Hadley, Massachusetts, July 15-20, 2012. The Conference was well-attended with 180 participants. The 2012 Microbial Stress Responses Gordon Research Conference will provide a forum for the open reporting of recent discoveries on the diverse mechanisms employed by microbes to respond to stress. Approaches range from analysis at the molecular level (how are signals perceived and transmitted to change gene expression or function) to cellular and microbial community responses. Attached is a copy of the formal schedule and speaker program and the poster program.

59 BASIC BIOLOGICAL SCIENCES↗

A Java Library for the Generation and Scheduling of PTX Assembly

This paper discusses an ongoing progress regarding the development of a Java-based library for rapid kernel prototyping in NVIDIA PTX and PTX instruction scheduling. It is aimed at developers seeking total control of emitted PTX, highly parametric emission of, and tunable instruction reordering. It is primarily used for code development at ICHEC but is also hoped that NVIDIA GPU community will also find it beneficial.

Kartsaklis, Christos↗

Scheduling applications for execution on a plurality of compute nodes of a parallel computer to manage temperature of the nodes during execution

Methods, apparatus, and products are disclosed for scheduling applications for execution on a plurality of compute nodes of a parallel computer to manage temperature of the plurality of compute nodes during execution that include: identifying one or more applications for execution on the plurality of compute nodes; creating a plurality of physically discontiguous node partitions in dependence upon temperature characteristics for the compute nodes and a physical topology for the compute nodes, each discontiguous node partition specifying a collection of physically adjacent compute nodes; and assigning, for each application, that application to one or more of the discontiguous node partitions for execution on the compute nodes specified by the assigned discontiguous node partitions.

97 MATHEMATICS AND COMPUTING↗

Scheduler for multiprocessor system switch with selective pairing

System, method and computer program product for scheduling threads in a multiprocessing system with selective pairing of processor cores for increased processing reliability. A selective pairing facility is provided that selectively connects, i.e., pairs, multiple microprocessor or processor cores to provide one highly reliable thread (or thread group). The method configures the selective pairing facility to use checking provide one highly reliable thread for high-reliability and allocate threads to corresponding processor cores indicating need for hardware checking. The method configures the selective pairing facility to provide multiple independent cores and allocate threads to corresponding processor cores indicating inherent resilience.

97 MATHEMATICS AND COMPUTING↗

Implications of Scheduled ITC Reversion for RPS Compliance: Preliminary Results

This poster presents DRAFT initial results of a forthcoming NREL analysis. The analysis investigates the impacts of the scheduled investment tax credit (ITC) reversion from 30 percent to 10 percent for certain solar photovoltaic projects. Specifically, it considers whether the reversion will result in increased use of alternative compliance payments (ACPs) in lieu of solar renewable energy credits (SRECs) for renewable portfolio standard (RPS) compliance. The analysis models the effect of a 10 percent ITC on power purchase agreement (PPA) prices for non-residential systems in the eight states with solar carve-outs and solar ACPs. Our preliminary results suggest that states will likely install sufficient capacity to meet long-term targets through SRECs rather than ACPs following the ITC reversion. However, the analysis shows that the ITC reversion could affect project economics such that capacity shortfalls in certain states could temporarily increase the use of ACPs. NREL anticipates publishing a full report of this analysis in fall 2015. credits (SRECs) for renewable portfolio standard (RPS) compliance. The analysis models the effect of a 10 percent ITC on power purchase agreement (PPA) prices for non-residential systems in the eight states with solar carve-outs and solar ACPs. Our preliminary results suggest that states will likely install sufficient capacity to meet long-term targets through SRECs rather than ACPs following the ITC reversion. However, the analysis shows that the ITC reversion could affect project economics such that capacity shortfalls in certain states could temporarily increase the use of ACPs. NREL anticipates publishing a full report of this analysis in fall 2015.

14 SOLAR ENERGY↗

Large-Scale Compute-Intensive Analysis via a Combined In-situ and Co-scheduling Workflow Approach

Large-scale simulations can produce tens of terabytes of data per analysis cycle, complicating and limiting the efficiency of workflows. Traditionally, outputs are stored on the file system and analyzed in post-processing. With the rapidly increasing size and complexity of simulations, this approach faces an uncertain future. Trending techniques consist of performing the analysis in situ, utilizing the same resources as the simulation, and/or off-loading subsets of the data to a compute-intensive analysis system. We introduce an analysis framework developed for HACC, a cosmological N-body code, that uses both in situ and co-scheduling approaches for handling Petabyte-size outputs. An initial in situ step is used to reduce the amount of data to be analyzed, and to separate out the data-intensive tasks handled off-line. The analysis routines are implemented using the PISTON/VTK-m framework, allowing a single implementation of an algorithm that simultaneously targets a variety of GPU, multi-core, and many-core architectures.

Big data↗

Schedulers with load-store queue awareness

In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.

97 MATHEMATICS AND COMPUTING↗