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.
In general, the Cooperative Coevolutionary Algorithms based on separability have shown good performance when solving high dimensional optimization problems. However, the number of function evaluations required for the decomposition stage of these algorithms can growth very fast, and depends on the dimensionality of the problem. In cases where a single function evaluation is computationally expensive...
Dynamic multi-objective optimisation problems have more than one objective with at least one objective that changes over time. Previous studies indicated that different knowledge sharing strategies increase the performance of the dynamic vector evaluated particle swarm optimisation (DVEPSO) algorithm in different dynamic environments. Therefore, this paper investigates the performance of the DVEPSO...
In this paper, we propose the idea of hybrid cooperative co-evolution (hCC). In CC, multiple instances of the same evolutionary algorithm work in parallel, each optimizes a different subset of the problem in hand. In recent years, different approaches have been introduced to divide the problem variables into separate groups based on the property of separability. The idea is that when dependent variables...
Bayesian networks are powerful probabilistic models that have been applied to a variety of tasks. When applied to classification problems, Bayesian networks have shown competitive performance when compared to other state-of-the-art classifiers. However, structure learning of Bayesian networks has been shown to be NP-Hard. In this paper, we propose a novel approximation algorithm for learning Bayesian...
In time-critical situations such as rescue missions, effective exploration is essential. Exploration of such unknown environments may be achieved through the dispersion of a swarm of robots. Recent research has turned to biology where pheromone trails provide a form of collective memory of visited areas. Rather than the attractive pheromones that have been the focus of much research, this paper considers...
In this paper, a SOM (self organizing map)-based approach to task assignment of multi-robots in 3-D dynamic environments is proposed. This approach intends to mimic the operating mechanism of biological neural systems, and integrates the advantages and characteristics of biological neural systems. It is capable of dynamically planning the paths of multi-robots in 3-D environments under uncertain situations,...
Particle Swarm Optimization uses noisy historical information to select potentially optimal function samples. Though information-theoretic principles suggest that less noise indicates greater certainty, PSO's momentum term is usually both the least informed and the most deterministic. This dichotomy suggests that while momentum has a profound impact on swarm diversity, it would benefit from a more...
Using only simple rules for local interactions, groups of agents can form self-organizing super-organisms or flocks that show global emergent behavior. When agents are also extended with memory and goals the resulting flock not only demonstrates emergent behavior, but also collective intelligence: the ability for the group to solve problems that might be beyond the ability of the individual alone...
A new variant of the competitive coevolutionary team-based particle swarm optimiser (CCPSO(t)) algorithm is developed to train multi-agent teams from zero knowledge. Analysis show that the CCPSO algorithm stagnates during the training of simple soccer players. It is hypothesised that the stagnation is caused by saturation of the neural network weights. The CCPSO(t) algorithm is developed to overcome...
Applying weight regularisation to gradient-descent based neural network training methods such as backpropagation was shown to improve the generalisation performance of a neural network. However, the existing applications of weight regularisation to particle swarm optimisation are very limited, despite being promising. This paper proposes adding a regularisation penalty term to the objective function...
Multi-Objective Problems (MOPs) presents two or more objective functions to be simultaneously optimized. MOPs presenting more than three objective functions are called Many-Objective Problems (MaOPs) and pose challenges to optimization algorithms. Multi-objective Particle Swarm Optimization (MOPSO) is a promising meta-heuristic to solve MaOPs. Previous works have proposed different leader selection...
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.