Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
NASA NTRS2018

The Ozone Mapping and Profiler Suite (OMPS) Limb Profiler (LP) Version 1 Aerosol Extinction Retrieval Algorithm: Theoretical Basis

The theoretical basis of the Ozone Mapping and Profiler Suite (OMPS) Limb Profiler (LP) Version 1 aerosol extinction retrieval algorithm is presented. The algorithm uses an assumed bimodal lognormal aerosol size distribution to retrieve aerosol extinction profiles at 675 nm from OMPS LP radiance measurements. A first-guess aerosol extinction profile is updated by iteration using the Chahine nonlinear relaxation method, based on comparisons between the measured radiance profile at 675 nm and the radiance profile calculated by the Gauss Seidel limb-scattering (GSLS) radiative transfer model for a spherical-shell atmosphere. This algorithm is discussed in the context of previous limb-scattering aerosol extinction retrieval algorithms, and the most significant error sources are enumerated. The retrieval algorithm is limited primarily by uncertainty about the aerosol phase function. Horizontal variations in aerosol extinction, which violate the spherical-shell atmosphere assumed in the version 1 algorithm, may also limit the quality of the retrieved aerosol extinction profiles significantly.

Loughman, Robert↗
NASA NTRS2014

Demonstration of Prognostics-Enabled Decision Making Algorithms on a Hardware Mobile Robot Test Platform

Prognostics-enabled Decision Making (PDM) is an emerging research area that aims to integrate prognostic health information and knowledge about the future operating conditions into the process of selecting subsequent actions for the system. Previous work developing and testing PDM algorithms has been done in simulation; this paper describes the effort leading to a successful demonstration of PDM algorithms on a hardware mobile robot platform. The hardware platform, based on the K11 planetary rover prototype, was modified to allow injection of selected fault modes related to the rover’s electrical power subsystem. The PDM algorithms were adapted to the hardware platform, including development of a software module framework, a new route planner, and modifications to increase the algorithms’ robustness to sensor noise and system timing issues. A set of test scenarios was chosen to demonstrate the algorithms’ capabilities. The modifications to run with a hardware platform, the test scenarios, and the test results are described in detail. The results show a successful use of PDM algorithms on a hardware test platform to optimize mission planning in the presence of electrical system faults.

Prognosis↗
NASA NTRS2018

A Formally Verified Floating-Point Implementation of the Compact Position Reporting Algorithm

The Automatic Dependent Surveillance-Broadcast (ADS-B) system allows aircraft to communicate their current state, including position and velocity information, to other aircraft in their vicinity and to ground stations. The Compact Position Reporting (CPR) algorithm is the ADS-B module responsible for the encoding and decoding of aircraft positions. CPR is highly sensitive to computer arithmetic since it heavily relies on functions that are intrinsically unstable such as floor and modulo. In this paper, a formally-verified double-precision floating-point implementation of the CPR algorithm is presented. The verification proceeds in three steps. First, an alternative version of CPR, which reduces the floating-point rounding error is proposed. Then, the Prototype Verification System (PVS) is used to formally prove that the ideal real-number counterpart of the improved algorithm is mathematically equivalent to the standard CPR definition. Finally, the static analyzer Frama-C is used to verify that the double-precision implementation of the improved algorithm is correct with respect to its operational requirement. The alternative algorithm is currently being considered for inclusion in the revised version of the ADS-B standards document as the reference implementation of the CPR algorithm.

Laura Titolo↗
NASA NTRS2006

Pattern-Based Genetic Algorithm for Airborne Conflict Resolution

