• Title/Summary/Keyword: particle swarm

Search Result 723, Processing Time 0.031 seconds

Structural Damage Detection Using Swarm Intelligence and Model Updating Technique (군집지능과 모델개선기법을 이용한 구조물의 결함탐지)

  • Choi, Jong-Hun;Koh, Bong-Hwan
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.19 no.9
    • /
    • pp.884-891
    • /
    • 2009
  • This study investigates some of swarm intelligence algorithms to tackle a traditional damage detection problem having stiffness degradation or damage in mechanical structures. Particle swarm(PSO) and ant colony optimization(ACO) methods have been exploited for localizing and estimating the location and extent damages in a structure. Both PSO and ACO are population-based, stochastic algorithms that have been developed from the underlying concept of swarm intelligence and search heuristic. A finite element (FE) model updating is implemented to minimize the difference in a set of natural frequencies between measured and baseline vibration data. Stiffness loss of certain elements is considered to simulate structural damages in the FE model. It is numerically shown that PSO and ACO algorithms successfully completed the optimization process of model updating in locating unknown damages in a truss structure.

A Task Offloading Approach using Classification and Particle Swarm Optimization (분류와 Particle Swarm Optimization을 이용한 태스크 오프로딩 방법)

  • Mateo, John Cristopher A.;Lee, Jaewan
    • Journal of Internet Computing and Services
    • /
    • v.18 no.1
    • /
    • pp.1-9
    • /
    • 2017
  • Innovations from current researches on cloud computing such as applying bio-inspired computing techniques have brought new level solutions in offloading mechanisms. With the growing trend of mobile devices, mobile cloud computing can also benefit from applying bio-inspired techniques. Energy-efficient offloading mechanisms on mobile cloud systems are needed to reduce the total energy consumption but previous works did not consider energy consumption in the decision-making of task distribution. This paper proposes the Particle Swarm Optimization (PSO) as an offloading strategy of cloudlet to data centers where each task is represented as a particle during the process. The collected tasks are classified using K-means clustering on the cloudlet before applying PSO in order to minimize the number of particles and to locate the best data center for a specific task, instead of considering all tasks during the PSO process. Simulation results show that the proposed PSO excels in choosing data centers with respect to energy consumption, while it has accumulated a little more processing time compared to the other approaches.

Improved Particle Swarm Optimization Algorithm for Adaptive Beam Forming System (적응형 빔 형성 시스템을 위한 개선된 개체 군집 최적화 알고리즘)

  • Jung, Jin-Woo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.3
    • /
    • pp.587-592
    • /
    • 2018
  • An adaptive beam forming system using a phased array antenna improves communication quality by beam forming adaptively to a communication environment having an interference signal. For adaptive beam forming, a good combination of the phases of the excited signals to each radiating element of the phased array antenna should be calculated. In this paper, improved particle swarm optimization algorithm that adds a re-spreading procedure according to particle density was proposed to increase the probability of good phase shift combination output.

Automatic Mutual Localization of Swarm Robot Using a Particle Filter

  • Lee, Yang-Weon
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.4
    • /
    • pp.390-395
    • /
    • 2012
  • This paper describes an implementation of automatic mutual localization of swarm robots using a particle filter. Each robot determines the location of the other robots using wireless sensors. The measured data will be used for determination of the movement method of the robot itself. It also affects the other robots' self-arrangement into formations such as circles and lines. We discuss the problem of a circle formation enclosing a target that moves. This method is the solution for enclosing an invader in a circle formation based on mutual localization of the multi-robot without infrastructure. We use trilateration, which does require knowing the value of the coordinates of the reference points. Therefore, specifying the enclosure point based on the number of robots and their relative positions in the coordinate system. A particle filter is used to improve the accuracy of the robot's location. The particle filter is operates better for mutual location of robots than any other estimation algorithms. Through the experiments, we show that the proposed scheme is stable and works well in real environments.

Data Mining Approach Using Practical Swarm Optimization (PSO) to Predicting Going Concern: Evidence from Iranian Companies

  • Salehi, Mahdi;Fard, Fezeh Zahedi
    • Journal of Distribution Science
    • /
    • v.11 no.3
    • /
    • pp.5-11
    • /
    • 2013
  • Purpose - Going concern is one of fundamental concepts in accounting and auditing and sometimes the assessment of a company's going concern status that is a tough process. Various going concern prediction models' based on statistical and data mining methods help auditors and stakeholders suggested in the previous literature. Research design - This paper employs a data mining approach to prediction of going concern status of Iranian firms listed in Tehran Stock Exchange using Particle Swarm Optimization. To reach this goal, at the first step, we used the stepwise discriminant analysis it is selected the final variables from among of 42 variables and in the second stage; we applied a grid-search technique using 10-fold cross-validation to find out the optimal model. Results - The empirical tests show that the particle swarm optimization (PSO) model reached 99.92% and 99.28% accuracy rates for training and holdout data. Conclusions - The authors conclude that PSO model is applicable for prediction going concern of Iranian listed companies.

  • PDF

