Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast optimization”

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,639 records · Page 91

Unstructured CFD and Noise Prediction Methods for Propulsion Airframe Aeroacoustics

Using unstructured mesh CFD methods for Propulsion Airframe Aeroacoustics (PAA) analysis has the distinct advantage of precise and fast computational mesh generation for complex propulsion and airframe integration arrangements that include engine inlet, exhaust nozzles, pylon, wing, flaps, and flap deployment mechanical parts. However, accurate solution values of shear layer velocity, temperature and turbulence are extremely important for evaluating the usually small noise differentials of potential applications to commercial transport aircraft propulsion integration. This paper describes a set of calibration computations for an isolated separate flow bypass ratio five engine nozzle model and the same nozzle system with a pylon. These configurations have measured data along with prior CFD solutions and noise predictions using a proven structured mesh method, which can be used for comparison to the unstructured mesh solutions obtained in this investigation. This numerical investigation utilized the TetrUSS system that includes a Navier-Stokes solver, the associated unstructured mesh generation tools, post-processing utilities, plus some recently added enhancements to the system. New features necessary for this study include the addition of two equation turbulence models to the USM3D code, an h-refinement utility to enhance mesh density in the shear mixing region, and a flow adaptive mesh redistribution method. In addition, a computational procedure was developed to optimize both solution accuracy and mesh economy. Noise predictions were completed using an unstructured mesh version of the JeT3D code.

Pao, S. Paul↗

Localization of Ad-Hoc Lunar Constellations in Communication Failure Modes for Distributed Spacecraft Autonomy

