Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Dynamic 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 343 records · Page 19

Transient Optimization of an Electrified Gas Turbine Engine Using Machine Learning

Gas turbine engines are designed with sufficient margin to prevent stall under normal operating conditions throughout their life. This compromise ensures that during rapid accelerations, compressor operation remains stable, but at the cost of efficiency and thrust responsiveness. The design margin encompasses multiple sources of uncertainty and systematic deviances from the operating line, the largest of which is the transient allowance. This set-aside accounts for the temporary incoordination of the engine spools during an acceleration while still enabling it to meet the certification requirement to accelerate from low to high power within a specified time, and without experiencing overtemperature, surge, stall, or other detrimental factors. Electrification of the powertrain provides the opportunity to address this reserve and truly optimize the design. The addition of electric machines inherent in hybrid propulsion concepts offers a means to interact with the engine shafts such that the necessary margin can be reduced, which can positively impact the engine design. By adjusting the amount of power extracted from or injected to the engine spools by the electric machines during transient operation, excursions from the operating line can be minimized. Past work using a dynamic engine model has shown that optimization of the fuel flow schedule during acceleration can reduce the required margin while still meeting the time requirement, and results are further improved when combined with power injection and extraction. The current work uses machine learning through a genetic algorithm to address the problem holistically by concurrently optimizing the electric machine power command and fuel flow acceleration schedule using an updated, higher fidelity version of the original engine model.

Stall Margin↗

Transient Optimization of an Electrified Gas Turbine Engine Using Machine Learning

Gas turbine engines are designed with sufficient margin to prevent stall under normal operating conditions throughout their life. This compromise ensures that during rapid accelerations, compressor operation remains stable, but at the cost of efficiency and thrust responsiveness. The design margin encompasses multiple sources of uncertainty and systematic deviances from the operating line, the largest of which is the transient allowance. This set-aside accounts for the temporary incoordination of the engine spools during an acceleration while still enabling it to meet the certification requirement to accelerate from low to high power within a specified time, and without experiencing overtemperature, surge, stall, or other detrimental factors. Electrification of the powertrain provides the opportunity to address this reserve and truly optimize the design. The addition of electric machines inherent in hybrid propulsion concepts offers a means to interact with the engine shafts such that the necessary margin can be reduced, which can positively impact the engine design. By adjusting the amount of power extracted from or injected to the engine spools by the electric machines during transient operation, excursions from the operating line can be minimized. Past work using a dynamic engine model has shown that optimization of the fuel flow schedule during acceleration can reduce the required margin while still meeting the time requirement, and results are further improved when combined with power injection and extraction. The current work uses machine learning through a genetic algorithm to address the problem holistically by concurrently optimizing the electric machine power command and fuel flow acceleration schedule using an updated, higher fidelity version of the original engine model.

Stall Margin↗

A human factors approach to range scheduling for satellite control

Range scheduling for satellite control presents a classical problem: supervisory control of a large-scale dynamic system, with unwieldy amounts of interrelated data used as inputs to the decision process. Increased automation of the task, with the appropriate human-computer interface, is highly desirable. The development and user evaluation of a semi-automated network range scheduling system is described. The system incorporates a synergistic human-computer interface consisting of a large screen color display, voice input/output, a 'sonic pen' pointing device, a touchscreen color CRT, and a standard keyboard. From a human factors standpoint, this development represents the first major improvement in almost 30 years to the satellite control network scheduling task.

Wright, Cameron H. G.↗

Multi-Agent Control Planes for Quantum Networks: A Scalable Architecture for Autonomous Quantum Internet Management

Quantum networks are expected to enable distributed quantum computing, secure communication, and global entanglement distribution. However, operating such networks presents significant challenges, including stochastic quantum processes, fragile entanglement resources, dynamic topology, and cross-layer control requirements. Current quantum network control architectures largely rely on centralized or hierarchical controllers inspired by classical software-defined networking (SDN). While effective for small testbeds, these approaches face scalability, latency, and reliability limitations as quantum networks grow. This paper proposes a multi-agent control plane architecture for quantum networks. In this design, intelligent software agents operate at quantum nodes, repeaters, and orchestration layers, collectively managing entanglement generation, routing, purification, and scheduling. The distributed intelligence of the agent system allows the network to adapt dynamically to quantum hardware variability and environmental noise. We argue that multi-agent systems provide significant advantages over centralized control approaches, including scalability, resilience, local autonomy, and real-time adaptation. The paper discusses architectural design principles, agent coordination mechanisms, and research challenges in deploying multi-agent control planes for the emerging quantum Internet.

Alnajjar, Anees [ORNL] (ORCID:0000000237101601)↗

