Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedules”

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 73 records · Page 4

A Non-Cooperative Game-Based Distributed Beam Scheduling Framework for 5G Millimeter-Wave Cellular Networks

Here, this paper studies the problem of distributed beam scheduling for 5G millimeter-Wave (mm-Wave) cellular networks where base stations (BSs) belonging to different operators share the same spectrum without centralized coordination among them. Our goal is to design efficient distributed scheduling algorithms to maximize the network utility, which is a function of the achieved throughput by the user equipment (UEs), subject to the average and instantaneous power consumption constraints of the BSs. We propose a Media Access Control (MAC) and a power allocation/adaptation mechanism utilizing the Lyapunov stochastic optimization framework and non-cooperative games. In particular, we first decompose the original utility maximization problem into two sub-optimization problems for each time frame, which are a convex optimization problem and a non-convex optimization problem, respectively. By formulating the distributed scheduling problem as a non-cooperative game where each BS is a player attempting to optimize its own utility, we provide a distributed solution to the non-convex sub-optimization problem via finding the Nash Equilibrium (NE) of the game whose weights are determined optimally by the Lyapunov optimization framework. Finally, we conduct simulation under various network settings to show the effectiveness of the proposed game-based beam scheduling algorithm in comparison to that of several reference schemes.

42 ENGINEERING↗

A Hierarchical Task Scheduler for Heterogeneous Computing

Heterogeneous computing is one of the future directions of HPC. Task scheduling in heterogeneous computing must balance the challenge of optimizing the application performance and the need for an intuitive interface with the programming run-time to maintain programming portability. The challenge is further compounded by the varying data communication time between tasks. This paper proposes RANGER, a hardware-assisted task-scheduling framework. By integrating RISC-V cores with accelerators, the RANGER scheduling framework divides scheduling into global and local levels. At the local level, RANGER further partitions each task into fine-grained subtasks to reduce the overall makespan. At the global level, RANGER maintains the coarse granularity of the task specification, thereby maintaining programming portability. The extensive experimental results demonstrate that RANGER achieves a 12.7× performance improvement on average, while only requires 2.7% of area overhead.

Miniskar, Narasinga Rao↗

Joint scheduling of energy, fast and primary frequency response reserves in integrated transmission–distribution networks

Inverter-based distributed energy resources (DERs) connected to distribution networks (DNs) can provide fast frequency support, but their reserve deliverability depends on feeder constraints and differs from synchronous primary frequency response (PFR). Existing transmission–distribution coordination studies usually treat reserve generically or neglect feeder-level feasibility, while frequency-security scheduling studies rarely represent distribution feeders explicitly. This paper develops a bi-level day-ahead scheduling framework for integrated transmission–distribution networks that jointly clears energy, transmission-side PFR, and distribution-side fast frequency response (FFR) under exogenous hourly inertia and largest-loss inputs from an external unit commitment (UC) schedule. The transmission problem is modeled with DC-optimal power flow (OPF) and closed-form second-order cone (SOC) frequency-security constraints, whereas each DN is represented by a reserve-aware branch-flow AC-OPF so that scheduled fast reserves remain deliverable during activation. The bi-level problem is reformulated through Karush–Kuhn–Tucker (KKT) conditions into a mixed-integer SOC program, and a penalty term is used to tighten the distribution-network relaxation. In the reduced test system, lower exogenous inertia increased the required primary response from 179.64 MW to 191.08 MW, distribution-side fast response reduced total frequency-response procurement by up to 4.9%, and neglecting distribution constraints overstated the combined distribution-side energy and reserve award by up to 18%. In the expanded study, the largest case was solved in 2.02 s with a 0.00% optimality gap. Time-domain simulations kept the frequency nadir above 59.0 Hz in all tested hours. These results demonstrate the value of fast-response modeling and distribution-feasible reserve delivery in coordinated market clearing.

Noh, Seung-Gil↗

Improving the nonlinear control performance of the supply fan at air handling units using a gain scheduling control strategy

Due to its nonlinear nature, the supply fan at air handling units with the controller tuned at the design condition tends to be aggressive and oscillate under partial load conditions. Here, the objective of this paper is to develop and validate a gain scheduling control strategy to improve its nonlinear control performance. First, a control-oriented model, which does not require numerous physical parameters and extensive test data, is developed to study the nonlinearity of the fan system. Based on the theoretical model and experimental verifications, the issue of an aggressive response with a conventional fixed-gain controller is caused by the fact that the system gain is proportional to the ratio of the duct static pressure to the fan speed. To address the issue, a scheduling function of the measurable duct static pressure and fan speed is proposed to be included in the conventional fixed-gain controller to compensate for the fan system gain variation. The gain scheduling control strategy is found to approximately maintain the identical control performance under all operation conditions. Most importantly, the gain scheduling control strategy can be readily implemented without intensive computation and additional measurements, showing a promising potential in industrial applications.

