A Random Time-Varying Particle Swarm Optimization for the Real Time Location Systems

2008 ◽  
Vol 128 (12) ◽  
pp. 1747-1760 ◽  
Author(s):  
Hui Zhu ◽  
Yuji Tanabe ◽  
Takaaki Baba
2020 ◽  
Vol 39 (4) ◽  
pp. 5699-5711
Author(s):  
Shirong Long ◽  
Xuekong Zhao

The smart teaching mode overcomes the shortcomings of traditional teaching online and offline, but there are certain deficiencies in the real-time feature extraction of teachers and students. In view of this, this study uses the particle swarm image recognition and deep learning technology to process the intelligent classroom video teaching image and extracts the classroom task features in real time and sends them to the teacher. In order to overcome the shortcomings of the premature convergence of the standard particle swarm optimization algorithm, an improved strategy for multiple particle swarm optimization algorithms is proposed. In order to improve the premature problem in the search performance algorithm of PSO algorithm, this paper combines the algorithm with the useful attributes of other algorithms to improve the particle diversity in the algorithm, enhance the global search ability of the particle, and achieve effective feature extraction. The research indicates that the method proposed in this paper has certain practical effects and can provide theoretical reference for subsequent related research.


Author(s):  
Kun-Yung Chen ◽  
Te-Wen Tu

Abstract An inverse methodology is proposed to estimate a time-varying heat transfer coefficient (HTC) for a hollow cylinder with time-dependent boundary conditions of different kinds on inner and outer surfaces. The temperatures at both the inner surface and the interior domain are measured for the hollow cylinder, while the time history of HTC of the outer surface will be inversely determined. This work first expressed the unknown function of HTC in a general form with unknown coefficients, and then regarded these unknown coefficients as the estimated parameters which can be randomly searched and found by the self-learning particle swarm optimization (SLPSO) method. The objective function which wants to be minimized was found with the absolute errors between the measured and estimated temperatures at several measurement times. If the objective function converges toward the null, the inverse solution of the estimated HTC will be found eventually. From numerical experiments, when the function of HTC with exponential type is performed, the unknown coefficients of the HTC function can be accurately estimated. On the contrary, when the function of HTC with a general type is conducted, the unknown coefficients of HTC are poorly estimated. However, the estimated coefficients of an HTC function with the general type can be regarded as the equivalent coefficients for the real function of HTC.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Yong Ma ◽  
M. Zamirian ◽  
Yadong Yang ◽  
Yanmin Xu ◽  
Jing Zhang

We present one algorithm based on particle swarm optimization (PSO) with penalty function to determine the conflict-free path for mobile objects in four-dimension (three spatial and one-time dimensions) with obstacles. The shortest path of the mobile object is set as goal function, which is constrained by conflict-free criterion, path smoothness, and velocity and acceleration requirements. This problem is formulated as a calculus of variation problem (CVP). With parametrization method, the CVP is converted to a time-varying nonlinear programming problem (TNLPP). Constraints of TNLPP are transformed to general TNLPP without any constraints through penalty functions. Then, by using a little calculations and applying the algorithm PSO, the solution of the CVP is consequently obtained. Approach efficiency is confirmed by numerical examples.


Sign in / Sign up

Export Citation Format

Share Document