|
|
Prototype Verification of Modification of Evolutionary Algorithm
Švestka, Marek ; Rajnoha, Martin (referee) ; Šeda, Pavel (advisor)
This thesis is about evolutionary algorithms with a concrete solution for an Aircraft Landing Problem. The goal is to create a genetic algorithm for this task resolution, apply selected modifications and compare all outputs. The program runs with different selection methods which are further reviewed. Input data are taken from Operations research library for this task. The outcome of this thesis gives a closer look to evolutionary programming and it’s problem resolution.
|
|
|
Strategy for Game Systems
Švestka, Marek ; Tóth, Michal (referee) ; Zemčík, Pavel (advisor)
This thesis resolves the artificial intelligence representation in computer games. The goal was to find it's suitable interpretation methods. The issue was solved with "map"implementation, which is the n-dimension matrix holding the information about current game state for the concrete player. There were various types of these matrixes used in this thesis. Furthermore was designed a way to evolve computer opponents during the gameplay and created an algorithm, that gives the idea of the space in which it is located. Benefit from this thesis is a solution that makes artificial adversary close to human gameplay behavior. The outcome could also be used in simulators for military battles in real world.
|
|
|
Prototype Verification of Modification of Evolutionary Algorithm
Švestka, Marek ; Rajnoha, Martin (referee) ; Šeda, Pavel (advisor)
This thesis is about evolutionary algorithms with a concrete solution for an Aircraft Landing Problem. The goal is to create a genetic algorithm for this task resolution, apply selected modifications and compare all outputs. The program runs with different selection methods which are further reviewed. Input data are taken from Operations research library for this task. The outcome of this thesis gives a closer look to evolutionary programming and it’s problem resolution.
|
|
|
Strategy for Game Systems
Švestka, Marek ; Tóth, Michal (referee) ; Zemčík, Pavel (advisor)
This thesis resolves the artificial intelligence representation in computer games. The goal was to find it's suitable interpretation methods. The issue was solved with "map"implementation, which is the n-dimension matrix holding the information about current game state for the concrete player. There were various types of these matrixes used in this thesis. Furthermore was designed a way to evolve computer opponents during the gameplay and created an algorithm, that gives the idea of the space in which it is located. Benefit from this thesis is a solution that makes artificial adversary close to human gameplay behavior. The outcome could also be used in simulators for military battles in real world.
|
|
| |
|
| |
guest ::
RSS feed.