Search NASA⌕ Search

SEARCH · Search NASA

Results for “particle swarm”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

Particle Swarm Optimization Toolbox

The Particle Swarm Optimization Toolbox is a library of evolutionary optimization tools developed in the MATLAB environment. The algorithms contained in the library include a genetic algorithm (GA), a single-objective particle swarm optimizer (SOPSO), and a multi-objective particle swarm optimizer (MOPSO). Development focused on both the SOPSO and MOPSO. A GA was included mainly for comparison purposes, and the particle swarm optimizers appeared to perform better for a wide variety of optimization problems. All algorithms are capable of performing unconstrained and constrained optimization. The particle swarm optimizers are capable of performing single and multi-objective optimization. The SOPSO and MOPSO algorithms are based on swarming theory and bird-flocking patterns to search the trade space for the optimal solution or optimal trade in competing objectives. The MOPSO generates Pareto fronts for objectives that are in competition. A GA, based on Darwin evolutionary theory, is also included in the library. The GA consists of individuals that form a population in the design space. The population mates to form offspring at new locations in the design space. These offspring contain traits from both of the parents. The algorithm is based on this combination of traits from parents to hopefully provide an improved solution than either of the original parents. As the algorithm progresses, individuals that hold these optimal traits will emerge as the optimal solutions. Due to the generic design of all optimization algorithms, each algorithm interfaces with a user-supplied objective function. This function serves as a "black-box" to the optimizers in which the only purpose of this function is to evaluate solutions provided by the optimizers. Hence, the user-supplied function can be numerical simulations, analytical functions, etc., since the specific detail of this function is of no concern to the optimizer. These algorithms were originally developed to support entry trajectory and guidance design for the Mars Science Laboratory mission but may be applied to any optimization problem.

Grant, Michael J.↗
NASA NTRS2002

Particle Swarm Optimization

The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of the algorithm, Results of numerical experiments for both continuous and discrete applications are presented in the paper. The results indicate that the particle swarm optimization algorithm does locate the constrained minimum design in continuous applications with very good precision, albeit at a much higher computational cost than that of a typical gradient based optimizer. However, the true potential of particle swarm optimization is primarily in applications with discrete and/or discontinuous functions and variables. Additionally, particle swarm optimization has the potential of efficient computation with very large numbers of concurrently operating processors.

Venter, Gerhard↗
NASA NTRS2005

A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.

Venter, Gerhard↗
NASA NTRS2002

Multidisciplinary Optimization of a Transport Aircraft Wing using Particle Swarm Optimization

The purpose of this paper is to demonstrate the application of particle swarm optimization to a realistic multidisciplinary optimization test problem. The paper's new contributions to multidisciplinary optimization is the application of a new algorithm for dealing with the unique challenges associated with multidisciplinary optimization problems, and recommendations as to the utility of the algorithm in future multidisciplinary optimization applications. The selected example is a bi-level optimization problem that demonstrates severe numerical noise and has a combination of continuous and truly discrete design variables. The use of traditional gradient-based optimization algorithms is thus not practical. The numerical results presented indicate that the particle swarm optimization algorithm is able to reliably find the optimum design for the problem presented here. The algorithm is capable of dealing with the unique challenges posed by multidisciplinary optimization as well as the numerical noise and truly discrete variables present in the current example problem.

Sobieszczanski-Sobieski, Jaroslaw↗
DOE OSTI2025

Accelerating the Structure Exploration of Diverse Bi–Pt Nanoclusters via Physics‐Informed Machine Learning Potential and Particle Swarm Optimization

Bimetallic Bi–Pt nanoclusters exhibit diverse structural motifs, including core-shell, Janus, and mixed alloy configurations, due to the unique bonding characteristics between Bi and Pt atoms. Using density functional theory refinements from ChIMES physically machine-learned potential and CALYPSO particle swarm optimization global searches, 34 Bi20-Pt20 nanoclusters are systematically classified. The results reveal that Bi atoms predominantly occupy surface sites, driven by charge transfer effects. Cohesive energy trends alone prove insufficient for structure differentiation, necessitating a data-driven approach employing principal component analysis and K-means clustering. Furthermore, vibrational, electronic, and infrared spectral analyses provide additional insights into structure-property relationships. The findings offer an original framework for the automated classification and analysis of bimetallic nanoclusters, enhancing the understanding of their stability and functional properties.

bimetallic nanoparticles↗
DOE OSTI2024