As lunar missions increase in complexity inspired by NASA’s Artemis Program, they will require reliable and sufficient capability of the Position, Navigation, and Timing (PNT) system to support their scientific objectives. In addition, NASA's Commercial Lunar Payload Services (CLPS) program initiates the proliferation of public and private exploration partnerships using small satellites from commercial and private organizations, expanding traditionally confined low Earth orbit to be used for missions beyond geosynchronous orbit (Zucherman et al., 2022). Therefore, the Lunar PNT system is also required to provide navigation services compatible with the smaller platforms being sent by the public and private sectors, like CubeSats. However, traditional approaches to deep space missions’ navigation based on ground radio facilities have difficulties in providing sufficient support for the increasing number of users and communication at a distance from the Earth (Kaplev et al., 2022). In particular, the existing Lunar navigation technologies such as weak signal global positioning system (GPS) and deep space network (DSN) are not able to ensure operations of the upcoming small-scale Lunar missions due to their limitations in localization performance as well as capacity aspects. Another way to provide Lunar PNT service is to create a dedicated Lunar global navigation satellite system (GNSS) constellation, like GNSS systems on Earth. Space agencies like NASA, ESA, and JAXA are now developing the lunar communications relay and navigation systems (LCRNS) and Lunar navigation satellite systems (LNSS). In their systems, satellites will be deployed in moon orbits to provide the communication, positioning, navigation, and timing (CPNT) service at the lunar south pole region where the Artemis base camp will be expected (Murata et al., 2022). Meanwhile, common challenges considered in lunar PNT research arise from poor geometry of the terrestrial GNSS satellites when seen from the lunar user, highly perturbed lunar orbits, and limitations in power, size, and cost of the equipment on lunar satellites (Iiyama et al., 2023). It is also not clear if there will be enough Lunar users to support the cost and resources this would require as the Low-cost surface missions may not be able to support the large power, mass, and weight requirements that these navigation solutions entail (Niemoeller et al., 2022). As an alternative, existing Lunar science and exploration assets could be used to create a low-cost, autonomous, ad-hoc, and on-demand mission-centric Lunar PNT swarm capable of providing PNT services to these low-cost lunar missions (Hagenau et al., 2021). Introducing the non-dedicated and ad-hoc Lunar navigation constellation gives a way to provide PNT services on-demand. The non-dedicated swarm assets of Lunar constellations are designed to localize themselves with minimal interaction with Earth by adding cooperative autonomous localization to lunar missions, freeing up valuable bandwidth and ground segment resources. An autonomous localization of Lunar constellations is based on the concept of the decentralized PNT system with a distributed extended Kalman filter (DEKF) approach to state estimation for minimal onboard operating costs. In the distributed data processing algorithm, computation is broken down and assigned to each satellite, resulting in a considerably decreased computational amount while maintaining the accuracy of the orbit ephemeris and clock offsets as the result of centralized data processing (Wen et al., 2019). The DEKF requires spacecraft to perform two-way ranging operations with each other to communicate simultaneously, leveraging neighbor two-way intersatellite link (ISL) measurements such as pseudoranges to, and relative velocities between, visible satellites as sensor values (Frank et al., 2021). The Lunar autonomous PNT simulation (LAPS) demonstrated the feasibility of orbital asset localization among ad-hoc Lunar small-sat constellations based on the DEKF in Hagenau et al. (2021) and evaluated the matching algorithm proposed by Frank et al. (2021) in scheduling position estimation updates. In previous papers, all assets and measurements are assumed to be always available without consideration of the impact of intermittent and permanent communication failure. This study presents localization performance with increasing levels of network degradation for swarm assets and users to demonstrate the robustness of the decentralized Lunar PNT service in more realistic scenarios. Main issues arising from communication failure include spacecraft permanent or transient loss, antenna failures, message delays, etc. We tested four possible reasons for network degradation for 7 days in 21 satellites frozen with an altitude of 5500 km, evenly spaced around 3 circular, 40 inclination orbital planes where each spacecraft has two directional antennas. As anchor nodes with an independent estimate of their position are required in the DEKF approach, two ground nodes in each pole and one node in the gateway were implemented in the simulation. First, the most probable failure scenario involves the loss of a single spacecraft due to solar interference and technical malfunctions of the assets. Losing the availability of a single spacecraft means losing the two-way ISL measurement of the asset in the DEKF update. In order to provide the best possible quality of PNT service with limited time and resources, the distributed Lunar constellations must schedule the communication activities. The scheduler leverages mixed-integer linear programming (MILP) for the coordination and scheduling of the desired “as-needed” localization service (Niemoeller et al., 2022). We assume the scheduler has completely excluded the spacecraft information before the DEKF update in the failure scenario. When a random spacecraft has been turned off at a specific time, the robustness of the autonomous Lunar PNT system is evaluated. The simulation results give an 11.5% degradation in median position accuracy compared to the idealized performance excluding the asset loss. Second, a large number of assets may vanish due to major hardware problems or meteor strikes around the moon. A multiple spacecraft loss can degrade the localization performance very fast by losing the communication ability to do cross-plane measurements and in-plane measurements in a 3-plane constellation. When the matching-based scheduler is aware of ISL availability, we investigate a large number of in-plane and cross-plane asset vanishments both in close proximity and equally spaced throughout the orbital plane. According to the simulations, the loss of in-plane measurements gives 40.2% degradation while cross-plane measurements degrade 50.5% of asset localization performance among available assets. Therefore, it is concluded that cross-plane measurements are more important in improving the position estimation accuracy. Third, spacecraft failure information can be lost due to the internal message delay, resulting in the DEKF update scheduler to solve the matching problem with unavailable assets. The DEKF update cycle is comprised of network setup, communication, and computations where a global broadcast network and a 2-way ISL network setup take 6 minutes in total (Frank et al., 2021). Once the broadcast network successfully transmits and receives information, a random spacecraft may lose its availability right before solving the matching problem. This means the matching solution is no longer optimal, resulting in degradation in the localization performance. A numerical assessment shows the matching-based scheduler with knowing failure holds 11.5% of position accuracy degradation, whereas the scheduler without knowing failure gives 34% degraded localization performance without asset loss. Fourth, a transient loss of a single or multiple spacecraft may occur due to their antenna outages. After losing the two-way ISL availability for a few DEKF update cycles, the availability of spacecraft can easily be recovered as their states have been independently updated using measurements from anchor nodes. It is likely that the longer failure will result in worse localization performance. We have tested the transient failure of a random single asset for 30 min in the simulation, which is losing 3 update cycles in the DEKF system. From the simulation results, the position accuracy has been degraded to 4.84% which is better than the degraded localization performance of 11.5% from the permanent loss scenario among available assets. In conclusion, the autonomous Lunar PNT system based on the DEKF approach shows the ability to maintain resilience and robustness in the possible communication failure scenarios, ensuring that localization accuracy is preserved across various network degradation and outages. Future studies on investigating user localization performance near the South Pole and the broadcast network system will be continued in the following months.

