Real-Time Evolutionary Algorithms for Constrained Predictive Control

10.5772/5452 ◽  
2008 ◽  
Author(s):  
Mario Luca ◽  
Antonio Ficola ◽  
Michele La
Keyword(s):  
Evolutionary Algorithms ◽  
Real Time ◽  
Predictive Control

scholarly journals An Adaptive RBF-NMPC Architecture for Trajectory Tracking Control of Underwater Vehicles

Machines ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 105
Author(s):  
Zhenzhong Chu ◽  
Da Wang ◽  
Fei Meng
Keyword(s):  
Model Predictive Control ◽  
Prediction Model ◽  
Real Time ◽  
Predictive Control ◽  
Trajectory Tracking ◽  
Tracking Control ◽  
Working Environment ◽  
Gray Wolf ◽  
Trajectory Tracking Control ◽  
System Output

An adaptive control algorithm based on the RBF neural network (RBFNN) and nonlinear model predictive control (NMPC) is discussed for underwater vehicle trajectory tracking control. Firstly, in the off-line phase, the improved adaptive Levenberg–Marquardt-error surface compensation (IALM-ESC) algorithm is used to establish the RBFNN prediction model. In the real-time control phase, using the characteristic that the system output will change with the external environment interference, the network parameters are adjusted by using the error between the system output and the network prediction output to adapt to the complex and uncertain working environment. This provides an accurate and real-time prediction model for model predictive control (MPC). For optimization, an improved adaptive gray wolf optimization (AGWO) algorithm is proposed to obtain the trajectory tracking control law. Finally, the tracking control performance of the proposed algorithm is verified by simulation. The simulation results show that the proposed RBF-NMPC can not only achieve the same level of real-time performance as the linear model predictive control (LMPC) but also has a superior anti-interference ability. Compared with LMPC, the tracking performance of RBF-NMPC is improved by at least 43% and 25% in the case of no interference and interference, respectively.

scholarly journals Comparison of Searching Behaviour of Three Evolutionary Algorithms Applied to Water Distribution System Design Optimization

Water ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 695 ◽  
Author(s):  
Weiwei Bi ◽  
Yihui Xu ◽  
Hongyu Wang
Keyword(s):  
Evolutionary Algorithms ◽  
Real Time ◽  
Distribution System ◽  
Optimization Design ◽  
Distribution Systems ◽  
Water Distribution ◽  
Optimal Solutions ◽  
Great Ability ◽  
Searching Behaviour ◽  
Run Time

Over the past few decades, various evolutionary algorithms (EAs) have been applied to the optimization design of water distribution systems (WDSs). An important research area is to compare the performance of these EAs, thereby offering guidance for the selection of the appropriate EAs for practical implementations. Such comparisons are mainly based on the final solution statistics and, hence, are unable to provide knowledge on how different EAs reach the final optimal solutions and why different EAs performed differently in identifying optimal solutions. To this end, this paper aims to compare the real-time searching behaviour of three widely used EAs, which are genetic algorithms (GAs), the differential evolution (DE) algorithm and the ant colony optimization (ACO). These three EAs are applied to five WDS benchmarking case studies with different scales and complexities, and a set of five metrics are used to measure their run-time searching quality and convergence properties. Results show that the run-time metrics can effectively reveal the underlying searching mechanisms associated with each EA, which significantly goes beyond the knowledge from the traditional end-of-run solution statistics. It is observed that the DE is able to identify better solutions if moderate and large computational budgets are allowed due to its great ability in maintaining the balance between the exploration and exploitation. However, if the computational resources are rather limited or the decision has to be made in a very short time (e.g., real-time WDS operation), the GA can be a good choice as it can always identify better solutions than the DE and ACO at the early searching stages. Based on the results, the ACO performs the worst for the five case study considered. The outcome of this study is the offer of guidance for the algorithm selection based on the available computation resources, as well as knowledge into the EA’s underlying searching behaviours.

Sign in / Sign up

Export Citation Format

Share Document