Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “control algorithm”

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,405 records · Page 78

Hybrid Guidance Control for a Hypervelocity Small Size Asteroid Interceptor Vehicle

Near-Earth Objects (NEOs) are comets and/or asteroids that have orbits in proximity with Earth's own orbit. NEOs have collided with the Earth in the past, which can be seen at such places as Chicxulub crater, Barringer crater, and Manson crater, and will continue in the future with potentially significant and devastating results. Fortunately such NEO collisions with Earth are infrequent, but can happen at any time. Therefore it is necessary to develop and validate techniques as well as technologies necessary to prevent them. One approach to mitigate future NEO impacts is the concept of high-speed interceptor. This concept is to alter the NEO's trajectory via momentum exchange by using kinetic impactors as well as nuclear penetration devices. The interceptor has to hit a target NEO at relative velocity which imparts a sufficient change in NEO velocity. NASA's Deep Impact mission has demonstrated this scenario by intercepting Comet Temple 1, 5 km in diameter, with an impact relative speed of approximately 10 km/s. This paper focuses on the development of hybrid guidance navigation and control (GNC) algorithms for precision hypervelocity intercept of small sized NEOs. The spacecraft's hypervelocity and the NEO's small size are critical challenges for a successful mission as the NEO will not fill the field of view until a few seconds before intercept. The investigation needs to consider the error sources modeled in the navigation simulation such as spacecraft initial state uncertainties in position and velocity. Furthermore, the paper presents three selected spacecraft guidance algorithms for asteroid intercept and rendezvous missions. The selected algorithms are classical Proportional Navigation (PN) based guidance that use a first order difference to compute the derivatives, Three Plane Proportional Navigation (TPPN), and the Kinematic Impulse (KI). A manipulated Bennu orbit that has been changed to impact Earth will be used as a demonstrative example to compare the three methods. In addition, a hybrid approach that is a combination between proportional navigation and kinematic impulse will be investigated to find an effective, error tolerant, and power saving approach. A 3-dimension mission scenario for both the asteroid and the interceptor spacecraft software simulator is developed for testing of the controllers. The current result demonstrates that a miss distance magnitude of less than 10m is found using the PN and TPPN guidance laws for small asteroid in the presence of error in the spacecraft states. Moreover, the paper presents these results and also the hybrid control approach simulation results.

asteroid↗

Formulation and Implementation of Inflow/Outflow Boundary Conditions to Simulate Propulsive Effects

Boundary conditions appropriate for simulating flow entering or exiting the computational domain to mimic propulsion effects have been implemented in an adaptive Cartesian simulation package. A robust iterative algorithm to control mass flow rate through an outflow boundary surface is presented, along with a formulation to explicitly specify mass flow rate through an inflow boundary surface. The boundary conditions have been applied within a mesh adaptation framework based on the method of adjoint-weighted residuals. This allows for proper adaptive mesh refinement when modeling propulsion systems. The new boundary conditions are demonstrated on several notional propulsion systems operating in flow regimes ranging from low subsonic to hypersonic. The examples show that the prescribed boundary state is more properly imposed as the mesh is refined. The mass-flowrate steering algorithm is shown to be an efficient approach in each example. To demonstrate the boundary conditions on a realistic complex aircraft geometry, two of the new boundary conditions are also applied to a modern low-boom supersonic demonstrator design with multiple flow inlets and outlets.

Boundary↗

Long-term trends in connected thermostat performance

Internet-connected thermostats (CTs) control heating and cooling systems in about 30% of North American homes, and capture half of annual thermostat sales. In 2017 the U.S. Environmental Protection Agency created a program to certify the performance of ENERGY STAR® Connected Thermostats. To demonstrate compliance with energy-saving criteria, thermostat vendors must submit performance summaries for a representative sample of up to 1250 homes. Vendors must then re-submit results from a new, representative sample every six months in order to maintain their ENERGY STAR certification. This procedure has created a unique record of each thermostat’s long-term performance in response to changes in weather, customer demographics, building stock, and algorithms. Our analysis covers submissions from 13 different vendors, who submitted data up to 7 times over four years. We found that these semi-annual samples generated relatively stable trends for comfort temperatures and Heating, Ventilating and Air Conditioning (HVAC) runtimes over the study period. However, some vendors achieved consistently more energy-conserving comfort temperatures and shorter HVAC runtimes than others. The most recent submission runtimes averaged 700 hours for heating and 1,300 hours for cooling, but some vendors achieved runtimes as much as 17% below the mean. This implies lower energy consumption is due in large part to more successful algorithms and control strategies used by those vendors.