Yeji Kim↗

Fast methods for multisite charge transfer. Processes II. Analytic nuclear gradients and nonadiabatic dynamics for cCASSCF(1,n) and cCASSCF(2n-1,n) wavefunctions

In this work we derive and implement analytic nuclear gradients and derivative couplings for a constrained complete active space self-consistent field with a small active space designed to model electron or hole transfer. Using a Lagrangian formalism, we are able to differentiate both the CASSCF energy and the constraint (which is required for smooth surfaces over a wide range of parameter space), and the resulting efficient algorithm can be immediately applied to nonadiabatic dynamics simulations of charge transfer processes. Here, we run initial surface-hopping simulations of a proton coupled electron transfer event for a phenoxyl–phenol system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An approach for fast and accurate simulation of phase change material based thermal energy storage in buildings

Latent heat thermal energy storage (LHTES) has significant potential for mitigating peak electricity demand and enabling load shifting in buildings. Phase Change Material embedded heat exchangers (PCM-HX) can significantly improve energy demand management due to high storage capacity. However, PCM-HX evaluation typically depends on computationally expensive fully transient simulations, posing significant challenges for scalable system- and building-level energy assessments across different climates and system architectures. This paper presents a generalized, accurate, and computationally efficient methodology for simulating building energy systems integrated with LHTES. The PCM-HX transient performance is represented by performance maps generated using a Generalized Resistance-Capacitance Model (GRCM) that enables accurate predictions of arbitrary PCM-HXs at low computational cost. The feasibility of the proposed approach was verified using a case study considering a dual-mode heat pump-thermal energy storage (HP-TES) system simulated in Modelica with Spawn of EnergyPlus™ for a DOE prototype small office building in two locations: Tampa, FL, and International Falls, MN. The PCM-HX performance maps provided accurate predictions of PCM-HX transient behavior, with mean absolute percentage deviations within 2–4% compared to GRCM while also achieving at least 1800× reduction in computational time. Moreover, the HP-TES system achieved energy savings of up to 17.4% in Tampa, FL, and 62.2% in International Falls, MN, demonstrating the broader applicability of the proposed methodology across different climate zones. This work highlights the importance of robust PCM-HX models in enabling accurate and computationally efficient building-level simulations and enabling future research opportunities for investigating optimized HP-TES designs and advanced control strategies for grid-interactive buildings.

Modelica↗

Quantifying Impacts of Biomass Pelletization on Fast Pyrolysis Using a Single-Particle Reactor, X-ray Computed Tomography, and Computational Modeling