42 ENGINEERING↗

Addressing Load Imbalance in Bioinformatics and Biomedical Applications: Efficient Scheduling across Multiple GPUs

Computational bioinformatics and biomedical applications frequently contain heterogeneously sized units of work or tasks, for instance due to variability in the sizes of biological sequences and molecules. Variable-sized workloads lead to load imbalances in parallel implementations which detract from efficiency and performance. Many modern computing resources now have multiple graphics processing units(GPUs) per computer for acceleration. These multiple GPU resources need to be used efficiently through balancing of workloads across the GPUs. OpenMP is a portable directive-based parallel programming API used ubiquitously in bioscience applications to program CPUs; recently, the use of OpenMP directives for GPU acceleration has become possible. Here, motivated by experiences with imbalanced loads in GPU-accelerated bioinformatics applications, we address the load balancing problem using OpenMP task-to-GPU scheduling combined with OpenMP GPU offloading for multiply heterogeneous workloads – loads with both variable input sizes, and simultaneously, variable convergence rates for algorithms with a stochastic component – scheduled across multiple GPUs. We aim to develop strategies which are both easy to use and have lower overheads, and may be incorporated incrementally in existing programs which already make use of OpenMP for CPU-based threading in order to make use of multi-GPU computers. We test different combinations of input size variability and convergence rate variability, and characterize the effects of these different scenarios on the performance of scheduling strategies across multiple GPUs with OpenMP. We present several dynamic scheduling solutions for different parallel patterns, explore optimizations, and provide publicly available example computational kernels to make these strategies easy to use in programs. This work will enable application developers to efficiently and easily use multiple GPUs for imbalanced workloads found in bioinformatics and biomedical applications.

Thavappiragasam, Mathialakan↗

MARS: Malleable Actor-Critic Reinforcement Learning Scheduler

In this paper, we introduce MARS, a new scheduling system for HPC-cloud infrastructures based on a cost-aware, flexible reinforcement learning approach, which serves as an intermediate layer for next generation HPC-cloud resource manager. MARS ensembles the pre-trained models from heuristic workloads and decides on the most cost-effective strategy for optimization. A whole workflow application would be split into several optimizable dependent sub-tasks, then based on the pre- defined resource management plan, a reward will be generated after executing a scheduled task. Lastly, MARS updates the Deep Neural Network (DNN) model based on the reward. MARS is designed to optimize the existing models through reinforcement mechanisms. MARS adapts to the dynamics of workflow applications, selects the most cost-effective scheduling solution among pre-built scheduling strategies (backfilling, SJF, etc.) and self- learning deep neural network model at run-time. We evaluate MARS with different real-world workflow traces. MARS can achieve 5%-60% increased performance compare to state-of-the- art approaches.

Baheri, Betis↗

Robustness: The Missing Ingredient in Generation Scheduling

This article highlights robustness as an essential factor to cope with the ever-increasing levels of uncertainty in generation scheduling under significant renewable energy penetration, as is the case in Brazil and Spain. To that end, robust generation scheduling is framed within the different optimization-based approaches that are available for uncertainty handling. In addition, the suitability of robust optimization to accommodate practical security criteria in generation scheduling is also emphasized. Interestingly, this article points out the existence of an effective algorithm allowing the discovery of critical or so-called umbrella scenarios, which paves the way for the implementation of robust generation scheduling in industry practice.

Street, Alexandre↗

Simulated Night- Shift Schedule Disrupts the Plasma Lipidome and Reveals Early Markers of Cardiovascular Disease Risk

