ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Artificial life on a colony of intelligent agents

Rok Ritlop (2015) Artificial life on a colony of intelligent agents. EngD thesis.

[img]
Preview
PDF
Download (824Kb)

    Abstract

    We developed a simulation of artificial life with a colony of intelligent individuals (agents) by using a combination of neural networks, genetic algorithms, and ant colony optimization. Each agent has its own brain implemented as a neural network. Several agents form a colony which interacts with the environment by gathering and storing food. They communicate using pheromone trails. Through the processes of inheritance and mutation of agents' brain the colony can develop continuously. With simulation we gathered the information on the effectiveness of colonies with varying rates of mutation (from 0.01 to 0.10) and compared the results. The colonies with low mutation rates were overall less successful, while the colonies with high mutation rates were successful in developing only certain behaviours. The most successful colonies used the mutation rate of 0.05, which presents a good balance between creating new agents and copying the existing successful agents. The simulation allows adjustment of parameters and presents a good basis for further development and adding more complex agent behaviours.

    Item Type: Thesis (EngD thesis)
    Keywords: artificial life, neural networks, genetic algorithms, ant colony optimization
    Number of Pages: 56
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    izr. prof. dr. Marko Robnik -Šikonja276Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536403139)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 3002
    Date Deposited: 30 Jun 2015 13:10
    Last Modified: 14 Aug 2015 08:18
    URI: http://eprints.fri.uni-lj.si/id/eprint/3002

    Actions (login required)

    View Item