The pore structure and density of lignocellulosic feedstocks dictate intraparticle transport phenomena and thereby play an important role in thermochemical conversion processes such as fast pyrolysis for biofuel and biochemical production. Variations in microstructure are inherent from different biomass species and can be introduced by preprocessing techniques such as cutting and pelletization. Morphological changes also occur during conversion and lead to vastly different pore structures and behavior during pyrolysis, which impact required conversion times and product distributions. The current work presents a comprehensive comparison of fast pyrolysis of neat and pelletized pine feedstocks, which includes single-particle experiments, modeling, and 3D imaging by X-ray computed tomography (XCT). The particle-scale model included anisotropic heat and mass transport in a shrinking particle with pyrolysis reactions based on the CRECK mechanism with boundary conditions informed by reactor-scale simulations of the single-particle reactor. The models were validated by measurements of the temperature and mass loss from single-particle pyrolysis experiments of neat and pelletized pine. Quantitative analysis of XCT geometries revealed that pyrolytic conversion yielded chars with increased porosity and permeability compared to the unpyrolyzed materials, along with decreased tortuosity and anisotropy. Pelletization of the pine feedstock resulted in a much denser, less permeable material, which converted slower and produced more residual char after pyrolysis compared to neat pine. The results from particle modeling revealed that accounting for the dynamic and anisotropic heat and mass transport caused by differences in pore structure is critical to achieving agreement with experimental results. Overall, this study highlights the dramatic differences in conversion behavior imparted by pelletization and the importance of capturing microstructural attributes in computational models to guide the design and optimization of pyrolysis processes for specific biomass feedstocks.

09 BIOMASS FUELS↗

A Machine Learning Model for Predicting Composition of Catalytic Coprocessing Products from Molecular Beam Mass Spectra

Demand for the development of an automated and integrated refining process for biofuels has increased in recent years due to the lack of generalized process inspection tools. In bio-oil upgrading processes, all process variables are maintained based on the offline specification of intermediates and products. A lack of real-time product specifications in batch-wise monitoring can cause process failure and wasted resources. Therefore, there is a need for a fast and accurate intermediates/product specification tool that can be used for real-time specification to reduce waste and mitigate the risk of process failure. Here, to address this gap, we developed a machine learning (ML) model for predicting speciated bio-oil composition, including paraffin, iso-paraffins, olefins, naphthene, and aromatics. The model is trained using the mass spectra from upgraded products collected in the vapor phase before condensation and predicts the composition of the condensed product. Training ML models using raw mass spectra is challenging due to numerous overlapped peaks originating from different parent compounds. With this in mind, we propose a protocol that (i) transforms raw mass spectra to chemistry-inspired predefined features and (ii) trains decision tree-based models using these features. Our results show that the random forest model was robust against overfitting and had the highest accuracy compared to other models. Moreover, a stochastic ablation method determined the eight most significant features while maximizing the accuracy. Our protocol facilitates real-time compositional analysis of upgraded bio-oils and thus real-time process monitoring. Additionally, this protocol enables the rational design of efficient catalysts and the determination of optimal process conditions.

09 BIOMASS FUELS↗

What Is the Best Use of Biomass? A Harmonized LCA-TEA Framework Quantifying Economic and Environmental Metrics for Bioenergy Pathways

Bioresource utilization is expected to play a pivotal role in complementing existing energy pathways and enhancing energy resilience. This study develops a harmonized life cycle assessment (LCA) and techno-economic analysis (TEA) framework to evaluate the greenhouse gas (GHG) reduction potential, minimum fuel selling price (MFSP), and marginal abatement cost (MAC) of bioenergy pathways. We analyze 19 pathways, including liquid biofuels (via catalytic fast pyrolysis, Fischer–Tropsch synthesis, and gasification), bioelectricity, and biomass-to-hydrogen, with and without carbon capture and storage (CCS). The GHG impacts are assessed using the GREET 2022 model, while U.S. Billion-Ton 2016 biomass availability projections are used to estimate scale-up potential. Additionally, we evaluate the influence of a low-carbon electricity grid on pathway performance. Our results show that CCS implementation reduces carbon intensities (CI) to net-negative values for several pathways, with MAC ranging from $\$$32 to $\$$600 per metric ton (MT) CO2e avoided. Bioelectricity pathways with CCS achieve the lowest MAC ($\$$32–$\$$68/tCO2e), while liquid biofuels and hydrogen pathways remain critical for hard-to-abate sectors like aviation and heavy industry. Pathways with net-positive electricity demand benefit from a low-carbon grid, whereas those co-producing electricity experience increased MAC under lower electricity grid CI scenarios. This open-source framework provides a robust tool for harmonized evaluation of bioenergy pathways, enabling policymakers and stakeholders to identify cost-effective strategies for biomass utilization and carbon abatement at scale. The findings underscore the importance of CCS, co-product credits, and feedstock availability in optimizing bioenergy deployment for a low-carbon economy.

