scholarly journals Research on Optimal Control for the Vehicle Suspension Based on the Simulated Annealing Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Jie Meng ◽  
Qingzhang Chen ◽  
Ren He
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Target Function ◽  
Lqr Control ◽  
Performance Indexes ◽  
Lqr Controller ◽  
Chassis Control ◽  
Annealing Algorithm ◽  
And Control ◽  
Suspension Performance

A method is designed to optimize the weight matrix of the LQR controller by using the simulated annealing algorithm. This method utilizes the random searching characteristics of the algorithm to optimize the weight matrices with the target function of suspension performance indexes. This method improves the design efficiency and control performance of the LQR control, and solves the problem of the LQR controller when defining the weight matrices. And a simulation is provided for vehicle active chassis control. The result shows that the active suspension using LQR optimized by the genetic algorithm compared to the chassis controlled by the normal LQR and the passive one, shows better performance. Meanwhile, the problem of defining the weight matrices is greatly solved.

scholarly journals Construction Method and Performance Analysis of Chaotic S-Box Based on a Memorable Simulated Annealing Algorithm

Symmetry ◽  
2020 ◽  
Vol 12 (12) ◽  
pp. 2115
Author(s):  
Juan Wang ◽  
Yangqing Zhu ◽  
Chao Zhou ◽  
Zhiming Qi
Keyword(s):  
Simulated Annealing ◽  
Block Cipher ◽  
Simulated Annealing Algorithm ◽  
Construction Method ◽  
Chaotic Mapping ◽  
Performance Indexes ◽  
Digital Chaos ◽  
The Matrix ◽  
Annealing Algorithm ◽  
And Performance

The substitution box (S-box) is the only nonlinear components in the symmetric block cipher. Its performance directly determines the security strength of the block cipher. With the dynamic characteristics degradation and the local periodic phenomenon of digital chaos, and the security problems caused by them becoming more and more prominent, how to efficiently generate an S-box with security guarantee based on chaos has gradually attracted the attention of cryptographers. In this paper, a chaotic S-box construction method is proposed based on a memorable simulated annealing algorithm (MSAA). The chaotic S-box set is produced by using the nonlinearity and randomness of the dynamic iteration of digital cascaded chaotic mapping. The composite objective function is constructed based on the analysis of the performance indexes of S-box. The MSAA is used to efficiently optimize the S-box set. The matrix segmentation and scrambling operations are carried out on the optimized S-box. The cryptographic performance of chaotic S-box is tested and analyzed, and compared with the mainstream chaotic S-box of the same kind. The results show that the S-box constructed in this paper can not only stably and efficiently generate chaotic S-box with better performance, but also make an effective exploration of the construction of chaotic S-boxes based on intelligent algorithms.

A New Solution for Maxterm Problem in Trigonometric Functions by Simulated Annealing Algorithm

2013 ◽  
Vol 4 (2) ◽  
pp. 20-28
Author(s):  
Farhad Soleimanian Gharehchopogh ◽  
Hadi Najafi ◽  
Kourosh Farahkhah
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Trigonometric Functions ◽  
Matlab Software ◽  
Annealing Algorithm ◽  
Do So

The present paper is an attempt to get total minimum of trigonometric Functions by Simulated Annealing. To do so the researchers ran Simulated Annealing. Sample trigonometric functions and showed the results through Matlab software. According the Simulated Annealing Solves the problem of getting stuck in a local Maxterm and one can always get the best result through the Algorithm.

Sign in / Sign up

Export Citation Format

Share Document