Self‐Potential Tomography Preconditioned by Particle Swarm Optimization—Application to Monitoring Hyporheic Exchange in a Bedrock River

Abstract A self‐potential (SP) data‐inversion algorithm was developed and tested on an analytical model of electrical‐potential profile data attributed to single and multiple polarized electrical sources. The developed algorithm was then validated by an application to SP‐monitoring field data measured on the floodplain of East Fork Poplar Creek, Oak Ridge, Tennessee, to image electrical sources in areas conducive to preferential flow into the flood plain from the bedrock‐lined riverbed. The algorithm combined stochastic source‐localization by particle‐swarm‐optimization (PSO) of electrical sources characterized by simplified geometries with source tomography by regularized weighted least‐squares minimization of a quadratic objective function. Prior information was incorporated by preconditioning the tomography algorithm by PSO results. Variable percentages of random noise were added to analytical‐model data to evaluate the algorithm performance. Results indicated that true parameters of single‐source models were inverted and approximated with small residual error, whereas inversion of analytical‐model data representing multiple electrical sources accurately approximated the locations of the sources but miscalculated some parameters because of the non‐uniqueness of the inverse‐model solution. Source tomography applied to analytical model data during testing produced a spatially continuous parameter field that identified the locations of point‐scale synthetic dipole sources of electrical current flow with varying degrees of accuracy depending on the prior information incorporated into the tomography. When applied to SP‐monitoring field data, the algorithm imaged electrical sources within a known fault that intersects the bedrock riverbed and flood plain of East Fork Poplar Creek and depicted dynamic electrical conditions attributed to hyporheic exchange.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Enhancing Camera Calibration for Traffic Surveillance with an Integrated Approach of Genetic Algorithm and Particle Swarm Optimization

Recent advancements in sensor technologies, coupled with signal processing and machine learning, have enabled real-time traffic control systems to effectively adapt to changing traffic conditions. Cameras, as sensors, offer a cost-effective means to determine the number, location, type, and speed of vehicles, aiding decision-making at traffic intersections. However, the effective use of cameras for traffic surveillance requires proper calibration. This paper proposes a new optimization-based method for camera calibration. In this approach, initial calibration parameters are established using the Direct Linear Transformation (DLT) method. Then, optimization algorithms are applied to further refine the calibration parameters for the correction of nonlinear lens distortions. A significant enhancement in the optimization process is achieved through the integration of the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) into a combined Integrated GA and PSO (IGAPSO) technique. The effectiveness of this method is demonstrated through the calibration of eleven roadside cameras at three different intersections. The experimental results show that when compared to the baseline DLT method, the vehicle localization error is reduced by 22.30% with GA, 22.31% with PSO, and 25.51% with IGAPSO.

47 OTHER INSTRUMENTATION↗
DOE OSTI2026

Applying Particle Swarm Optimization and Extended Kalman Filtering to Model Kaplan Generation Dynamics for Hydropower Systems

Variable renewable generation is increasing the need for hydropower plants to provide fast and flexible grid support, which places new demands on plant-level dynamic models used for monitoring, control, and operational decision-making. This need is especially important for hydroelectric systems, where turbine and generator dynamics are strongly coupled, nonlinear, and time-varying, making accurate real-time representation difficult. To address this problem, this paper develops a digital twin (DT) framework for a synchronous generator–Kaplan turbine system using an explicit separation of slow turbine dynamics and fast generator dynamics. The turbine subsystem is represented by a six-coefficient model, whose parameters are identified offline using particle swarm optimization, while the generator subsystem is updated online through an extended Kalman filter for real-time state and parameter estimation. These models are integrated within a closed-loop simulation that includes a proportional–integral–derivative–double-derivative governor and excitation system, allowing the DT to track plant behavior under realistic operating conditions. Unlike prior studies that treat turbine and generator modeling separately or rely mainly on simulated inputs, the proposed framework is validated using real operational data from a hydropower plant. Results show that the DT reproduces terminal voltage, active power, and reactive power with a normalized root mean square error of approximately 5%. This hybrid offline–online formulation constitutes the main contribution of the work, providing an adaptive and practically deployable DT for hydropower systems with direct relevance to control improvement, performance monitoring, and grid-support applications under high renewable penetration.

13 HYDRO ENERGY↗
DOE OSTI2025

Particle Swarm Optimization of Dynamic Load Model Parameters in Large Systems