09 BIOMASS FUELS↗

Enable superior performance of ultra-high loading electrodes through the cost-efficient solvent-free electrode manufacturing technology

This research explores an innovative solvent-free method for fabricating ultra-high loading NMC811 and graphite electrodes (~6mAh∙cm -2 ), showcasing remarkable electrochemical performance enhancements compared to the electrodes prepared by the conventional slurry-casting method. Here, the optimized microstructure with dry-printed (DP) electrodes enhanced electrolyte penetration and minimized lithium-ion diffusion tortuosity resulting in improved rate performance at high current rates. Additionally, this innovative electrode manufacturing approach enables more uniform CEI and SEI formation and growth, which effectively doubles the cycle life of single-layer pouch cells with DP electrodes. Beyond the performance enhancements, this method also offers a notable 29.2 % overall cost advantages, potentially revolutionizing future battery manufacturing. The findings presented in this work underscore the potential of solvent-free manufacturing technology as a high-loading capable and cost-efficient path for advanced battery production.

25 ENERGY STORAGE↗

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

Using the Dimensionality Reduction (DR) Approach to Treat Singular and Near-Singular Source and Test Integrals on Triangles for Moment Methods

Recently, the authors presented preliminary results of an initial study of a dimensional reduction scheme for treating (near-)singular integrals (D. R. Wilton et al., “Dimensionality Reduction Approach for Treating Singular and Near-Singular Multidimensional Integrals of Electromagnetics,” 2022 URSI USNC National Radio Science Meeting, Boulder, CO, Jan. 2022). The approach reported there refined and extended several ideas appearing in a recent paper (R. R. Chang, Z. Wang, and Q. Xie, "Fast Convergent Quadrature Method for Evaluating the RWG- and SWG-Related Convolutional Integrals," IEEE Trans. Antennas Propagat., 69, Dec. 2021). That paper reported a curated collection of important, previously published results all leading to very efficient and accurate line integral methods for handling the most common (near-)singular integrals associated with triangles and tetrahedrons with RWG and SWG bases, respectively. Our contributions provided a simpler exposition as well as a more unified, systematic, and robust overall framework for deriving and applying the approach. This presentation further elucidates our extensions to the approach and broadens our initial study to examine the convergence behaviors of the various potential forms over a wider range of triangular source element shape and observation point parameters for various smoothing transformations; we also examine convergence, not just at the subtriangle level, but also overcomplete triangles. In addition, we investigate the application of the recently reported “vertex function” concept to develop faster converging test integrals (Rivero et al., “Acceleration of the Surface Test Integral Using Vertex Functions,” 2021 IEEE Int’l Symp. Ant. Propagat. and USNC-URSI Rad. Sci. Meeting,” Singapore, 4-10 Dec. 2021). Combining these separate schemes has the potential for yielding a near-optimal approach for accurately evaluating singular and near-singular integrals for moment methods.

Singular Integrals↗

Carbon Anode Material from Biomass Pyrolysis Oil

Lithium-ion batteries (LIB) are an important component of electric vehicles and sodium-ion batteries (SIB) are an attractive alternative for grid electric storage. We are investigating a novel approach to synthesizing the carbon anode materials for these batteries from biomass pyrolysis oil as part of conversion processes to produce biofuels. Graphite is used as anode material in LIB and is exclusively produced from petroleum residue or mined mineral carbon. We have synthesized drop-in graphite by coking the heavy residual oil from the distillation of catalytic fast pyrolysis oil and by catalytic graphitizing raw pyrolysis oil. XRD and Raman spectroscopies were used to verify the production of high purity crystalline graphite. Figure 1 shows typical XRD spectra of the bio-graphite compared to commercial material as well as the charge/discharge cycle. Graphite particle sizes and morphologies were adjusted to improve performance using jet milling and carbon coating. The bio-graphite delivered a high capacity (335 mAh/g) when tested in a graphite half-cell. Full cell coin cell experiments were also conducted to verify the observations from half-cell testing. The high value of graphite (>$9/kg) can positively impact the economics of biofuels production and can be an important part of a future circular carbon economy. We have also investigated synthesizing hard carbon from pyrolysis oil for use as anode material in SIB. These batteries are not commercially mature but have great promise in grid storage and use earth abundant elements. We have demonstrated that pyrolysis oil can be used to synthesize hard carbon, which was subsequently be used in SIB experiments. This material achieved a sodium-ion capacity of 250 mAh/g and a first cycle efficiency of 78%, with opportunities to further optimize this performance from optimizing the composition of the pyrolysis oil to shaping the hard carbon particles. As with graphite, hard carbon is a high value (> $10/kg) material that could facilitate biofuels production.