Draper Station Analysis Tool

Draper Station Analysis Tool (DSAT) is a computer program, built on commercially available software, for simulating and analyzing complex dynamic systems. Heretofore used in designing and verifying guidance, navigation, and control systems of the International Space Station, DSAT has a modular architecture that lends itself to modification for application to spacecraft or terrestrial systems. DSAT consists of user-interface, data-structures, simulation-generation, analysis, plotting, documentation, and help components. DSAT automates the construction of simulations and the process of analysis. DSAT provides a graphical user interface (GUI), plus a Web-enabled interface, similar to the GUI, that enables a remotely located user to gain access to the full capabilities of DSAT via the Internet and Webbrowser software. Data structures are used to define the GUI, the Web-enabled interface, simulations, and analyses. Three data structures define the type of analysis to be performed: closed-loop simulation, frequency response, and/or stability margins. DSAT can be executed on almost any workstation, desktop, or laptop computer. DSAT provides better than an order of magnitude improvement in cost, schedule, and risk assessment for simulation based design and verification of complex dynamic systems.

Bedrossian, Nazareth↗

Landsat Data Continuity Mission

The Landsat Data Continuity Mission (LDCM) is currently under development and is on schedule to launch the 8th satellite in the Landsat series in December of 2012. LDCM is a joint project between the National Aeronautics and Space Administration (NASA) and the United States Geological Survey (USGS). NASA is responsible for developing and launching the flight hardware and on-orbit commissioning and USGS is responsible for developing the ground system and operating the system onorbit after commissioning. Key components of the flight hardware are the Operational Land Imager (OLI), nearing completion by Ball Aerospace & Technologies Corp in Boulder, CO, the Thermal Infrared Sensor (TIRS), being built by NASA's Goddard Space Flight Center and the spacecraft, undergoing integration at Orbital Sciences Corp in Gilbert, Arizona. The launch vehicle will be an Atlas-5 with launch services provided by NASA's Kennedy Space Center. Key ground systems elements are the Mission Operations Element, being developed by the Hammers Corporation, and the Collection Activity Planning Element, Ground Network Element, and Data Processing and Archive System, being developed internally by the USGS Earth Resources Observations and Science (EROS) Center. The primary measurement goal of LDCM is to continue the global coverage of moderate spatial resolution imagery providing continuity with the existing Landsat record. The science goal for this imagery is to monitor land use and land cover, particularly as it relates to global climate change. Together the OLI and TIRS instruments on LDCM replace the ETM+ instrument on Landsat-7 with significant enhancements. The OLI is a pushbroom design instrument where the scanning mechanism of the ETM+ is effectively replaced by a long line of detectors. The OLI has 9 spectral bands with similar spatial resolution to ETM+: 7 of them similar to the reflective spectral bands on ETM+ and two new bands. The two new bands cover (1) the shorter wavelength blue part of the spectrum to help with coastal studies and aerosol analyses/atmospheric correction and (2) an atmospheric water absorption band, where the Earth surface is generally not visible, but Cirrus clouds are, to aid in cloud detection and screening. The radiometry of OLI benefits from improved SNR, dynamic range and quantization. OLI is undergoing system testing with a delivery scheduled for Spring 2011. The TIRS is also a pushbroom design and used QWIPS detectors that require cooling to 43K using a cryocooler. It.has two spectral bands, effectively splitting the ETM+ band 6 in half, that can be used as a split window to aid in atmospheric correction. It has nominally 100 m spatial resolution as opposed to the 60 m of Landsat-7 ETM+: TIRS has commenced integration and test, with a delivery to the spacecraft vendor scheduled for Winter 2011-2012. The Orbital spacecraft currently being integrated for LDCM will have improved capabilities for pointing over previous missions. These capabilities will allow the OLI and TIRS instruments to point off-nadir the equivalent of one WRS-2 path to increase the chances of coverage for high priority targets, particularly in the event of natural disasters. Also, the pointing capability will allow the calibration of the OLI using the sun (roughly weekly), the moon (monthly), stars (during commissioning) and the Earth (at 90 deg from normal orientation, a.k.a., side slither) quarterly. The solar calibration will be used for OLI absolute and relative calibration, the moon for trending the stability of the OLI response, the stars will be used for Line of Sight determination and the side slither will be an alternate OLI and relative gain determination methodology. The spacecraft is scheduled to begin integration with the OLI instrument in Summer 2011. The LDCM data processing and archive system (DPAS), located at USGS EROS, generates the products for distribution to users. Like Landsat-7 this includes an image assessment system for characrizing instrument performance and updating calibration parameters. Products will be generated that include the spectral bands from both instruments, terrain corrected and registered to the geoid. Also, like Landsat-7, data products will be distributed at no charge to the user. The current status and plans of the space and ground segments of the LDCM project will be presented along with performance predictions as available. More detailed information on the two instruments is intended to be presented in separate papers.

