| |
| |
|
Karyotype evolution of velvet spiders (Araneae: Eresidae)
Forman, Martin ; Král, Jiří (advisor) ; Rothová, Olga (referee)
Presented study is aimed to determine basic trends of karyotype evolution in velvet spiders (Eresidae; Araneae). Eresids are burrowing spiders; they includes also some social species. Karyotypes of 16 species of the family Eresidae as well as 2 species of the other families of the superfamily Eresoidea, Hersiliidae and Oecobiidae, are presented. Furthermore, DNA content and base proportion was determined in 14 species. In two species, DNA content of sex chromosomes was also measured. Obtained results revealed considerable variability of diploid numbers, and sex chromosomes systems in eresids. Obtained karyotype data allow to divide eresids into four groups. Karyotypes of the genera Gandanameno, Dresserus and S. lineatus are close to proposed ancestral karyotype of entelegynae spiders and they show the ancestral state of karyotype in velvet spiders. Karyotypes of S. lineatus and E. annulipes differ substantially from other representatives of the genera Stegodyphus and Eresus which indicates paraphyly of these genera. Karyotypes of basal forms are formed by acrocentric chromosomes. Further evolution of eresid karyotypes included considerable reduction of diploid numbers as well as changes of chromosome morphology. Social species of the genus Stegodyphus show tendency to reduce diploid numbers by...
|
|
Strategic Game in Multi-Agent System Jason
Vais, Roman ; Zbořil, František (referee) ; Král, Jiří (advisor)
This thesis describes artificial inteligence used in developement of computer games, particularly discusses with theory behing artificial inteligence used in real-time strategy games. It deals with implementation of extensions for one such a game. It analyzes posibylities of use multi-agent systems architecture for purposess of artificial inteligence in games. It describes concept of swarm inteligence as suitable but not used tool for developing not only videogame artificial inteligence. Moreover it attempts to find suitable representation of sensation for software agents and shows the difficulties of this task.
|
| |
| |
| |
|
Strategic Game in Multi-Agent System Jason
Leško, Matej ; Samek, Jan (referee) ; Král, Jiří (advisor)
Tato práce se zaobírá problematikou koncepce a vývoje multi-agentní tahové strategické hry. Práce analyzuje teorii těchto her a agentních systémů a výsledky této analýzy následně zohledňuje v návrhu samotné hry. Ta implementuje kromě herních konceptů a ovládání, obecně užívaných, dvě úrovně kooperace umělé inteligence, mírnou a komplexní spolupráci. Agent je v této hře hráčem, ovládajícím různé jednotky. Hra je koncipovaná tak, že je jí možné rozšířit o nové druhy inteligence, případně o nové herní jednotky. Závěrečná část práce se soustředí na srovnání jednotlivých úrovní kooperace, na efektivitu jednotlivých umělých inteligencí a také na zhodnocení efektivity implementace hry. S tímto účelem byla vykonána série automatizovaných testů.
|
|
Cooperative Game in Multi-Agent System Jason
Husa, Jakub ; Rozman, Jaroslav (referee) ; Král, Jiří (advisor)
The subject of this thesis is creation of a game based on a multi-agent system. First part of the thesis introduces theory of multi-agent systems, strategic computer games, language AgentSpeak and his extension Jason which were used for implementation. Then design of turn-based strategic game Prison Escape is described, which pitches two asymmetrical teams of intelligent agents with different goals against each other. Each team has three modes of intelligent behavior designed for them, which differ by their complexity and extent of inter-agent cooperation. One team can be controlled by a player, or both teams can be controlled by computer. The game is tested on a set of testing maps. The thesis compares the three designed modes of behavior and evaluates their ability to succeed against varying opponents and thinking speed.
|
|
Public Transport Simulation in Brno
Němec, František ; Král, Jiří (referee) ; Rozman, Jaroslav (advisor)
The goal of this thesis is to design and implement public transport simulator in Brno. Information about the departure times and routes of each public transport lines are extracted from online traffic timetables. Data from which traffic network is generated are obtained from OpenStreetMap project. The thesis contains a description of the basic approaches to create traffic simulators, especially the description of the microscopic approach on which is this simulator based. The second part of thesis includes the design and implementation of simulator, whose main components are ways of traffic management, representation of transport networks and the generation of OpenStreetMap data.
|