BIOMASS FUELS,INORGANIC, ORGANIC, PHYSICAL, AND AN↗

Development of male-sterile lines of Setaria viridis to accelerate C 4 model plant genetics

Setaria viridis is a diploid C 4 grass in the Poaceae family, notable for its rapid life cycle of 6–8 weeks from sowing to seed—much shorter than the 4–5 months required by crops such as Zea mays and Sorghum bicolor . This fast growth makes S. viridis a valuable model for C 4 crop research. Genetic crosses are essential for studying gene function, but manual crossing is labor-intensive and time-consuming. Here, to address this, we developed a male-sterile line by targeting the S. viridis ortholog of Setaria italica NO POLLEN 1 ( SiNP1 ), which encodes a glucose–methanol–choline oxidoreductase required for pollen exine formation. Using Cas9 and TREX2 -mediated genome editing, we generated SiNP1 knockouts in both the S. viridis ME034V and A10.1 backgrounds that were fully male-sterile. Backcrossing T 0 male-sterile plants to ME034V wild-type followed by selfing yielded a stable BC 1 F 2 line homozygous for a 59 bp deletion in the S. viridis NO POLLEN 1 gene, easily genotyped by PCR and maintained by heterozygous siblings. Using this line, we developed a simple and efficient crossing protocol that eliminates the need for emasculation. This method enables a single person to perform up to 100 crosses per day—compared to 15 using traditional methods—and yields 20–32 F 1 hybrid seeds per panicle with 100% genetic purity. We also quantified pollen flow and outcrossing frequencies under greenhouse conditions to develop optimal bagging strategies and prevent unintended pollination. This resource accelerates genetic research in S. viridis , enhancing its utility as a premier C 4 model for mapping and functional genomics.

C4 research↗

Advanced Interactive Display formats for Terminal Area Traffic Control

This report describes the basic design considerations for perspective Air Traffic Control displays. A software framework has been developed for manual viewing parameter setting (MVPS) in preparation for continued, ongoing developments on automated viewing parameter setting (AVPS) schemes. Two distinct modes of MVPS operations are considered, both of which utilize manipulation pointers imbedded in the three-dimensional scene: (1) direct manipulation of the viewing parameters; in this mode the manipulation pointers act like the control-input device, through which the viewing parameter changes are made. Part of the parameters are rate controlled, and part of them position controlled. This mode is intended for making fast, iterative small changes in the parameters. (2) indirect manipulation of the viewing parameters. This mode is intended primarily for introducing large, predetermined changes in the parameters. Requests for changes in viewing parameter setting are entered manually by the operator by moving viewing parameter manipulation pointers on the screen. The motion of these pointers, which are an integral part of the 3-D scene, is limited to the boundaries of screen. This arrangement has been chosen, in order to preserve the correspondence between the spatial lay-outs of the new and the old viewing parameter setting, a feature which contributes to preventing spatial disorientation of the operator. For all viewing operations, e.g. rotation, translation and ranging, the actual change is executed automatically by the system, through gradual transitions with an exponentially damped, sinusoidal velocity profile, in this work referred to as 'slewing' motions. The slewing functions, which eliminate discontinuities in the viewing parameter changes, are designed primarily for enhancing the operator's impression that he, or she, is dealing with an actually existing physical system, rather than an abstract computer-generated scene, The proposed, continued research efforts will deal with the development of automated viewing parameter setting schemes. These schemes employ an optimization strategy, aimed at identifying the best possible vantage point, from which the Air Traffic Control scene can be viewed for a given traffic situation. They determine whether a change in viewing parameter setting is required and determine the dynamic path along which the change to the new viewing parameter setting should take place.

