Abstract

Gravitational search algorithm (GSA) is a newly developed and promising algorithm based on the law of gravity and interaction between masses. This paper proposes an improved gravitational search algorithm (IGSA) to improve the performance of the GSA, and first applies it to the field of dynamic neural network identification. The IGSA uses trial-and-error method to update the optimal agent during the whole search process. And in the late period of the search, it changes the orbit of the poor agent and searches the optimal agent’s position further using the coordinate descent method. For the experimental verification of the proposed algorithm, both GSA and IGSA are testified on a suite of four well-known benchmark functions and their complexities are compared. It is shown that IGSA has much better efficiency, optimization precision, convergence rate and robustness than GSA. Thereafter, the IGSA is applied to the nonlinear autoregressive exogenous (NARX) recurrent neural network identification for a magnetic levitation system. Compared with the system identification based on gravitational search algorithm neural network (GSANN) and other conventional methods like BPNN and GANN, the proposed algorithm shows the best performance.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.