Meier, Alan↗

Multi-Star Wavefront Control with SCExAO Instrument: Demonstration with an Internal Source

Although only a small fraction of currently known exoplanets was found in binary and multiple systems, studies show that such stars do form planets, with an efficiency that is smaller, but within an order of magnitude of single stars. However, binaries are rarely considered as targets for exoplanet imaging space missions because of challenges of removing light from the second binary component. In our previous works it was shown how to solve two main issues that make exoplanet imaging in multiple systems impossible, namely, the mutual incoherence of speckles created by different binary components, and inability of a deformable mirror (DM) to control the starlight beyond the DM outer working angle/Nyquist limit. Feasibility of the developed Multi-Star Wavefront Control (MSWC) and Super-Nyquist Wavefront Control(SNWC) algorithms was demonstrated at the Ames Coronagraph Experiment (ACE) laboratory using a simple imaging system with a DM and no coronagraph. In this paper, we report the results our MSWC experiments using the Subaru Coronagraphic Extreme Adaptive Optics (SCExAO) instrument that is part of our technology development effort. The main goal of these experiments is to validate MSWC on a real coronagraphic system by using an internal source to simulate at least one real representative binary target. In our demonstration narrow-band contrast of 4.1×10−6has been reached by using MSWC in a 12×6λ/D dark zone separated from the primary component of the simulated binary star (STF 3121 AB) by 4λ/D. This contrast is better by a factor of 13.2 than the contrast floor reached by standard single-star wavefront control (SSWC). We also discuss the main limiting factors that affect the MSWC performance in our experiments.

Binary stars↗

A case for nonlinear model simplification in the design of flight control systems

An algorithm is presented for obtaining a reduced order or simplified nonlinear model of a nonlinear plant. The method provides a systematic approach for quickly finding the optimal simplified model of the system. Controllers are then designed around this nonlinear model and are used to control the original plant. An example design, for the F-8 aircraft, illustrates that the simplified model does indeed enable the design of a linear controller whose performance is indistinguishable from higher order optimal controllers for the original nonlinear plant. The net result is a simplified design procedure for effectively controlling complex nonlinear systems.

Desrochers, A. A.↗

Efficient computer algebra algorithms for polynomial matrices in control design

The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.

Baras, J. S.↗

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↗

PANDEMIC: Occupancy driven predictive ventilation control to minimize energy consumption and infection risk

During the SARS-CoV-2 (COVID-19) pandemic, governments around the world have formulated policies requiring ventilation systems to operate at a higher outdoor fresh air flow rate for a sufficient time, which has led to a sharp increase in building energy consumption. Therefore, it is necessary to identify an energy-efficient ventilation strategy to reduce the risk of infection. In this study, we developed an occupant-number-based model predictive control (OBMPC) algorithm for building ventilation systems. First, we collected the occupancy and Heating, ventilation, and air conditioning system (HVAC) data from March to July 2021. Then, four different models (Auto regression moving average-based multilayer perceptron (ARMA_MLP), Recurrent neural networks (RNN), Long short-term memory networks (LSTM), and Nonhomogeneous Markov with change points detection (NH_Markov)) were used to predict the number of room occupants from 15 min to 24 h ahead with an interval output. We found that each model could predict the number of occupants with 85% accuracy using a one-person offset. Furthermore, the accuracy of 15 min of the ahead prediction could reach 95% with a one-person offset, but none of them could track abrupt changes. The occupancy prediction results were used to calculate the ventilation demand using the Wells-Riley equation, and the upper bound can maintain an infection risk lower than 2% for 93% of the day. This OBMPC model could reduce the coil load by 52.44% and shift the peak load by 3 h up to 5 kW compared with 24 × 7 h full outdoor air (OA) system when people wear masks in the space. The occupancy prediction uncertainty could cause a 9% to 26% difference in demand ventilation, a 0.3°C to 2.4°C difference in zone temperature, a 28.5% to 44.5% difference in outdoor airflow rate, and a 10.7% to 28.2% difference in coil load.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Multiagent Flight Control in Dynamic Environments with Cooperative Coevolutionary Algorithms