Introduction: The circadian system coordinates daily rhythms in lipid metabolism, storage and utilization. Disruptions of internal circadian rhythms due to altered sleep/wake schedules, such as in night-shift work, have been implicated in increased risk of cardiovascular disease and metabolic disorders. To determine the impact of a night-shift schedule on the human blood plasma lipidome, an in-laboratory simulated shift work study was conducted. Methods: Fourteen healthy young adults were assigned to 3 days of either a simulated day or night-shift schedule, followed by a 24-h constant routine protocol with fixed environmental conditions, hourly isocaloric snacks, and constant wakefulness to investigate endogenous circadian rhythms. Blood plasma samples collected at 3-h intervals were subjected to untargeted lipidomics analysis. Results: More than 400 lipids were identified and quantified across 21 subclasses. Focusing on lipids with low between-subject variation per shift condition, alterations in the circulating plasma lipidome revealed generally increased mean triglyceride levels and decreased mean phospholipid levels after night-shift relative to day-shift. The circadian rhythms of triglycerides containing odd chain fatty acids peaked earlier during constant routine after night-shift. Regardless of shift condition, triglycerides tended to either peak or be depleted at 16:30 h, with chain-specific differences associated with the direction of change. Discussion: The simulated night-shift schedule was associated with altered temporal patterns in the lipidome. This may be premorbid to the elevated cardiovascular risk that has been found epidemiologically in night-shift workers.

59 BASIC BIOLOGICAL SCIENCES↗

A Combined Day-ahead and Real-time approach for Scheduling Real and Reactive power dispatch of Battery Energy Storage System

A combined day-ahead (look-ahead) and real-time optimization approach is proposed to schedule BESS real and reactive power dispatch. The look ahead scheduling agent maximizes profit and essentially performs the function of energy arbitrage by looking at forecasted prices, network constraints and BESS operating conditions to generate real power dispatch schedule. While this schedule is followed, the real time optimization agent computes an optimum reactive power set-point (for a particular objective function) using optimal power flow framework. The concepts are implemented by co-simulating legacy tools and demonstrated on a large real world distribution system. In addition to the profits from energy arbitrage, optimum reactive power set point computation results in achieving desirable network attributes like flat voltage profiles and minimizing voltage deviations from desired value.

Bhatti, Bilal A.↗

Correlating and Simulating Socio-Demographically Driven Residential End-Use Activity Schedules

Incorporating socio-demographic and behavioral considerations into decision-support tools is crucial for identifying gaps and addressing consumer needs to ensure reliable and affordable energy solutions. In energy simulation models, the correlation between socio-demographics and time-use behavior is not well-captured. Thus, we developed a large-scale simulation workflow to generate schedules for 10 residential activities across 24 population segments defined by age, income, and employment status. Using pre-pandemic 2015-2019 American Time Use Survey (ATUS) data, we used ANOVA to confirm the correlation between demographic factors and time use. We explored three k-modes clustering methods-backward, forward, and a new hybrid approach-to delineate the occupancy patterns based on demographics. Using the probability of cluster membership for each population segment and a time inhomogeneous Markov chain to generate activity transition probabilities for each cluster, we simulated 50,000 schedules per segment and validated them against the ATUS data. The hybrid method produced the most socio-demographically differentiated clusters while demonstrating comparable performance to other approaches, with an overall root mean square error of 0.12 for both weekday and weekend schedules. Thus, the hybrid method, where each cluster is dominated by certain demographic segments and occupancy patterns, offers more modeling versatility in terms of scenario analysis. The new workflow improves the socio demographic differentiation of energy consumption by considering differences in time use. This approach enables future research on demographically segmented time of use (TOU) energy consumption, including impacts of TOU utility bills and rate analysis, long-run marginal emissions, and energy retrofits.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

COVID-19 impacts on residential occupancy schedules and activities in U.S. Homes in 2020 using ATUS

Many aspects of the daily lives of those living in the United States were substantially impacted by the COVID-19 pandemic in the year 2020. A broad diversity of measures was implemented to curb the spread of the virus, many of which included adjustments to where and how people worked, went to school, and otherwise conducted their daily lives compared to pre-pandemic times. This has impacted how residential buildings are used, how much time people spend in their homes, and as a result, how much energy these buildings consume. The main objective of this study is to analyze, at a national scale, the differences in the occupancy schedules and activities conducted in homes in the U.S., as compared to pre-pandemic. 15 years of American Time Use Survey and Current Population Survey data, from 2006 to 2020, was used in this study to analyze the occupancy schedules for both pandemic (2020) and pre-pandemic (2006–2019) times. These impacts were also analyzed with respect to variables including, weekday/weekend, month of the year, age of the occupants, household income, and household size. The impact of the pandemic on occupant schedules were most substantial in the initial months, whereas as the months progressed, these occupancy profiles slowly changed. Across 2020, people spent, on average, 8 % more time (1.9 h) in their home on weekdays, and 3–6 % (1.2 h) on weekend days. The percentage of time spent for different activities and locations within homes were also studied. For 1-member households, their time spent at home decreased whereas for 2-, 3-, and 4- member households, they spent more time at home. Overall, people spent around 45% more time doing office- and work-related activities at home compared to pre-pandemic, which is likely due to increased remote working and schooling. This research helps to improve the understanding of the occupancy presence and absence profiles in U.S. residential buildings due to the pandemic and provides new insights as to modified profiles for researchers, building designers, and policy makers.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A data-driven linear formulation of the optimal demand response scheduling problem for an industrial air separation unit