Markham, Brian↗

Evaluating power grid model hydropower feasibility with a river operations model

Production cost models (PCMs) simulate dispatch of generators across a large power grid and are used widely by planners to study the reliability of electricity supply. As energy systems transition away from the thermoelectric technologies that have traditionally balanced electricity supply and demand, hydropower and its representation in PCMs is of increasing importance. A limitation of PCMs applied to continental power grids with diverse generation portfolios is that hydropower generation is simulated without full consideration of complex river dynamics, leading to possible misrepresentation of grid flexibility and performance. In addition, data used in PCMs may reflect outdated operating policies. In this paper we propose a hydropower generation feasibility test for PCMs. The approach uses a detailed hydropower model to determine whether the hourly hydropower schedule from a PCM with simplified monthly parameterization can be attained after accounting for realistic river dynamics and operating policies, such as spill requirements and general water movement and balance through a cascade reservoir system. We perform this hydropower generation test for the ‘Big 10’ hydropower system on the Columbia River (part of the Western Interconnect of the United States), revealing 9% overestimation of available hydropower generation in a PCM solution in an average hydrologic year. Our evaluation provides insight on the cost and opportunities for better representing hydropower in PCMs.

54 ENVIRONMENTAL SCIENCES↗

Computational dynamics for robotics systems using a non-strict computational approach

A Non-Strict computational approach for real-time robotics control computations is proposed. In contrast to the traditional approach to scheduling such computations, based strictly on task dependence relations, the proposed approach relaxes precedence constraints and scheduling is guided instead by the relative sensitivity of the outputs with respect to the various paths in the task graph. An example of the computation of the Inverse Dynamics of a simple inverted pendulum is used to demonstrate the reduction in effective computational latency through use of the Non-Strict approach. A speedup of 5 has been obtained when the processes of the task graph are scheduled to reduce the latency along the crucial path of the computation. While error is introduced by the relaxation of precedence constraints, the Non-Strict approach has a smaller error than the conventional Strict approach for a wide range of input conditions.

Orin, David E.↗

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↗

Optimization of distributed compute resources utilization in the CMS Global Pool

The CMS Submission Infrastructure is the primary system for managing computing resources for CMS workflows, including data processing, simulation, and analysis. It integrates geographically distributed resources from Grid, HPC, and cloud providers into federated pools managed by HTCondor and Glidein- WMS, for a total of around 500k CPU cores. This system dynamically manages workloads based on priorities defined by the collaboration. Additionally, CMS scheduling strategies must be flexible to handle multiple concurrent workloads while considering changing processing demands and resource availability from various providers.Efficient utilization of vast amounts of distributed compute resources is a key element for the success of the scientific programs of the LHC experiments. Optimizing the system is essential to maximize resource efficiency and fully utilize the distributed computing power. The CMS Submission Infrastructure team thus systematically investigates sources of inefficiency in workload scheduling to reduce their impact. In addition, a strategy of pilot overloading has been introduced to compensate for other inefficiency sources, thereby optimizing resource utilization and enhancing computational throughput.

Mascheroni, Marco [UC, San Diego (main)]↗

Wind Power Ramping Product for Increasing Power System Flexibility

With increasing penetrations of wind power, system operators are concerned about a potential lack of system flexibility and ramping capacity in real-time dispatch stages. In this paper, a modified dispatch formulation is proposed considering the wind power ramping product (WPRP). A swinging door algorithm (SDA) and dynamic programming are combined and used to detect WPRPs in the next scheduling periods. The detected WPRPs are included in the unit commitment (UC) formulation considering ramping capacity limits, active power limits, and flexible ramping requirements. The modified formulation is solved by mixed integer linear programming. Numerical simulations on a modified PJM 5-bus System show the effectiveness of the model considering WPRP, which not only reduces the production cost but also does not affect the generation schedules of thermal units.

17 WIND ENERGY↗

Solving Constraint-Satisfaction Problems In Prolog Language

Technique for solution of constraint-satisfaction problems uses definite-clause grammars of Prolog computer language. Exploits fact that grammar-rule notation viewed as "state-change notation". Facilitates development of dynamic representation performing informed as well as blind searches. Applicable to design, scheduling, and planning problems.

Nachtsheim, Philip R.↗

Parallel DSMC Solution of Three-Dimensional Flow Over a Finite Flat Plate