NASA has developed the Autonomous Operations Planner (AOP) airborne decision support tool to explore advanced air traffic control concepts that include delegating separation authority to aircraft. A key element of the AOP is its strategic conflict resolution (CR) algorithm, which must resolve conflicts while maintaining conformance with traffic flow management constraints. While a previous CR algorithm, which focused on broader flight plan optimization objectives as a part of conflict resolution, had successfully been developed, new research has identified the need for resolution routes the users find more acceptable (i.e., simpler and more intuitive). A new CR algorithm is presented that uses a combination of pattern-based maneuvers and a genetic algorithm to achieve these new objectives. Several lateral and vertical maneuver patterns are defined and the application of the genetic algorithm explained. A new approach to defining a conflicted fitness function using estimates of the local conflict region around a conflicted trajectory is also presented. Preliminary performance characteristics of the implemented algorithm are provided.

Vivona, Robert A.↗
NASA NTRS2019

Applying the Dark Target Aerosol Algorithm with Advanced Himawari Imager Observations During the KORUS-AQ Field Campaign

For nearly 2 decades we have been quantitatively observing the Earth's aerosol system from space at one or two times of the day by applying the Dark Target family of algorithms to polar-orbiting satellite sensors, particularly MODIS and VIIRS. With the launch of the Advanced Himawari Imager (AHI) and the Advanced Baseline Imagers (ABIs) into geosynchronous orbits, we have the new ability to expand temporal coverage of the traditional aerosol optical depth (AOD) to resolve the diurnal signature of aerosol loading during daylight hours. The Korean–United States Air Quality (KORUS-AQ) campaign taking place in and around the Korean peninsula during May–June 2016 initiated a special processing of full-disk AHI observations that allowed us to make a preliminary adoption of Dark Target aerosol algorithms to the wavelengths and resolutions of AHI. Here,we describe the adaptation and show retrieval results from AHI for this 2-month period. The AHI-retrieved AOD is collocated in time and space with existing AErosol RObotic NETwork stations across Asia and with collocated Terra and Aqua MODIS retrievals. The new AHI AOD product matches AERONET, and the standard MODIS product does as well, and the agreement between AHI and MODIS retrieved AOD is excellent, as can be expected by maintaining consistency in algorithm architecture and most algorithm assumptions. Furthermore, we show that the new product approximates the AERONET-observed diurnal signature. Examining the diurnal patterns of the new AHI AOD product we find specific areas over land where the diurnal signal is spatially cohesive. For example, in Bangladesh the AOD in-creases by 0.50 from morning to evening, and in northeast China the AOD decreases by 0.25. However, over open ocean the observed diurnal cycle is driven by two artifacts, one associated with solar zenith angles greater than 70t hat may be caused by a radiative transfer model that does not properly represent the spherical Earth and the other artifact associated with the fringes of the 40 degree glint angle mask. This opportunity during KORUS-AQ provides encouragement to move towards an operational Dark Target algorithm for AHI. Future work will need to re-examine masking including snow mask, reevaluate assumed aerosol models for geosynchronous geometry, address the artifacts over the ocean, and investigate size parameter retrieval from the over-ocean algorithm.

Gupta, Pawan↗
NASA NTRSDate not supplied

Control Effector Unsaturation Modification to the Cascading Generalized Inverse Control Allocation Algorithm

Control allocation has sufficiently progressed such that it is used in front-line fighter aircraft such as the F-18Superhornet and the F-35 Joint Strike Fighter. Published literature shows the F-35 utilizes Nonlinear Dynamic Inversion in conjunction with an Effector Blender that incorporates the Cascading Generalized Inverse control allocation algorithm. While the Cascading Generalized Inverse algorithm is one of the premier generalized inverse methods, it does suffer from three deficiencies. In particular, it suffers from an inability to achieve some desired outcomes, it intermittently provides non-optimal solutions and generally fails to preserve moment direction near maximal achievable moments. An effector unsaturation method based on a Scalar Difference Quadratic was first introduced and implemented on the iterative Prediction Method control allocation algorithm which was shown to consistently achieve optimal (weighted) control allocation solutions throughout the entire Attainable Moment Set while preserving desired moment direction. In this paper, the shortcomings of the Cascading Generalized Inverse algorithm are addressed by augmenting the baseline algorithm with Scalar Difference Quadratic unsaturation identification and location at each iteration. Numerical case studies demonstrate that the Modified Cascading Generalized Inverse algorithm resolves the aforementioned deficiencies.

