|
|
Game Environment Checking by a Swarm of Autonomous Agents
Heindlová, Tina ; Nečasová, Gabriela (referee) ; Zbořil, František (advisor)
This thesis studies engine Enfusion and how to start with it. It describes the creation of a minigame to introduce the engine. Further, a backtracking algorithm for the detection of inconsistent states in the game worlds is introduced. Thesis describes how to create a simple world and its testing. The algorithm is tested and the testing results are discussed. In the end, it describes more methods of solutions.
|
|
|
Jumping Formal Models Inference
Heindlová, Tina ; Bidlo, Michal (referee) ; Křivka, Zbyněk (advisor)
This thesis is focused on grammatical inference in the way of evolutionary algorithms for jumping finite models. The first part explains jumping finite models as itself. More specifically, it describes jumping grammars and jumping automata. The next part deals with grammatical inference, evolutionary algorithms, and their important parts. According to the developed jumping models, said parts include strings generation and membership testing. These two algorithms are applied to chosen types of jumping finite automata---jumping finite automata, general jumping finite automata, and right one-way jumping finite automata. These four types of automata were tested, and in total, sixteen experiments were run. Results show that the inference works much better for automata without branching and with a small number of states and a small alphabet.
|
|
|
Jumping Formal Models Inference
Heindlová, Tina ; Bidlo, Michal (referee) ; Křivka, Zbyněk (advisor)
This thesis is focused on grammatical inference in the way of evolutionary algorithms for jumping finite models. The first part explains jumping finite models as itself. More specifically, it describes jumping grammars and jumping automata. The next part deals with grammatical inference, evolutionary algorithms, and their important parts. According to the developed jumping models, said parts include strings generation and membership testing. These two algorithms are applied to chosen types of jumping finite automata---jumping finite automata, general jumping finite automata, and right one-way jumping finite automata. These four types of automata were tested, and in total, sixteen experiments were run. Results show that the inference works much better for automata without branching and with a small number of states and a small alphabet.
|
|
|
Game Environment Checking by a Swarm of Autonomous Agents
Heindlová, Tina ; Nečasová, Gabriela (referee) ; Zbořil, František (advisor)
This thesis studies engine Enfusion and how to start with it. It describes the creation of a minigame to introduce the engine. Further, a backtracking algorithm for the detection of inconsistent states in the game worlds is introduced. Thesis describes how to create a simple world and its testing. The algorithm is tested and the testing results are discussed. In the end, it describes more methods of solutions.
|
guest ::