Demand response (DR) has become a key element in balancing the power grid as the contribution of time-varying renewable power generation increases. Chemical plants are appealing candidates for DR programs as they offer large, concentrated and flexible loads. DR participation calls for frequent production rate changes over time scales that overlap with the dominant dynamics of the plant. Production scheduling should therefore consider the process dynamics explicitly. Here we present a data-driven approach for modelling the scheduling-relevant dynamics based on historical closed-loop operating data using autoregressive with extra inputs (ARX) models. We introduce a new, linear scheduling problem formulation based on the ARX representation, and demonstrate its implementation on an industrial air separation unit.

42 ENGINEERING↗

Multistage Stochastic optimization for mid-term integrated generation and maintenance scheduling of cascaded hydroelectric system with renewable energy uncertainty

The uncertainties resulting from the escalating penetration of renewable energy resources pose severe challenges to the efficient operation of modern power systems. Hydroelectricity is characterized by its flexibility, controllability, and reliability, and thus becomes one of the most ideal energy resources to hedge against such uncertainties. This paper studies the mid-term integrated generation and maintenance scheduling of a cascaded hydroelectric system (CHS) consisting of multiple cascaded reservoirs and hydroelectric units. To precisely describe the mid-term water regulation policies, the hydraulic coupling relationship and water-energy nexus of CHS are incorporated into the proposed optimization model. The uncertainties of natural water inflow and the power outputs of wind/solar energy generation are taken into consideration and captured via a stochastic process modeled by a scenario tree. A multistage stochastic optimization (MSO) approach is developed to coordinate the complementary operations of multiple energy resources, by optimizing the mid-term water resource management, generation scheduling, and maintenance scheduling of CHS. The proposed MSO model is formulated as a large-scale mixed-integer linear program that presents significant computational intractability. To address this issue, a tailored Benders decomposition algorithm is developed. Two real-world case studies are conducted to demonstrate the capability and characteristics of the proposed model and algorithm. The computational results show that the proposed MSO model can exploit the flexibility of hydroelectricity to efficiently respond to variable wind and solar power, and reserve water resources for the generation in peak months to reduce the consumption of fossil fuel. Furthermore, the proposed solution approach also exhibits promising computational efficiency when handling large-scale models.

13 HYDRO ENERGY↗

Resilience-based Recovery Scheduling of Transportation Network in Mixed Traffic Environment: A Deep-Ensemble-Assisted Active Learning Approach

Devising effective post-hazard recovery strategies is critical in enhancing the resilience of transportation networks (TNs). However, existing work does not consider the multiclass users’ travel behavior in network functionality quantification and the metaheuristic solution procedures often suffer from extensive computational burden due to the exploration need in large solution space and the expensive functionality quantification. Here, this study develops a bilevel decision-making framework for the resilience-based recovery scheduling of the TN in a mixed traffic environment with connected and autonomous vehicles (CAVs) and human-driven vehicles (HDVs). The lower level quantifies the TN's functionality over time considering different travel behavior of CAV and HDV users arisen from their different levels of information perception. The upper level presents a novel deep-ensemble-assisted active learning approach to balance optimization performance and computational cost. This framework can help decision makers better quantify the TN's functionality to support effective recovery scheduling of TN with different mixed traffic scenarios ranging from HDV-only to future CAV-dominant traffic. The optimization approach bears the potential to be extended to solving general large-scale network recovery scheduling problems effectively and efficiently. The proposed methodology is demonstrated using a real-world traffic network in Southern California under earthquake considering deterministic and stochastic repair durations.

42 ENGINEERING↗

Heuristic solutions to the single depot electric vehicle scheduling problem with next day operability constraints