Michael J Acheson↗
NASA NTRS2020

An Algorithm for Hyperspectral Remote Sensing of Aerosols: 3. Application to the GEO-TASO Data in KORUS-AQ Field Campaign

This paper describes the third part of a series of investigations to develop algorithms for simultaneous retrieval of aerosol parameters and surface spectral reflectance from the data measured by GEOstationary Trace gas and Aerosol Sensor Optimization (GEO-TASO) instrument. Since the algorithm is designed for future hyperspectral and geostationary satellite sensors, such as Tropospheric Emissions: Monitoring of Pollution (TEMPO), it is applied to GEO-TASO data measured over the same area by different flights as part of the Korea-United Stated Air Quality Study (KORUS-AQ) field campaign in 2016. While GEO-TAOS has a spectral sampling interval of ~0.28 nm in the visible, its data is thinned through a band selection approach with consideration of atmospheric transmittance and different surface types, which yields 20 common spectral bands to be used by the algorithm. The algorithm starts with 4 common principal components (PCs) for surface spectral reflectance extracted from various spectral libraries, and the constraints of surface reflectance parameters and aerosol scattering models respectively from k- means clustering analysis of the Rayleigh-corrected GEO-TASO spectra and AERONET data. The algorithm then proceeds iteratively with an optimal estimation approach to update PCs and retrieve aerosol optical depth (AOD) until the best match between simulated and GEOS-TASO measured spectra is achieved. The spectral AODs are compared between those retrieved from GEO-TASO (x) and 7 AERONETS (y) in 440, 550, 550, 675 nm, respectively. The comparison reveals that iterative updates of surface spectral PCs (and so surface reflectance) yield significant enhancement in AOD retrievals, improving the mean linear fitting equations from y = 0.735x + 0.088 (without update of PCs) to y = 1.055x+ 0.01, and the Pearson correlation coefficient (𝑅𝑅2) from 0.54 to 0.76, respectively. Move case studies are need to further evaluate the algorithm for its application to TEMPO that carries a enhanced version of GEO-TASO instrument.

Tropospheric Emissions: Monitoring of Pollution (T↗
NASA NTRS2020

Evaluation of the MODIS Collection 6 Multilayer Cloud Detection Algorithm Through Comparisons with Cloudsat Cloud Profiling Radar and CALIPSO CALIOP Products

Since multilayer cloud scenes are common in the atmosphere and can be an important source of uncertainty in passive satellite sensor cloud retrievals, the MODIS MOD06 and MYD06 standard cloud optical property products include a multilayer cloud detection algorithm to assist with data quality assessment. This paper presents an evaluation of the Aqua MODIS MYD06 Collection 6 multilayer cloud detection algorithm through comparisons with active Cloud Profiling Radar (CPR) and Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) products that have the ability to provide cloud vertical distributions and directly classify multilayer cloud scenes and layer properties. To compare active sensor products with an imager such as MODIS, it is first necessary to define multilayer clouds in the context of their radiative impact on cloud retrievals. Three main parameters have thus been considered in this evaluation: (1) the maximum separation distance between two cloud layers, (2) the thermodynamic phase of those layers and (3) the upper-layer cloud optical thickness. The impact of including the Pavolonis–Heidinger multilayer cloud detection algorithm, introduced in Collection 6, to assist with multilayer cloud detection has also been assessed. For the year 2008, the MYD06 C6 multilayer cloud detection algorithm identifies roughly 20% of all cloudy pixels as multilayer (decreasing to about 13% if the Pavolonis–Heidinger algorithm output is not used). Evaluation against the merged CPR and CALIOP2B-CLDCLASS-lidar product shows that the MODIS multilayer detection results are quite sensitive to how multilayer clouds are defined in the radar and lidar product and that the algorithm performs better when the optical thickness of the upper cloud layer is greater than about 1.2 with a minimum layer separation distance of 1 km. Finally, we find that filtering the MYD06 cloud optical properties retrievals using the multilayer cloud flag improves aggregated statistics, particularly for ice cloud effective radius.

