• Title/Summary/Keyword: particle swarm

Search Result 728, Processing Time 0.023 seconds

Design of Fractional Order Controller Based on Particle Swarm Optimization

  • Cao, Jun-Yi;Cao, Bing-Gang
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.6
    • /
    • pp.775-781
    • /
    • 2006
  • An intelligent optimization method for designing Fractional Order PID(FOPID) controllers based on Particle Swarm Optimization(PSO) is presented in this paper. Fractional calculus can provide novel and higher performance extension for FOPID controllers. However, the difficulties of designing FOPID controllers increase, because FOPID controllers append derivative order and integral order in comparison with traditional PID controllers. To design the parameters of FOPID controllers, the enhanced PSO algorithms is adopted, which guarantee the particle position inside the defined search spaces with momentum factor. The optimization performance target is the weighted combination of ITAE and control input. The numerical realization of FOPID controllers uses the methods of Tustin operator and continued fraction expansion. Experimental results show the proposed design method can design effectively the parameters of FOPID controllers.

Feasibility study of improved particle swarm optimization in kriging metamodel based structural model updating

  • Qin, Shiqiang;Hu, Jia;Zhou, Yun-Lai;Zhang, Yazhou;Kang, Juntao
    • Structural Engineering and Mechanics
    • /
    • v.70 no.5
    • /
    • pp.513-524
    • /
    • 2019
  • This study proposed an improved particle swarm optimization (IPSO) method ensemble with kriging model for model updating. By introducing genetic algorithm (GA) and grouping strategy together with elite selection into standard particle optimization (PSO), the IPSO is obtained. Kriging metamodel serves for predicting the structural responses to avoid complex computation via finite element model. The combination of IPSO and kriging model shall provide more accurate searching results and obtain global optimal solution for model updating compared with the PSO, Simulate Annealing PSO (SimuAPSO), BreedPSO and PSOGA. A plane truss structure and ASCE Benchmark frame structure are adopted to verify the proposed approach. The results indicated that the hybrid of kriging model and IPSO could serve for model updating effectively and efficiently. The updating results further illustrated that IPSO can provide superior convergent solutions compared with PSO, SimuAPSO, BreedPSO and PSOGA.

A combustion control modeling of coke oven by Swarm-based fuzzy system (스왐기반 퍼지시스템을 이용한 코크오븐 연소제어 모델링)

  • Ko, Ean-Tae;Hwang, Seok-Kyun;Lee, Jin-S.
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.493-495
    • /
    • 2005
  • This paper proposes a swarm-based fuzzy system modeling technique for coke oven combustion control diagnosis. The coke plant produces coke for the blast furnace plant in steel making process by charging coal into oven and supplying gas to carbonize it. A conventional mathematical model for coke oven combustion control has been used to control the amount of gas input, but it does not work well because of highly nonlinear feature of coke plant. To solve this problem, swarm-based fuzzy system modeling technique is suggested to construct a diagnosis model of coke oven combustion control. Based on the measured input-output data pairs, the fuzzy rules are generated and the parameters are tuned by the PSO(Particle Swarm Optimizer) to increase the accuracy of the fuzzy system is operated. This system computes the proper amount of gas input taking the operation conditions of coke oven into account, and compares the computed result with the supplied gas input.

  • PDF

Prolong life-span of WSN using clustering method via swarm intelligence and dynamical threshold control scheme

  • Bao, Kaiyang;Ma, Xiaoyuan;Wei, Jianming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.6
    • /
    • pp.2504-2526
    • /
    • 2016
  • Wireless sensors are always deployed in brutal environments, but as we know, the nodes are powered only by non-replaceable batteries with limited energy. Sending, receiving and transporting information require the supply of energy. The essential problem of wireless sensor network (WSN) is to save energy consumption and prolong network lifetime. This paper presents a new communication protocol for WSN called Dynamical Threshold Control Algorithm with three-parameter Particle Swarm Optimization and Ant Colony Optimization based on residual energy (DPA). We first use the state of WSN to partition the region adaptively. Moreover, a three-parameter of particle swarm optimization (PSO) algorithm is proposed and a new fitness function is obtained. The optimal path among the CHs and Base Station (BS) is obtained by the ant colony optimization (ACO) algorithm based on residual energy. Dynamical threshold control algorithm (DTCA) is introduced when we re-select the CHs. Compared to the results obtained by using APSO, ANT and I-LEACH protocols, our DPA protocol tremendously prolongs the lifecycle of network. We observe 48.3%, 43.0%, and 24.9% more percentages of rounds respectively performed by DPA over APSO, ANT and I-LEACH.

Improved AP Deployment Optimization Scheme Based on Multi-objective Particle Swarm Optimization Algorithm

  • Kong, Zhengyu;Wu, Duanpo;Jin, Xinyu;Cen, Shuwei;Dong, Fang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.4
    • /
    • pp.1568-1589
    • /
    • 2021
  • Deployment of access point (AP) is a problem that must be considered in network planning. However, this problem is usually a NP-hard problem which is difficult to directly reach optimal solution. Thus, improved AP deployment optimization scheme based on swarm intelligence algorithm is proposed to research on this problem. First, the scheme estimates the number of APs. Second, the multi-objective particle swarm optimization (MOPSO) algorithm is used to optimize the location and transmit power of APs. Finally, the greedy algorithm is used to remove the redundant APs. Comparing with multi-objective whale swarm optimization algorithm (MOWOA), particle swarm optimization (PSO) and grey wolf optimization (GWO), the proposed deployment scheme can reduce AP's transmit power and improves energy efficiency under different numbers of users. From the experimental results, the proposed deployment scheme can reduce transmit power about 2%-7% and increase energy efficiency about 2%-25%, comparing with MOWOA. In addition, the proposed deployment scheme can reduce transmit power at most 50% and increase energy efficiency at most 200%, comparing with PSO and GWO.