Dynamic environments in which objectives and environmental features change with respect to time pose a difficult problem with regards to planning optimal paths through these environments. Path planning methods are typically computationally expensive, and are often difficult to implement in real time if system objectives are changed. This computational problem is compounded when multiple agents are present in the system, as the state and action space grows exponentially with the number of agents in the system. In this work, we use cooperative coevolutionary algorithms in order to develop policies which control agent motion in a dynamic multiagent unmanned aerial system environment such that goals and perceptions change, while ensuring safety constraints are not violated. Rather than replanning new paths when the environment changes, we develop a policy which can map the new environmental features to a trajectory for the agent while ensuring safe and reliable operation, while providing 92% of the theoretically optimal performance.

Coevolution↗

Multiagent Flight Control in Dynamic Environments with Cooperative Coevolutionary Algorithms

Dynamic flight environments in which objectives and environmental features change with respect to time pose a difficult problem with regards to planning optimal flight paths. Path planning methods are typically computationally expensive, and are often difficult to implement in real time if system objectives are changed. This computational problem is compounded when multiple agents are present in the system, as the state and action space grows exponentially. In this work, we use cooperative coevolutionary algorithms in order to develop policies which control agent motion in a dynamic multiagent unmanned aerial system environment such that goals and perceptions change, while ensuring safety constraints are not violated. Rather than replanning new paths when the environment changes, we develop a policy which can map the new environmental features to a trajectory for the agent while ensuring safe and reliable operation, while providing 92% of the theoretically optimal performance

Experimentation↗

Closed Loop System Identification with Genetic Algorithms

High performance control design for a flexible space structure is challenging since high fidelity plant models are di.cult to obtain a priori. Uncertainty in the control design models typically require a very robust, low performance control design which must be tuned on-orbit to achieve the required performance. Closed loop system identi.cation is often required to obtain a multivariable open loop plant model based on closed-loop response data. In order to provide an accurate initial plant model to guarantee convergence for standard local optimization methods, this paper presents a global parameter optimization method using genetic algorithms. A minimal representation of the state space dynamics is employed to mitigate the non-uniqueness and over-parameterization of general state space realizations. This control-relevant system identi.cation procedure stresses the joint nature of the system identi.cation and control design problem by seeking to obtain a model that minimizes the di.erence between the predicted and actual closed-loop performance.

Whorton, Mark S.↗

Towards robust autonomous impedance spectroscopy analysis: A calibrated hierarchical Bayesian approach for electrochemical impedance spectroscopy (EIS) inversion

Distribution-based analyses, such as the distribution of relaxation times (DRT) and the distribution of diffusion times (DDT), present model-free alternatives to equivalent circuit modeling for analysis of electrochemical impedance spectroscopy (EIS) data. However, reconstructing such distributions from noisy impedance data is an ill-posed problem that must be solved with specialized inversion algorithms, requiring careful control and tuning. Furthermore, most inversion algorithms developed to date can only solve problems of limited complexity. Herein, we present a new hierarchical Bayesian method for EIS inversion, leveraging efficient algorithms for optimization and Hamiltonian Monte Carlo (HMC) sampling to solve models of arbitrary complexity. We overcome the challenge of ad-hoc parameter tuning by encoding intrinsic characteristics of the DRT and DDT into flexible prior distributions and “pre-calibrating” the model to simulated data. This approach is versatile, highly robust to noise, and provides quantitative estimates of both the error structure of the data and the uncertainty in the recovered distributions. The model is validated with simulated data to demonstrate accurate recovery of the DRT and the DDT. The method also shows promise for simultaneous recovery of multiple distributions, raising the intriguing possibility of semi-autonomous EIS analysis and ad-hoc model construction. Finally, the practical utility of the method is illustrated with experimental data. Throughout, we draw comparisons to several recently published EIS inversion methodologies.

36 MATERIALS SCIENCE↗

Detect and correct bias in multi-site neuroimaging datasets

