.png){kind=icon}
Return
A Robust Coevolutionary Neural-Based Optimization Algorithm for Constrained Nonconvex Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2022.3220806.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For nonconvex optimization problems, a routine is to assume that there is no perturbation when executing the solution task. Nevertheless, dealing with the perturbation in advance may increase the burden on the system and take up extra time. To remedy this weakness, we propose a robust coevolutionary neural-based optimization algorithm with inherent robustness based on the hybridization between the particle swarm optimization and a class of robust neural dynamics (RND). In this framework, every neural agent guided by the RND supersedes the place of the particle, mutually searches for the optimal solution, and stabilizes itself from different perturbations. The theoretical analysis ensures that the proposed algorithm is globally convergent with probability one. Besides, the effectiveness and robustness of the proposed approach are illustrated by illustrative examples compared with the existing methods. We further apply this proposed algorithm to the source localization and manipulability optimization of the redundant manipulator, simultaneously disposing of perturbation from the internal and exogenous system with satisfactory performance.
Keywords:
Coevolutionary neural-based optimization
non-convex optimization
redundant manipulator
robust neural dynamics (RND)
source localization
Journal
IF:
8.9
Papers:
7.6K
Citations:
7.2W
Organization
Cited Papers
DFT mechanistic studies on the epoxidation of cyclohexene by non-heme tetraaza manganese complexes
PREAI
ShareSave
ShareSave
ShareSaveShareSaveShareSaveA collective neurodynamic optimization approach to bound-constrained nonconvex optimization.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
ShareSave
View more