This paper considers two dynamic load models that are widely used in industry to account for induction motor behavior: CMLD and CLOD. These models must be parametrized for the specific utility system in a general way so that they can be used in planning studies and provide a conservative but realistic representation of load behavior. This study considers a measurement-based approach to tuning both models. The load modeling study compares the response of the tuned models to generic candidate models using historical events. This study considers one area-based subsystem to simplify the modeling approach and reduce the number of models required for simulations. Additionally, because dynamic load models often produce similar results for different sets of parameters, a sensitivity study was conducted to assess the parameter impacts on the voltage response. The sensitivity study covers the parameters that are tuned using event measurements. The process to estimate the parameters uses the particle-swarm optimization algorithm. Overall, the performance of the tuned model more accurately captures recovery voltage, delayed recovery, and settling voltage than its predecessor models while not being overly tuned so that it remains general for peak summer conditions.

dynamic load modeling↗
NASA NTRS2013

Automatic Parameter Tuning for the Morpheus Vehicle Using Particle Swarm Optimization

A high fidelity simulation using a PC based Trick framework has been developed for Johnson Space Center's Morpheus test bed flight vehicle. There is an iterative development loop of refining and testing the hardware, refining the software, comparing the software simulation to hardware performance and adjusting either or both the hardware and the simulation to extract the best performance from the hardware as well as the most realistic representation of the hardware from the software. A Particle Swarm Optimization (PSO) based technique has been developed that increases speed and accuracy of the iterative development cycle. Parameters in software can be automatically tuned to make the simulation match real world subsystem data from test flights. Special considerations for scale, linearity, discontinuities, can be all but ignored with this technique, allowing fast turnaround both for simulation tune up to match hardware changes as well as during the test and validation phase to help identify hardware issues. Software models with insufficient control authority to match hardware test data can be immediately identified and using this technique requires very little to no specialized knowledge of optimization, freeing model developers to concentrate on spacecraft engineering. Integration of the PSO into the Morpheus development cycle will be discussed as well as a case study highlighting the tool's effectiveness.

Birge, B.↗
NASA NTRS2013

Surface Navigation Using Optimized Waypoints and Particle Swarm Optimization

The design priority for manned space exploration missions is almost always placed on human safety. Proposed manned surface exploration tasks (lunar, asteroid sample returns, Mars) have the possibility of astronauts traveling several kilometers away from a home base. Deviations from preplanned paths are expected while exploring. In a time-critical emergency situation, there is a need to develop an optimal home base return path. The return path may or may not be similar to the outbound path, and what defines optimal may change with, and even within, each mission. A novel path planning algorithm and prototype program was developed using biologically inspired particle swarm optimization (PSO) that generates an optimal path of traversal while avoiding obstacles. Applications include emergency path planning on lunar, Martian, and/or asteroid surfaces, generating multiple scenarios for outbound missions, Earth-based search and rescue, as well as human manual traversal and/or path integration into robotic control systems. The strategy allows for a changing environment, and can be re-tasked at will and run in real-time situations. Given a random extraterrestrial planetary or small body surface position, the goal was to find the fastest (or shortest) path to an arbitrary position such as a safe zone or geographic objective, subject to possibly varying constraints. The problem requires a workable solution 100% of the time, though it does not require the absolute theoretical optimum. Obstacles should be avoided, but if they cannot be, then the algorithm needs to be smart enough to recognize this and deal with it. With some modifications, it works with non-stationary error topologies as well.

Birge, Brian↗
DOE OSTI2024

Self-potential tomography preconditioned by particle swarm optimization—Self-potential monitoring and streamflow data acquired March 26–September 14, 2023 at East Fork Poplar Creek near Oak Ridge Tennessee

This data release contains self-potential (SP) monitoring data measured on the flood plain of East Fork Poplar Creek (East Fork) in Oak Ridge, Tennessee and streamflow data measured at streamgage EFK5.4 about 310 meters upstream from the SP monitoring site. Additionally, forward and inverse numerical modeling scripts used to model the electrical-potential field on the East Fork flood plain are provided. SP monitoring data included in this data release were measured at 39 different data-collection points on the east flood plain; 30 points were spaced 3-m apart along an 87-m profile parallel to the edge of the streambank, and 9 points were spaced 5-m apart along a 40-m profile approximately perpendicular to the streambank. The two profiles of SP data-collection points intersected at the approximate midpoint of the profile parallel to the streambank. Transient voltages were measured at each data-collection point every 60 seconds between 16:13 Eastern Standard Time (EST) on March 26, 2023, and 11:41 EST on September 14, 2023. Streamflow data included in this data release overlap the time-period of self-potential monitoring and were measured every 900 seconds between 16:23 on March 26, 2023, and 23:53 on September 14, 2023.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1985