Hybrid PSO and SSO algorithm for truss layout and size optimization considering dynamic constraints

  • Kaveh, A.;Bakhshpoori, T.;Afshari, E.
    • Structural Engineering and Mechanics
    • /
    • v.54 no.3
    • /
    • pp.453-474
    • /
    • 2015
  • A hybrid approach of Particle Swarm Optimization (PSO) and Swallow Swarm Optimization algorithm (SSO) namely Hybrid Particle Swallow Swarm Optimization algorithm (HPSSO), is presented as a new variant of PSO algorithm for the highly nonlinear dynamic truss shape and size optimization with multiple natural frequency constraints. Experimentally validation of HPSSO on four benchmark trusses results in high performance in comparison to PSO variants and to those of different optimization techniques. The simulation results clearly show a good balance between global and local exploration abilities and consequently results in good optimum solution.

Design of 2-D IIR Digital Filters Based on a Particle Swam Optimization (Particle Swarm Optimization을 이용한 2차원 IIR 디지털필터의 설계)

  • Lee, Young-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.7
    • /
    • pp.1312-1320
    • /
    • 2009
  • This paper presents an efficient design method of 2-D infinite impulse response(IIR) digital filter based on a particle swarm optimization(PSO) algorithm. The design task is reformulated as a constrained minimization problem and is solved by our newly developed PSO algorithm. To ensure the stability of the designed 2-D IIR digital filters, a new stability strategy is embedded in the basic PSO algorithm. The superiority of the proposed method is demonstrated by several experiments. The results show that the approximation error of the resultant filters are better than those of the digital filters which designed by recently published filter design methods. The proposed design method can also obtain the stable2-D IIR digital filters.

A multi-layer approach to DN 50 electric valve fault diagnosis using shallow-deep intelligent models

  • Liu, Yong-kuo;Zhou, Wen;Ayodeji, Abiodun;Zhou, Xin-qiu;Peng, Min-jun;Chao, Nan
    • Nuclear Engineering and Technology
    • /
    • v.53 no.1
    • /
    • pp.148-163
    • /
    • 2021
  • Timely fault identification is important for safe and reliable operation of the electric valve system. Many research works have utilized different data-driven approach for fault diagnosis in complex systems. However, they do not consider specific characteristics of critical control components such as electric valves. This work presents an integrated shallow-deep fault diagnostic model, developed based on signals extracted from DN50 electric valve. First, the local optimal issue of particle swarm optimization algorithm is solved by optimizing the weight search capability, the particle speed, and position update strategy. Then, to develop a shallow diagnostic model, the modified particle swarm algorithm is combined with support vector machine to form a hybrid improved particle swarm-support vector machine (IPs-SVM). To decouple the influence of the background noise, the wavelet packet transform method is used to reconstruct the vibration signal. Thereafter, the IPs-SVM is used to classify phase imbalance and damaged valve faults, and the performance was evaluated against other models developed using the conventional SVM and particle swarm optimized SVM. Secondly, three different deep belief network (DBN) models are developed, using different acoustic signal structures: raw signal, wavelet transformed signal and time-series (sequential) signal. The models are developed to estimate internal leakage sizes in the electric valve. The predictive performance of the DBN and the evaluation results of the proposed IPs-SVM are also presented in this paper.

An Improvement of Particle Swarm Optimization with A Neighborhood Search Algorithm

  • Yano, Fumihiko;Shohdohji, Tsutomu;Toyoda, Yoshiaki
    • Industrial Engineering and Management Systems
    • /
    • v.6 no.1
    • /
    • pp.64-71
    • /
    • 2007
  • J. Kennedy and R. Eberhart first introduced the concept called as Particle Swarm Optimization (PSO). They applied it to optimize continuous nonlinear functions and demonstrated the effectiveness of the algorithm. Since then a considerable number of researchers have attempted to apply this concept to a variety of optimization problems and obtained reasonable results. In PSO, individuals communicate and exchange simple information with each other. The information among individuals is communicated in the swarm and the information between individuals and their swarm is also shared. Finally, the swarm approaches the optimal behavior. It is reported that reasonable approximate solutions of various types of test functions are obtained by employing PSO. However, if more precise solutions are required, additional algorithms and/or hybrid algorithms would be necessary. For example, the heading vector of the swarm can be slightly adjusted under some conditions. In this paper, we propose a hybrid algorithm to obtain more precise solutions. In the algorithm, when a better solution in the swarm is found, the neighborhood of a certain distance from the solution is searched. Then, the algorithm returns to the original PSO search. By this hybrid method, we can obtain considerably better solutions in less iterations than by the standard PSO method.