Grunwald, Arthur J.↗

Model predictive control of heating, ventilation, and air conditioning (HVAC) systems: A state-of-the-art review

Due to the fast advancement of communication and information technology, intelligent buildings have garnered great interest. These buildings can forecast weather, ambient temperature, and sun irradiation and can modify heating, ventilation, and air conditioning (HVAC) operations appropriately, based on current and previous data. This change is intended to reduce HVAC system energy usage while maintaining an appropriate degree of thermal comfort and indoor air quality. Since its inception, model predictive control (MPC) has been one of the prospective solutions for HVAC management systems to reduce both costs and energy usage. Additionally, MPC is becoming increasingly practical as the processing capacity of building automation systems increases and a large quantity of monitored building data becomes available. MPC also provides the potential to improve the energy efficiency of HVAC systems via its capacity to consider limitations, to predict disruptions, and to factor in multiple competing goals such as interior thermal comfort and building energy consumption. Although substantial research has been conducted on MPC in building HVAC systems, there is a shortage of critical reviews and a lack of a comprehensive framework that formulates and defines the applications. Here, this article provides a comprehensive state-of-the-art overview of MPC in HVAC systems. Detailed discussions of modeling approaches and optimization algorithms are included. Numerous design aspects such as prediction horizon, occupancy behavior, building type, and cost function, that impact MPC performance are discussed in detail. The technical characteristics, advantages, and disadvantages of various types of modeling software are discussed. The primary objective of this work is to highlight critical design characteristics for the MPC control scheme and to give improved suggestions for future research. Moreover, numerous prospective scenarios have been suggested that might provide future research direction.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Advanced interactive display formats for terminal area traffic control

This report describes the basic design considerations for perspective air traffic control displays. A software framework has been developed for manual viewing parameter setting (MVPS) in preparation for continued, ongoing developments on automated viewing parameter setting (AVPS) schemes. Two distinct modes of MVPS operations are considered, both of which utilize manipulation pointers imbedded in the three-dimensional scene: (1) direct manipulation of the viewing parameters -- in this mode the manipulation pointers act like the control-input device, through which the viewing parameter changes are made. Part of the parameters are rate controlled, and part of them position controlled. This mode is intended for making fast, iterative small changes in the parameters. (2) Indirect manipulation of the viewing parameters -- this mode is intended primarily for introducing large, predetermined changes in the parameters. Requests for changes in viewing parameter setting are entered manually by the operator by moving viewing parameter manipulation pointers on the screen. The motion of these pointers, which are an integral part of the 3-D scene, is limited to the boundaries of the screen. This arrangement has been chosen in order to preserve the correspondence between the spatial lay-outs of the new and the old viewing parameter setting, a feature which contributes to preventing spatial disorientation of the operator. For all viewing operations, e.g. rotation, translation and ranging, the actual change is executed automatically by the system, through gradual transitions with an exponentially damped, sinusoidal velocity profile, in this work referred to as 'slewing' motions. The slewing functions, which eliminate discontinuities in the viewing parameter changes, are designed primarily for enhancing the operator's impression that he, or she, is dealing with an actually existing physical system, rather than an abstract computer-generated scene. The proposed, continued research efforts will deal with the development of automated viewing parameter setting schemes. These schemes employ an optimization strategy, aimed at identifying the best possible vantage point, from which the air traffic control scene can be viewed for a given traffic situation. They determine whether a change in viewing parameter setting is required and determine the dynamic path along which the change to the new viewing parameter setting should take place.