MODIS↗
NASA NTRS2021

Goddard Latent Heating Retrieval Algorithm for TRMM and GPM

The Goddard Convective-Stratiform Heating (CSH) algorithm has been used to retrieve latent heating (LH) associated with clouds and cloud systems in support of the Tropical Rainfall Measuring Mission (TRMM) and Global Precipitation Measurement (GPM) mission. The CSH algorithm requires the use of a cloud-resolving model (CRM) to simulate LH profiles to build look-up tables (LUTs). In this paper we describe the current V6 CSH and its differences/similarities versus the previous V5 CSH. Long-term CRM simulations are conducted to identify the impact of CRM resolution and the convective-stratiform separation method on LH structure/profiles. The TRMM and GPM Combined algorithm derived surface rainfall rates and their associated precipitation properties are the input to the CSH algorithm. Since there is no direct measurement of LH structure, the performance of the CSH V6 algorithm is examined by comparing its vertically-integrated heating (or equivalent surface rainfall rate) against the surface rainfall rate derived from the TRMM/GPM Combined algorithm. The results suggest the CSH three-month and zonal mean equivalent surface rain rates are in good agreement with the Combined rates over the ITCZ region; the agreement is best over ocean. CSH three-month and zonal mean equivalent surface rain rates are larger than the Combined rates over land in both the tropics and sub-tropics. CSH three-month mean equivalent surface rainfall rates also have local differences with the Combined rates that can be smoothed by area averaging to larger horizontal resolutions (from the CSH standard grid of 0.25° × 0.25° to 0.5° × 0.5° or 1.0° × 1.0°). CSH equivalent surface rainfall rates have more light rain rates but less larger rain rates compared to the GPM Combined surface rain rates.

Latent heating retrieval↗
NASA NTRSDate not supplied

Joint ESA-NASA Multi-Mission Algorithm and Analysis Platform (MAAP)

The scientific community is faced with a need for greatly improved data sharing, analysis, visualization and advanced collaboration based firmly on open science principles. Recent and upcoming launches of new satellite missions with more complex and voluminous data, as well as the ever more urgent need to better understand the global carbon budget and related ecological processes, provided the immediate rational for the ESA-NASA Multi-mission Algorithm and Analysis Platform (MAAP). This highly collaborative joint project of ESA and NASA established a framework between ESA and NASA to share data, science algorithms and compute resources in order to foster and accelerate scientific research conducted by ESA and NASA EO data users. Presented to the public in October 2021, the current version of MAAP provides a common cloud-based platform with computing capabilities co-located with the data, a collaborative coding and analysis environment, and a set of interoperable tools and algorithms developed to support the estimation and visualization of global above-ground biomass. Data from the Global Ecosystem Dynamics Investigation (GEDI) mission on the International Space Station and the Ice, Cloud, and Land Elevation Satellite-2 (ICESat-2) have been instrumental in the first products of MAAP including the first comprehensive map of Boreal above-ground Biomass and a current Global Biomass Harmonization Activity, but the platform is also being specifically designed to support the forthcoming ESA Biomass mission and incorporate data from the upcoming NASA-ISRO SAR (NISAR) mission. While these missions and the corresponding research which includes airborne, field, and calibration/validation data collection and analyses, provide a wealth of data and information relating to global biomass estimation, they also present data storing, processing and sharing challenges. The NISAR mission alone will produce about 80TB/day. These large data volumes present a challenge that would otherwise place accessibility limits on the scientific community and impact scientific progress. Other challenges being addressed by MAAP include: 1) Enabling researchers to easily discover, process, visualize and analyze large volumes of data from both agencies; 2) Providing a wide variety of data in the same coordinate reference frame to enable comparison, analysis, data evaluation, and data generation; 3) Providing a version-controlled science algorithm development environment that supports tools, co-located data and processing resources; and 4) Addressing intellectual property and sharing challenges related to collaborative algorithm development and sharing of data and algorithms. MAAP products can be explored on the MAAP Dashboard at https://earthdata.nasa.gov/maap-biomass or the joint platform entrance at scimaap.net. MAAP also can be accessed through individual NASA (https://maap-project.org) and ESA (https://esa-maap.org/) landing pages.