This paper describes a parallel implementation of the direct simulation Monte Carlo (DSMC) method. Runtime library support is used for scheduling and execution of communication between nodes, and domain decomposition is performed dynamically to maintain a good load balance. Performance tests are conducted using the code to evaluate various remapping and remapping-interval policies, and it is shown that a one-dimensional chain-partitioning method works best for the problems considered. The parallel code is then used to simulate the Mach 20 nitrogen flow over a finite-thickness flat plate. It is shown that the parallel algorithm produces results which compare well with experimental data. Moreover, it yields significantly faster execution times than the scalar code, as well as very good load-balance characteristics.

Nance, Robert P.↗

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

A Secure and Adaptive Hierarchical Multi-Timescale Framework for Resilient Load Restoration Using a Community Microgrid

Distribution system integrated community microgrids (CMGs) can partake in restoring loads during extended duration outages. At such times, the CMGs are challenged with limited resource availability, absence of robust grid support, and heightened demand-supply uncertainty. Here, this paper proposes a secure and adaptive three-stage hierarchical multi-timescale framework for scheduling and real-time (RT) dispatch of CMGs with hybrid PV systems to address these challenges. The framework enables the CMG to dynamically expand its boundary to support the neighboring grid sections and is adaptive to the changing forecast error impacts. The first stage solves a stochastic extended duration scheduling (EDS) problem to obtain referral plans for optimal resource rationing. The intermediate near-real-time (NRT) scheduling stage updates the EDS schedule closer to the dispatch time using new obtained forecasts, followed by the RT dispatch stage. To make the decisions more secure and robust against forecast errors, a novel concept called delayed recourse is designed. The approach is evaluated via numerical simulations on a modified IEEE 123-bus system and validated using OpenDSS and hardware-in-loop simulations. The results show superior performance in maximizing load supply and continuous secure distribution network operation under different operating scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Heterogeneity-Aware Task Scheduler for Spark

Big data processing systems such as Spark are employed in an increasing number of diverse applications-such as machine learning, graph computation, and scientific computing-each with dynamic and different resource needs. These applications increasingly run on heterogeneous hardware, e.g., with out-of-core accelerators. However, big data platforms do not factor in the multi-dimensional heterogeneity of applications and hardware. This leads to a fundamental mismatch between the application and hardware characteristics, and the resource scheduling adopted in big data platforms. For example, Hadoop and Spark consider only data locality when assigning tasks to nodes, and typically disregard the hardware capabilities and suitability to specific application requirements. In this paper, we present RUPAM, a heterogeneity-aware task scheduling system for big data platforms, which considers both task-level resource characteristics and underlying hardware characteristics, as well as preserves data locality. RUPAM adopts a simple yet effective heuristic to decide the dominant scheduling factor (e.g., CPU, memory, or I/O), given a task in a particular stage. Our experiments show that RUPAM is able to improve the performance of representative applications by up to 62.3% compared to the standard Spark scheduler.

Computer Science↗

Application of gain scheduling to the control of batch bioreactors

The implementation of control algorithms to batch bioreactors is often complicated by the inherent variations in process dynamics during the course of fermentation. Such a wide operating range may render the performance of fixed gain PID controllers unsatisfactory. In this work, a detailed study on the control of batch fermentation is performed. Furthermore, a simple batch controller design is proposed which incorporates the concept of gain-scheduling, a subclass of adaptive control, with oxygen uptake rate as an auxiliary variable. The control of oxygen tension in the biorector is used as a vehicle to convey the proposed idea, analysis and results. Simulation experiments indicate significant improvement in controller performance can be achieved by the proposed approach even in the presence of measurement noise.

Cardello, Ralph↗

Solar array flight dynamic experiment

The purpose of the Solar Array Flight Dynamic Experiment (SAFDE) is to demonstrate the feasibility of on-orbit measurement and ground processing of large space structures dynamic characteristics. Test definition or verification provides the dynamic characteristic accuracy required for control systems use. An illumination/measurement system was developed to fly on space shuttle flight STS-31D. The system was designed to dynamically evaluate a large solar array called the Solar Array Flight Experiment (SAFE) that had been scheduled for this flight. The SAFDE system consisted of a set of laser diode illuminators, retroreflective targets, an intelligent star tracker receiver and the associated equipment to power, condition, and record the results. In six tests on STS-41D, data was successfully acquired from 18 retroreflector targets and ground processed, post flight, to define the solar array's dynamic characteristic. The flight experiment proved the viability of on-orbit test definition of large space structures dynamic characteristics. Future large space structures controllability should be greatly enhanced by this capability.

Schock, R. W.↗