Posture Optimization for a Humanoid Robot using Particle Swarm Optimization (PSO를 이용한 휴머노이드 로봇의 최적자세 생성)

  • Yun, JaeHum;Chien, Dang Van;Tin, Tran Trung;Kim, Jong-Wook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.4
    • /
    • pp.450-456
    • /
    • 2014
  • Humanoid robot is the most suitable robot platform for effective human and robot interaction. However, the robot's complicated body structure containing more than twenty joint actuators makes it difficult to generate stable and elaborate postures using the conventional inverse kinematic method. This paper proposes an alternative approach to generate difficult postures of touching an object placed in front of the foot by the left or right hand with its torso bent forward in single support phase using the fast computational optimization method, particle swarm optimization. The simulated postures are also applied to a commercial humanoid robot platform, which validates the feasibility of the proposed approach.

Observation of Bargaining Game using Co-evolution between Particle Swarm Optimization and Differential Evolution (입자군집최적화와 차분진화알고리즘 간의 공진화를 활용한 교섭게임 관찰)

  • Lee, Sangwook
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.11
    • /
    • pp.549-557
    • /
    • 2014
  • Recently, analysis of bargaining game using evolutionary computation is essential issues in field of game theory. In this paper, we observe a bargaining game using co-evolution between two heterogenous artificial agents. In oder to model two artificial agents, we use a particle swarm optimization and a differential evolution. We investigate algorithm parameters for the best performance and observe that which strategy is better in the bargaining game under the co-evolution between two heterogenous artificial agents. Experimental simulation results show that particle swarm optimization outperforms differential evolution in the bargaining game.

Optimal Design of a Planar-Type Antenna with a Reduced Number of Design Parameters Using Taguchi Method and Adaptive Particle Swarm Optimization

  • Lee, Jeong-Hyeok;Jang, Dong-Hyeok;Kim, Hyeong-Seok
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.6
    • /
    • pp.2019-2024
    • /
    • 2014
  • This paper presents a method to optimize the design of a planar-type antenna and reduce the number of design parameters for rapid computation. The electromagnetic characteristics of the structure are analyzed, and Taguchi method is used to identify critical design parameters. Adaptive particle swarm optimization, which has a faster convergence rate than particle swarm optimization, is used to achieve the design goal effectively. A compact dual-band USB dongle antenna is tested to verify the advantage of the proposed method. In this case, we can use only five selected geometrical parameters instead of eighteen to accelerate the optimization of the antenna design. The 10 dB bandwidth for return loss ranges from 2.3 GHz to 2.7 GHz and from 5.1 GHz to 5.9 GHz, covering all the WiBro, Bluetooth, WiMAX, and 802.11 b/g/n WLAN bands in both simulation and measurement. The optimization process enables the antenna design to achieve the required performance with fewer design parameters.

Cancer Prediction Based on Radical Basis Function Neural Network with Particle Swarm Optimization

  • Yan, Xiao-Bo;Xiong, Wei-Qing;Hu, Liang;Zhao, Kuo
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.18
    • /
    • pp.7775-7780
    • /
    • 2014
  • This paper addresses cancer prediction based on radial basis function neural network optimized by particle swarm optimization. Today, cancer hazard to people is increasing, and it is often difficult to cure cancer. The occurrence of cancer can be predicted by the method of the computer so that people can take timely and effective measures to prevent the occurrence of cancer. In this paper, the occurrence of cancer is predicted by the means of Radial Basis Function Neural Network Optimized by Particle Swarm Optimization. The neural network parameters to be optimized include the weight vector between network hidden layer and output layer, and the threshold of output layer neurons. The experimental data were obtained from the Wisconsin breast cancer database. A total of 12 experiments were done by setting 12 different sets of experimental result reliability. The findings show that the method can improve the accuracy, reliability and stability of cancer prediction greatly and effectively.

Modified Sub-aperture Stitching Algorithm using Image Sharpening and Particle Swarm Optimization

  • Chen, Yiwei;Miao, Erlong;Sui, Yongxin;Yang, Huaijiang
    • Journal of the Optical Society of Korea
    • /
    • v.18 no.4
    • /
    • pp.341-344
    • /
    • 2014
  • This study proposes a modified sub-aperture stitching algorithm, which uses an image sharpening algorithm and particle swarm optimization to improve the stitching accuracy. In sub-aperture stitching interferometers with high positional accuracy, the high-frequency components of measurements are more important than the low-frequency components when compensating for position errors using a sub-aperture stitching algorithm. Thus we use image sharpening algorithms to strengthen the high-frequency components of measurements. When using image sharpening algorithms, sub-aperture stitching algorithms based on the least-squares method easily become trapped at locally optimal solutions. However, particle swarm optimization is less likely to become trapped at a locally optimal solution, thus we utilized this method to develop a more robust algorithm. The results of simulations showed that our algorithm compensated for position errors more effectively than the existing algorithm. An experimental comparison with full aperture-testing results demonstrated the validity of the new algorithm.