Grunwald, Arthur J.↗

Improving Signal-to-Noise Ratio (SNR) for Readout Signals Using Adaptive Filters on Reconfigurable Controls Hardware

This study investigates the optimization of Signal-to-Noise Ratio (SNR) in superconducting quantum computing readout signals through adaptive filtering. Quantum computing technology has the potential to revolutionize various fields by delivering exponential speedup in solving certain computational problems. However, the technology's practical implementation is hindered by the difficulty of extracting clean, reliable signals during the readout phase, with various sources of noise presenting a significant barrier to clean signals. This noise, often present in readout profiles due to imperfect isolation, degrades the system's overall SNR, thus impeding the ability to extract the quantum state accurately. The research leverages the power of adaptive filtering to improve the SNR of quantum computing readout signals. Specifically, an adaptive filter is implemented in a PYNQ overlay on an FPGA, and eventually will be connected to a quantum computing system. The system models the noise with a Least Mean Squares (LMS) adaptive filter, and then subtracts the estimated noise from the received signal to improve the SNR. A Direct Memory Access (DMA) channel is used to handle the signal processing, delivering efficient, high-speed data transfer between the PYNQ system and the hardware. The study explores the benefits of this adaptive filtering technique, potentially providing a significant contribution to practical and fast quantum computing.

Johnson, Hans↗

Small UAV Flight Planning in Urban Environments

This work proposes a fast algorithm for generating obstacle-free and wind-efficient flight paths at a constant above-ground-level altitude in urban environments because a fast flight path planning algorithm is an essential function or service needed for enabling small unmanned aerial vehicle (sUAV) to operate in urban environments within Class G airspace. The proposed method first converts the 3D path planning problem to a 2D problem by constructing an obstacle map at a given above-ground-level altitude. A quad-tree decomposition is then used to build a search space in terms of obstacle occupancy and wind difference. The wind cost of traveling through each cell is defined based on energy consumption under various wind conditions. A repulsive potential is also adopted to make sure that the flight plans stay away from obstacles. The Theta* search algorithm, a variant of A* algorithm, is applied to mitigate the path angle change constraints introduced by grid-based graphs. With the Theta* and postsmoothing techniques, an obstacle-free, wind efficient, and constant above-ground-level flight plan can be quickly generated for sUAV operations in urban environments while meeting the lateral path angle constraints. The results showed that the path planning algorithm is efficient and can be finished within several seconds. With a proper choice of wind coefficient, the proposed path planning algorithm outperforms the multiple-shooting trajectory optimization method even in an obstacle-free environment. With the flexibility of incorporating other geo-related costs and computation efficiency, the proposed algorithm shows the potential for real-time flight path planning in complex urban environments.

Path planning↗

Improving Signal-to-Noise Ratio (SNR) for Readout Signals Using Adaptive Filters on Reconfigurable Controls Hardware

This study investigates the optimization of Signal-to-Noise Ratio (SNR) in superconducting quantum computing readout signals through adaptive filtering. Quantum computing technology has the potential to revolutionize various fields by delivering exponential speedup in solving certain computational problems. However, the technology's practical implementation is hindered by the difficulty of extracting clean, reliable signals during the readout phase, with various sources of noise presenting a significant barrier to clean signals. This noise, often present in readout profiles due to imperfect isolation, degrades the system's overall SNR, thus impeding the ability to extract the quantum state accurately. The research leverages the power of adaptive filtering to improve the SNR of quantum computing readout signals. Specifically, an adaptive filter is implemented in a PYNQ overlay on an FPGA, and eventually will be connected to a quantum computing system. The system models the n oise with a Least Mean Squares (LMS) adaptive filter, and then subtracts the estimated noise from the received signal to improve the SNR. A Direct Memory Access (DMA) channel is used to handle the signal processing, delivering efficient, high-speed data transfer between the PYNQ system and the hardware. The study explores the benefits of this adaptive filtering technique, potentially providing a significant contribution to practical and fast quantum computing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