cloud computing↗
NASA NTRS2021

Multi-Pass Sequential Mini-Batch Stochastic Gradient Descent Algorithms for Noise Covariance Estimation in Adaptive Kalman Filtering

Estimation of unknown noise covariances in a Kalman filter is a problem of significant practical interest in a wide array of applications. Although this problem has a long history, reliable algorithms for their estimation were scant, and necessary and sufficient conditions for identifiability of the covariances were in dispute until recently. Necessary and sufficient conditions for covariance estimation and a batch estimation algorithm were presented in our previous study. This paper presents stochastic gradient descent algorithms for noise covariance estimation in adaptive Kalman filters that are an order of magnitude faster than the batch method for similar or better root mean square error. More significantly, these algorithms are applicable to non-stationary systems where the noise covariances can occasionally jump up or down by an unknown magnitude. The computational efficiency of the new algorithms stems from adaptive thresholds for convergence, recursive fading memory estimation of the sample cross-correlations of the innovations, and accelerated stochastic gradient descent algorithms. The comparative evaluation of the proposed methods on a number of test cases demonstrates their computational efficiency and accuracy.

Adaptive Kalman filtering↗
NASA NTRSDate not supplied

Progress Towards a Common CERES Cloud Mask Algorithm for MODIS and VIIRS: Evaluation using CALIOP Data

For over two decades The Clouds and the Earth’s Radiant Energy System (CERES) project has endeavored to produce a long-term global climate data record for detecting changes in the Earth’s radiation budget and to improve understanding of how clouds contribute to those changes. CERES incorporates cloud information derived from passive narrowband satellite imaging radiometers, and over the course of the project different instruments have contributed to this effort, namely the Moderate Resolution Imaging Spectroradiometer (MODIS) and the Visible Infrared Imaging Radiometer Suite (VIIRS).Cloud properties have been derived from MODIS on the Aqua satellite for CERES since 2002,and VIIRS on the NOAA-20 satellite launched in 2017 will continue the cloud record once Aqua-MODIS reaches the end of its operational lifetime. However, MODIS and VIIRS have different spectral capabilities and characteristics which complicates our ability to seamlessly transition the record from MODIS to VIIRS. This study evaluates some of the recent algorithm modifications incorporated by the CERES Cloud Working Group towards developing a unified cloud mask algorithm for MODIS and VIIRS that utilizes a set of spectral bands common to both instruments. Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) data products are used to evaluate MODIS and VIIRS regional cloud fraction estimates and identify areas where improvements can be made. The cloud mask algorithm relies on computed estimates of cloud-free top-of-atmosphere radiances to differentiate cloudy and cloud-free imager pixels. The unified cloud mask algorithm currently under development uses a reduced number of spectral bands common to both MODIS and VIIRS and so relies on the accuracy of these simulated cloud-free radiances more heavily than predecessor algorithms, i.e., the CERES Edition 4 cloud mask, which use as much spectral information as available on each imager with less consideration for cross-platform consistency. Our validation strategy using CALIOP data is also described. The CALIOP observations are critical for assessing cloud detection accuracies and for independently confirming cloud-free conditions which enables a more robust evaluation of the simulated cloud-free radiances for biases due to factors such as view angle and the spectral dependence of water vapor absorption. These effects are known to differ for the two satellite instruments. Comparisons of MODIS and VIIRS cloud fractions are presented in context with estimates from CALIOP and from the CERES Edition 4 cloud mask algorithm to gauge current progress in developing accurate and consistent MODIS and VIIRS cloud properties for CERES.

