Accelerating genetic optimization of nonlinear model predictive control by learning optimal search space size
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915108176789504 |
|---|---|
| author | Mostafa, Eslam Aly, Hussein A. Elliethy, Ahmed |
| author_facet | Mostafa, Eslam Aly, Hussein A. Elliethy, Ahmed |
| contents | Genetic algorithm (GA) is typically used to solve nonlinear model predictive control's optimization problem. However, the size of the search space in which the GA searches for the optimal control inputs is crucial for its applicability to fast-response systems. This paper proposes accelerating the genetic optimization of NMPC by learning optimal search space size. The approach trains a multivariate regression model to adaptively predict the best smallest size of the search space in every control cycle. The proposed approach reduces the GA's computational time, improves the chance of convergence to better control inputs, and provides a stable and feasible solution. The proposed approach was evaluated on three nonlinear systems and compared to four other evolutionary algorithms implemented in a processor-in-the-loop fashion. The results show that the proposed approach provides a 17-45\% reduction in computational time and increases the convergence rate by 35-47\%. The source code is available on GitHub. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_08094 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Accelerating genetic optimization of nonlinear model predictive control by learning optimal search space size Mostafa, Eslam Aly, Hussein A. Elliethy, Ahmed Optimization and Control Computational Complexity Neural and Evolutionary Computing Robotics Genetic algorithm (GA) is typically used to solve nonlinear model predictive control's optimization problem. However, the size of the search space in which the GA searches for the optimal control inputs is crucial for its applicability to fast-response systems. This paper proposes accelerating the genetic optimization of NMPC by learning optimal search space size. The approach trains a multivariate regression model to adaptively predict the best smallest size of the search space in every control cycle. The proposed approach reduces the GA's computational time, improves the chance of convergence to better control inputs, and provides a stable and feasible solution. The proposed approach was evaluated on three nonlinear systems and compared to four other evolutionary algorithms implemented in a processor-in-the-loop fashion. The results show that the proposed approach provides a 17-45\% reduction in computational time and increases the convergence rate by 35-47\%. The source code is available on GitHub. |
| title | Accelerating genetic optimization of nonlinear model predictive control by learning optimal search space size |
| topic | Optimization and Control Computational Complexity Neural and Evolutionary Computing Robotics |
| url | https://arxiv.org/abs/2305.08094 |