The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper provides a review of some main works and research progress in distributed optimal consensus problems of multi-agent systems. Classical and common methods in this area are summarized, such as Riccati design, adaptive dynamic programming and inverse optimal control. This paper detailedly addresses the design schemes of optimal consensus protocols by reviewing several typical literatures....
In this paper, a novel firefly algorithm (FA) is presented to reduce the dependency on parameters. The new FA algorithm is called dynamic step factor based FA (DSFFA), in which the step factor is not fixed and it is dynamically updated during the evolution. Experimental study on several classical benchmark functions show that DSFFA is superior to the basic FA and three other FAs.
Differential evolution (DE) is a well-known algorithm for global optimization over continuous search spaces. However, choosing the optimal control parameters is a challenging task because they are problem oriented. In order to minimize the effects of the control parameters, a Gaussian bare-bones DE (GBDE) and its modified version (MGBDE) are proposed which are almost parameter free. To verify the...
Particle swarm optimization and its modifications appear premature convergence for complex optimization problem, because particles' performance becomes same in seeking later period. In this paper, a new model is proposed to avoiding particles' performance same and possessing strong exploration capacity. Considering exploration and exploitation capacity diverse in different stage, the particle swarm...
Particle swarm optimization and its modification for two sub-swarms exchange appear premature convergence for complex optimization problem, because particles' performance becomes same in seeking later period. Therefore, in this paper, a modified two sub-swarms exchange particle swarm optimization is proposed. The particle swarm is divided into two identical sub-swarms, with the first adopting the...
In this paper, a Two Sub-swarms Quantum-behaved Particle Swarm Optimization Algorithm Based on Exchange Strategy (TS-QPSO) is proposed. Two sub-swarms of particles with quantum Behavior are set up in TS-QPSO. Once the whole swarm falls into local optima and the best value of the global swarm is not improved after the allowable iterations, the exchange strategy will be carried out. The amount of exchange...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.