CERES↗
NASA NTRSDate not supplied

Formalization of the Bellman-Ford Algorithm for Airspace Applications

This paper describes the formal verification of one of the most well-known algorithms for finding the shortest path between all vertices in a directed graph, namely the Bellman-Ford algorithm. This formal verification, performed in the Prototype Verification System (PVS), is motivated by two applications in the aerospace domain which use the algorithm for path planning. The first is a pre-flight calculation that uses an adapted version of Bellman-Ford to find a route intended to maximize GNSS availability throughout the flight. The second is a more traditional application intended to find the shortest path between an autonomous aircraft's current position and a goal waypoint, while avoiding regions of space specified by geofences. A novel aspect of this formal verification effort is the inclusion of two distinct models of computation for the algorithm, one being a traditional serial computation, and the other being an explicitly parallel computation. The ability to use parallel computation in the Bellman-Ford algorithm is in fact why it was chosen over other traditionally more performant algorithms, especially for the GNSS application, where the size of the graph makes a purely serial computation infeasible.

formal verification↗
DOE OSTI2023

An Initial Study of the Convergence Rate of Griffin’s Pebble Bed Reactors Algorithm

This paper presents an initial study of the convergence properties of an iterative algorithm for computing the burnup distribution in a pebble bed reactor (PBR) in its equilibrium core condition. The algorithm is implemented in the Griffin code. Griffin is a reactor multiphysics analysis application jointly developed by Idaho National Laboratory (INL) and Argonne National Laboratory (ANL). Griffin’s PBR algorithm is discussed and simulation data are presented. An alternative matrix formulation of the algorithm is presented that facilitates analysis of the iterative algorithm. The dependence of the spectral radius of the iterative algorithm on operational and discretization parameters is investigated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗
DOE OSTI2021

A parallel evolutionary multiple-try metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions

We develop an Evolutionary Markov Chain Monte Carlo (EMCMC) algorithm for sampling spatial partitions that lie within a large, complex, and constrained spatial state space. Our algorithm combines the advantages of evolutionary algorithms (EAs) as optimization heuristics for state space traversal and the theoretical convergence properties of Markov Chain Monte Carlo algorithms for sampling from unknown distributions. Local optimality information that is identified via a directed search by our optimization heuristic is used to adaptively update a Markov chain in a promising direction within the framework of a Multiple-Try Metropolis Markov Chain model that incorporates a generalized Metropolis-Hastings ratio. We further expand the reach of our EMCMC algorithm by harnessing the computational power afforded by massively parallel computing architecture through the integration of a parallel EA framework that guides Markov chains running in parallel.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Genetic algorithm optimization of nuclear criticality experiment for reduction of intermediate-energy 239 Pu nuclear data uncertainties

Nuclear criticality experiments are conducted to investigate specific nuclear data important for safe handling and storage of fissile materials, reactor design and operation, and the validation of radiation transport codes. Incorrect or uncertain nuclear data can prohibitively impact operational safety limits, reactor licensing, and predictive simulation capability; therefore, integral measurements from criticality experiments are necessary and should be performed frequently. To maximize the impact of the integral measurements, it is important to consider experiment geometry, material selection, and component dimensions. When taking these considerations into account, the experiment design process becomes iterative and very time intensive. This work utilizes a genetic algorithm to efficiently explore potential nuclear criticality experiment designs for the Laboratory Directed Research & Development project PARADIGM (PARallel Approach of Differential and InteGral Measurements) at Los Alamos National Laboratory. In this paper, the building blocks of the genetic algorithm are discussed in detail, the genetic algorithm methodology is verified, and the genetic algorithm is used to produce three candidate experiment models for the final PARADIGM design. The three candidate models produced by the genetic algorithm consist of copper-reflected assemblies containing 14 repeating units of alumina, graphite, boron, and plutonium plates. Furthermore, in addition to the optimization results, final design considerations are also discussed for designs with a height and/or weight very close to or slightly above assembly machine operational limits.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