Thickness of the particle swarm in cosmic ray air showers

The average dispersion in arrival time of air shower particles detected with a scintillator at an impact parameter r is described with accuracy 5-10% by the empirical formula sigma = Sigma sub to (1+r/r sub t) sup b, where Sigma sub to = 2.6 ns, r sub t = 30m and b = (1.94 + or - .08) (0.39 + or - .06) sec Theta, for r 2 km, 10 to the 8th power E 10 to the 11th power GeV, and Theta 60 deg. (E is the primary energy and theta is the zenith angle). The amount of fluctuation in sigma sub t due to fluctuations in the level of origin and shower development is less than 20%. These results provide a basis for estimating the impact parameters of very larger showers with data from very small detector arrays (mini-arrays). The energy of such showers can then be estimated from the local particle density. The formula also provides a basis for estimating the angular resolution of air shower array-telescopes.

Linsley, J.↗
DOE OSTI2022

Hybrid Particle Swarm-Interpolation Algorithm for Improved Critical Experiment Design

The typical goal of designing a critical experiment is twofold: a system that is both critical and optimized for some other value. This value could be an energy-integrated sensitivity, percent fissions in a certain energy range, or some other value that can be calculated by a transport code. By simulating different combinations of reflector, moderator, and fuel thicknesses a designer can identify such a desirable configuration. The domain of all possible combinations of these thicknesses is referred to as the experiment search space. As more dimensions are added, the search space increases in size exponentially. For a three-dimensional case, which includes three thickness values between zero and ten centimeters to the nearest tenth of a millimeter, a total of 1,000 3 , configurations exists. Rather than check each configuration individually, which would be extremely computationally expensive, it has been shown to be more efficient to use a conventional particle swarm optimization (PSO) algorithm to identify critical and optimal configurations. This work presents the theory and implementation of a novel hybrid PSO interpolation algorithm to perform these optimizations faster than a conventional PSO algorithm. To demonstrate this, an example optimization will be carried out by the conventional and hybrid PSO algorithms and their performances will be compared.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Optimization Algorithm for Criticality Experiment Design Using Whisper

Many criticality experiments performed to aid in nuclear data evaluation are designed to maximize the sensitivity of the system’s effective neutron multiplication factor to a certain nuclide reaction pair over an energy region of interest. This is typically done by evaluating possible designs in a transport code such as MCNP and selecting the one with the highest desired sensitivity. A designer has many tools to try to maximize this sensitivity such as different moderators, reflectors, fuels, and geometries. This balancing act of identifying a critical and maximally sensitive system become very computationally expensive as more variables are added and higher precisions are desired. In order to identify these optimal configurations more efficiently a Particle Swarm Optimization (PSO) algorithm coupled with MCNP has been developed by Los Alamos National Laboratory (LANL). This algorithm has been used to design two upcoming criticality experiments that will be performed at the National Criticality Experiments Research Center (NCERC), located at the Nevada National Security Site, and operated by LANL, the only general-purpose critical experiments laboratory in the United States. PSO uses a population (swarm) of candidate solutions (particles) on a search space of dimensions such as moderator and reflector thicknesses or enrichments and concentrations. These particles move around the search space from generation to generation according to simple rules. Eventually, the swarm converges on the configuration that is both critical and maximally sensitive to a piece of nuclear data. PSO is well suited for criticality experiments as the algorithm is agnostic to the underlying physics, meaning it is effective on many different experimental setups. This algorithm has been modified to maximize the nuclear data similarity coefficient between an application case and an experiment aimed at replicating the application case using WHISPER, a nuclear criticality safety analysis tool. This allows for the efficient design of critical experiments informed by nuclear data sensitives.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2024

Harnessing Collaborative Learning Automata to Guide Multi-objective Optimization based Inverse Analysis for Structural Damage Identification

