A comparison of predator teams with distinct genetic similarity levels in single prey hunting problem

Download

index.pdf

Date

2009

Author

Yalçın, Çağrı

Metadata

Show full item record

Item Usage Stats

103
views

40
downloads

In the domain of the complex control problems for agents, neuroevolution, i.e. artificial evolution of neural networks, methods have been continuously shown to offer high performance solutions which may be unpredictable by external controller design. Recent studies have proved that these methods can also be successfully applied for cooperative multi-agent systems to evolve the desired team behavior. For a given task which may benefit from both cooperation and behavioral specialization, the genetic diversity of the team members may have important effects on the team performance. In this thesis, the single prey hunting problem is chosen as the case, where the performance of the evolved predator teams with distinct genetic similarity levels are systematically examined. For this purpose, three similarity levels, namely homogeneous, partially heterogeneous and heterogeneous, are adopted and analyzed in various problem-specific and algorithmic settings. Our similarity levels differ from each other in terms of the number of groups of identical agents in a single predator team, where identicalness of two agents refers to the fact that both have the same synaptic weight vector in their neural network controllers. On the other hand, the problem-specific conditions comprise three different fields of vision for predators, whereas algorithmic settings refer to varying number of individuals in the populations, as well as two different selection levels such as team and group levels. According to the experimental results within a simulated grid environment, we show that different genetic similarity level-field of vision-algorithmic setting combinations beget different performance results.

Subject Keywords

Dynamic extensions., Computer enginnering.

URI

http://etd.lib.metu.edu.tr/upload/12610832/index.pdf
https://hdl.handle.net/11511/18780

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Using social graphs in one-class collaborative filtering problem Kaya, Hamza; Alpaslan, Ferda Nur; Department of Computer Engineering (2009) One-class collaborative filtering is a special type of collaborative filtering methods that aims to deal with datasets that lack counter-examples. In this work, we introduced social networks as a new data source to the one-class collaborative filtering (OCCF) methods and sought ways to benefit from them when dealing with OCCF problems. We divided our research into two parts. In the first part, we proposed different weighting schemes based on social graphs for some well known OCCF algorithms. One of the weig...
A temporal neural network model for constructing connectionist expert system knowledge bases Alpaslan, Ferda Nur (Elsevier BV, 1996-04-01) This paper introduces a temporal feedforward neural network model that can be applied to a number of neural network application areas, including connectionist expert systems. The neural network model has a multi-layer structure, i.e. the number of layers is not limited. Also, the model has the flexibility of defining output nodes in any layer. This is especially important for connectionist expert system applications.
Multi-resolution visualization of large scale protein networks enriched with gene ontology annotations Yaşar, Sevgi; Can, Tolga; Department of Computer Engineering (2009) Genome scale protein-protein interactions (PPIs) are interpreted as networks or graphs with thousands of nodes from the perspective of computer science. PPI networks represent various types of possible interactions among proteins or genes of a genome. PPI data is vital in protein function prediction since functions of the cells are performed by groups of proteins interacting with each other and main complexes of the cell are made of proteins interacting with each other. Recent increase in protein interactio...
Variable structure and dynamism extensions to a devs based modeling and simulation framework Deniz, Fatih; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2010) In this thesis, we present our approach to add dynamism support to simulation environments, which adopts DEVS-based modeling and simulation approach and builds upon previous work on SiMA, a DEVS-based simulation framework developed at TUBITAK UEKAE. Defining and executing simulation models of complex and adaptive systems is often a non-trivial task. One of the requirements of simulation software frameworks for such complex and adaptive systems is that supporting variable structure models, which can change t...
A practical analysis of sample complexity for structure learning of discrete dynamic Bayesian networks Geduk, Salih; Ulusoy, İlkay (2021-02-01) Discrete Dynamic Bayesian Network (dDBN) is used in many challenging causal modelling applications, such as human brain connectivity, due to its multivariate, non-deterministic, and nonlinear capability. Since there is not a ground truth for brain connectivity, the resulting model cannot be evaluated quantitatively. However, we should at least make sure that the best structure results for the used modelling approach and the data. Later, this result can be appreciated by further correlated literature of anat...

Citation Formats

Ç. Yalçın, “A comparison of predator teams with distinct genetic similarity levels in single prey hunting problem,” M.S. - Master of Science, Middle East Technical University, 2009.