The desire to train complex machine learning algorithms and to increase the statistical power in association studies drives neuroimaging research to use ever-larger datasets. The most obvious way to increase sample size is by pooling scans from independent studies. However, simple pooling is often ill-advised as selection, measurement, and confounding biases may creep in and yield spurious correlations. In this work, we combine 35,320 magnetic resonance images of the brain from 17 studies to examine bias in neuroimaging. In the first experiment, Name That Dataset, we provide empirical evidence for the presence of bias by showing that scans can be correctly assigned to their respective dataset with 71.5% accuracy. Given such evidence, we take a closer look at confounding bias, which is often viewed as the main shortcoming in observational studies. In practice, we neither know all potential confounders nor do we have data on them. Hence, we model confounders as unknown, latent variables. Kolmogorov complexity is then used to decide whether the confounded or the causal model provides the simplest factorization of the graphical model. Finally, we present methods for dataset harmonization and study their ability to remove bias in imaging features. In particular, we propose an extension of the recently introduced ComBat algorithm to control for global variation across image features, inspired by adjusting for unknown population stratification in genetics. Overall, our results demonstrate that harmonization can reduce dataset-specific information in image features. Further, confounding bias can be reduced and even turned into a causal relationship. However, harmonization also requires caution as it can easily remove relevant subject-specific information. Code is available at https://github.com/ai-med/Dataset-Bias.

42 ENGINEERING↗

PRIME: a real-time cyber-physical systems testbed: from wide-area monitoring, protection, and control prototyping to operator training and beyond

As the power grid continues to evolve with advanced wide-area monitoring, protection, and control (WAMPAC) algorithms, there is an increasing need for realistic testbed environments with industry-grade software and hardware-in-the-loop (HIL) to perform verification and validation studies. Such testbed environments serve as ideal platforms to perform WAMPAC prototyping, operator training, and also to study the impacts of different types of cyberattack scenarios on the operation of the grid. In this paper, we introduce PRIME (PNNL cybeR physIcal systeMs tEstbed): the testbed that integrates real-time transmission system simulator with commercial industry grade energy management system (EMS) software and remote hardware-in-the-loop (RHIL). PRIME is an end-to-end, modular testbed that allows high-fidelity RHIL experimentation of a power system. We present two detailed case studies (fault location and clearing in transmission system, and operator training) to showcase the capabilities of our PRIME testbed. Finally, we briefly discuss some of the potential limitations of our testbed in terms of scalability and flexibility to setup larger test systems and identify directions for future work to address those limitations.

42 ENGINEERING↗

Superconvergence of Online Optimization for Model Predictive Control

We develop a one-Newton-step-per-horizon, online, lag-L, model predictive control (MPC) algorithm for solving discrete-time, equality-constrained, nonlinear dynamic programs. Based on recent sensitivity analysis results for the target problems class, we prove that the approach exhibits a behavior that we call superconvergence; that is, the tracking error with respect to the full horizon solution is not only stable for successive horizon shifts, but also decreases with increasing shift order to a minimum value that decays exponentially in the length of the receding horizon. The key analytical step is the decomposition of the one-step error recursion of our algorithm into algorithmic error and perturbation error. We show that the perturbation error decays exponentially with the lag between two consecutive receding horizons, while the algorithmic error, determined by Newton’s method, achieves quadratic convergence instead. Overall this approach induces our local exponential convergence result in terms of the receding horizon length for suitable values of L. In conclusion, numerical experiments validate our theoretical findings.

97 MATHEMATICS AND COMPUTING↗

User-Centric Communication With Aerial Network for 6G: A Reinforcement Learning Approach

Meeting the diverse needs of user verticals requires innovative cellular architectures that can offer additional degrees of freedom to provide on-demand services. The terrestrial user-centric radio access network (UC-RAN) stands out as an excellent choice for this purpose. However, a drawback of UC-RAN is its tendency to prioritize high-priority verticals, often resulting in a subpar quality of experience for low-priority verticals. This issue is particularly exacerbated in hotspot areas. Here, to address this problem, we introduce an aerial network integrated with terrestrial UC-RAN to provide coverage to users which are not served by the terrestrial network. Furthermore, we analyze the impact of key configuration and optimization parameters (COPs), such as location, transmit power, altitude, and beamwidth of aerial base stations (ABSs) on system key performance indicators (KPIs), such as coverage, latency satisfaction, average spectral efficiency, and energy efficiency. We formulate a robust multiobjective function to maximize these KPIs without biasing toward any specific KPI(s). Finally, we propose a deep reinforcement learning optimization framework based on the state-of-the-art soft actor-critic algorithm to control ABS COPs and optimize system KPIs. Experimental evaluations demonstrate that the proposed optimization framework can converge to near-optimal solutions derived from the pseudo brute force in a few thousand epochs.

6G↗