Structural damage identification based on physical models is often transformed into an optimization problem that minimizes the difference between measurement information of structure being monitored and the model prediction in the parametric space. However, the objective function in this context often exhibits multimodality, involving high-dimensional variables due to the reliance on finite element models for damage identification. These features pose challenges to optimization algorithms, where entrapment in local solutions can lead to false positives and false negatives in damage identification. In this research, we propose a reinforcement learning based multi-swarm optimizer to tackle such challenges in pursuit of a small yet diverse solution set that can capture the true damage scenario as one of the solutions. The proposed method leverages the flexibility of the particle swarm optimizer and incorporates novel strategies of metaheuristics to realize targeted improvement. To enable the particle swarm to adaptively select the appropriate search strategy based on the current environment, we adopt the learning automata technique, which sidesteps the need for reward strategy selection that is usually ad hoc at each step of the search. The integration harnesses the automatic learning and self-adaptation capabilities of learning automata, enabling the particles to navigate based on environmental signals. This leads to accumulated probabilities tied to advantageous movements, fostering an adaptive exploration of particles in the search space. The proposed approach is first validated through implementing into benchmark test cases with comparisons. It is then applied to structural damage identification with piezoelectric admittance experimental signals. `The results highlight the capability of the algorithm to identify a small solution set with high accuracy to match the actual damage scenario.

Yang Zhang↗
DOE OSTI2025

Hydrogen-Battery Hybrid Energy System on Repurposed Offshore Platforms for Efficient Clean-Energy Transition

Due to the rising global energy demand and enhanced awareness of the environmental impact of fossil fuels, the Gulf of Mexico, traditionally known for oil extraction, offers a distinct chance to repurpose the existing offshore infrastructure. With the depletion of oil reserves, it is feasible to adapt previously utilized floating platforms for extraction to generate renewable energy, specifically through wind-generated power and hydrogen production. This adaptation seeks to promote a transport system that is more ecologically friendly in the future. Offshore wind turbines serve as the main energy source, with help from battery storage and hydrogen production to enhance the overall system performance, hydrogen creation, fuel, and electricity delivery for sustainable energy production. The system is divided into two distinct cases, each evaluated for cost, performance, and feasibility, with a focus on minimizing both the Levelized Cost of Energy (LCOE) and the Levelized Cost of Hydrogen (LCOH). The first case examines the integration of offshore wind turbines with hydrogen production. Excess electricity generated by wind turbines is directed toward hydrogen production via electrolysis. The hydrogen produced can be used as fuel for vehicles or transported to the shore via pipelines. The second case investigates a technology that combines wind turbines with battery storage. The batteries possess an ability to supply electricity for a continuous duration of 4 hours maximum each day. The main objective is to reduce the LCOE by considering the battery's charging and discharging cycles, together with the uncertain attributes of wind power and battery deterioration. The produced energy can be distributed for onshore applications or utilized for the purpose of offsetting offshore loads such as subsea oil and gas production, transportation, etc. The offshore hydrogen-battery hybrid system is improved via three advanced algorithms, Particle Swarm Optimization (PSO), and Grey Wolf Optimizer (GWO). In Case 1, PSO improves hydrogen production by efficiently managing the electrolyzer’s power consumption, decreasing production costs significantly. Particle Swarm Optimization (PSO) is applied to improve the efficiency of the electrolyzer, reducing production costs and achieving an optimized CAPEX of $240.00 million (from an initial $300.00 million) and OPEX of $9.60 million per year. This system produces 4,720,000 kg of hydrogen annually, with a Levelized Cost of Hydrogen (LCOH) of $6.40/kg and an annual profit of $9.27 million. In Case 2, GWO effectively reduces the overall energy cost by improving the charge-discharge management of batteries, which extends battery life and optimizes their use. The second case focuses on integrating battery storage, optimized using the Grey Wolf Optimizer (GWO), which enhances battery charge-discharge cycles, extending battery life and lowering costs. This system achieves an optimized CAPEX of $204.80 million (from an initial $256.00 million) and OPEX of $9.29 million per year, producing 310883.39 MWh of electricity annually at a Levelized Cost of Energy (LCOE) of $86.13/MWh, with an annual profit of $6.25 million. The implementation of a comprehensive strategy results in a substantial reduction in costs, improved energy efficiency, and a dependable supply of both electric power and hydrogen, emphasizing the benefits of converting offshore oil platforms for clean energy transition. This study explores a clean strategy to enable cost-effective repurposing of offshore O&G platforms. Both cases highlight the economic and technical feasibility of transitioning offshore oil platforms to clean energy systems, demonstrating substantial cost reductions and reliable energy and hydrogen supplies for sustainable energy production.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Equation of State Optimization and Uncertainty Quantization: Implementation in the LANL EOS Production Code OpenSesame

We detail the approaches of particle swarm optimization and Bayesian inference through Markov chain Monte Carlo for equation of state development. This work includes formulation of the modeling for the equation of state, numeric optimization of the parametric models via particle swarm optimization, and generation of probability distributions of equations of state from Markov chain Monte Carlo.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