This study focuses on the single depot electric vehicle scheduling problem (SDEVSP) within the broader context of the vehicle scheduling problem (VSP). By developing an effective scheduling model using mixed-integer linear programming, we generate bus blocks that accommodate electric vehicles (EVs), ensuring successful completion of each block while considering recharging requirements between blocks and during off-hours. Next day operability constraints are also incorporated, allowing for seamless repetition of blocks on subsequent days. The SDEVSP is known to be computationally complex, deriving optimal solutions unattainable for large-scale problems within reasonable timeframes. To address this, we propose a two-step solution approach: first solving the single depot VSP, and then addressing the block chaining problem (BCP) using the blocks generated in the first step. The BCP focuses on optimizing block combinations to facilitate recharging between consecutive blocks, considering operational constraints. Further, a case study conducted reveals that nearly 100% electrification for Chicago, IL and Austin, TX transit buses is viable yet requires 1.6 EVs at 150-mile range per diesel vehicle.

33 ADVANCED PROPULSION SYSTEMS↗

A Q-Learning-Based Approach for Distributed Beam Scheduling in mmWave Networks

We consider the problem of distributed downlink beam scheduling and power allocation for millimeter-Wave (mmWave) cellular networks where multiple base stations (BSs) belonging to different service operators share the same unlicensed spectrum with no centralized control or explicit coordination among them. Our goal is to design efficient distributed beam scheduling and power allocation schemes such that the network-level payoff, defined as the weighted sum of the total throughput and a power penalization term, can be maximized. To this end, we propose a distributed scheduling approach to power allocation and adaptation for efficient interference management over the shared spectrum by modeling each BS as an independent Q-learning agent. As a baseline, we compare the proposed approach to the state-of-the-art non-cooperative game-based approach which was previously developed for the same problem. We conduct extensive experiments under various scenarios to verify the effect of multiple factors on the performance of both approaches. Experiment results show that the proposed approach adapts well to different interference conditions by learning from experience and thus can achieve higher payoff than the game-based approach. The proposed approach can also be integrated into our previously developed Lyapunov stochastic optimization framework for the purpose of network utility maximization with optimality guarantee. As a result, the weights in the payoff function can be automatically and optimally determined by the virtual queue values from the sub-problems derived from the Lyapunov optimization framework.

99 GENERAL AND MISCELLANEOUS↗

A Vision–based Robust $\mathcal{H}$ ∞ Gain Scheduling Longitudinal and Lateral Following Controller for Autonomous Vehicles on Urban Curved Roads

Implementing advanced driver assistance systems (ADAS) in congested and intricate urban traffic scenarios poses significant challenges. To address the frequent stop–and–go motions exhibited by autonomous vehicles (AVs) navigating urban roads with changes in curvature, we propose a vision–based robust $\mathcal{H}$ ∞ adaptive cruise control system (ACC) for longitudinal control, plus a lane keeping assist system (LKAS) for lateral control. For the vision-based ACC, a weighted probability objective function for the vehicle following behavior is formulated. We incorporate $\mathcal{H}$ ∞ performance and gain scheduling techniques to mitigate the impact of uncertainty in visual sensor measurements. Furthermore, the optimal time headway is scheduled based on the velocity to ensure traffic flow efficiency and safety during the vehicle following process. For the LKAS, we introduce a road curvature estimation method that integrates lane and vehicle dynamics information to obtain the lateral and heading offsets. Next, the design criterion of the observer–based robust gain scheduling lateral motion controller is established by linear matrix inequality (LMI). Here, a series of experiments conducted within a camera–in–loop platform validate the proposed method.

33 ADVANCED PROPULSION SYSTEMS↗

Outage Forecast-Based Preventative Scheduling Model for Distribution System Resilience Enhancement: Preprint

Distribution system resilience enhancement is an important topic to ensure customers have access to the power supply during extreme events. In fact, certain weather-related extreme events can be predicted ahead of time. Therefore, it is important to investigate how to predict grid outages using extreme weather forecasts, and how outage predictions can be incorporated into distribution system resilience enhancement. In this paper, a preventative scheduling model for distribution systems is proposed. The model targets at allocating resources, especially mobile responsive resources such as mobile backup generators and mobile energy storage systems, to prepare for an extreme event in the day-ahead context. To achieve efficient resource allocation and scheduling, a machine learning-based outage prediction module is developed to predict vulnerable or risky segments of the distribution system based on historical operating records and extreme weather event forecasts. By integrating the outage prediction results into the scheduling model, optimal resource allocation can be derived to help distribution systems prepare for an upcoming event and improve resilience performance. A real distribution feeder in North Carolina, U.S. is used in the case study to validate the proposed approach.

distributed energy resources↗