|
|
Evolutionary Analogue Amplifier Optimisation
Bielik, Marek ; Zachariášová, Marcela (referee) ; Bidlo, Michal (advisor)
Táto práca demonštruje možnosti využitia evolučných algoritmov, konkrétne evolučných stratégií, v doméne dizajnu analógových zosilňovačov. Do implementácie je zahrnutý ngSPICE simulátor, ktorý je použitý na vyhodnotenie optimalizovaných riešení a v práci je navrhnutých niekoľko vyhodnocovacích metód. Práca tiež zahŕňa experimenty a ich výsledky, ktoré boli použité na určenie najvodnejších parametrov evolučných stratégií. Cieľom bolo optimalizovať hodnoty súčiastok jedno a dvoj stupňových zosilňovačov s bipolárnymi tranzistormi v zapojení so spoločným emitorom. Výsledkom je nástroj umožňujúci návrh zosilňovačov s ľubovoľným zosilnením v rámci možností daného obvodu bez použitia akéhokoľvek matematického aparátu.
|
|
|
Artificial intelligence for Texas Holdem poker game
Moravčík, Matej ; Petříčková, Zuzana (advisor) ; Sýkora, Ondřej (referee)
Recently there has been a great expansion of poker. This includes live games, as well as games on the internet. For beginners, it may be difficult to find opponents skilled enough and thus improve their gaming performance without deposit of their own funds. Using of artificial intelligence seems as good solution for the problem, but there are only few suitable programs available. This thesis describes the overall design and development of such an application, specially designed for tournament variant of Texas Hold'em poker. Most attention is devoted to the artificial intelligence. There are two main approaches discussed - approximate Nash equilibrium and the use of expert system. Emphasis is placed on the first option. The main contribution of this thesis is detailed description and comparison of three algorithms for calculating the approximation of Nash equilibrium. Two of them are original heuristics algorithms, that take advantage of specific structure of poker game. Algorithms have been implemented and their properties have been empirically evaluated. The final result is a full-featured application designed for end users. It simulates poker game and provides a powerful artificial intelligence with attractive graphical user interface.
|
|
|
Planning systems in game level design and agent control
Tóth, Csaba ; Kadlec, Rudolf (advisor) ; Barták, Roman (referee)
Planners are well developed tools in computer science, but their role is rather limited in games. We decided to test the possibilities of writing such a game around them. Proving that freely available, general purpose planning systems are worthy alternatives to custom made solutions could open a new path to small developers and popularize a new kind of gameplay powered by these tools. We attempted to exploit planners in two roles, in the development, to partially automate the level design process; and in the gameplay as a decision making tool for the acting agents. Our program is a puzzle game, more precisely an anticipation game, where the player has to foresee the future actions of the acting agents, then discover the pitfalls where they are heading. Using this knowledge he can modify their environment and force them to a desired outcome. A part of our program is a generator of such game challenges. We came to a conclusion that within some limitations planners are capable of creating believable agent behavior and while not all decisions can be handed over to the planning systems, they can lighten the task of the level designer.
|
|
|
Visualization and verification of plans
Glinský, Radoslav ; Barták, Roman (advisor) ; Dvořák, Filip (referee)
Title: Visualization and Verification of Plans Author: Radoslav Glinský Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor of the bachelor thesis: Doc. RNDr. Roman Barták, Ph.D. Abstract: Plan analysis is an important part of complete planning systems. In order to make even larger plans transparent and human readable, we have developed a program which helps users with the analysis and visualization of plans. This program is called VisPlan - Interactive Visualization and Verification of Plans. VisPlan is an inevitable part of this thesis as it practically implements its plan verification and visualization solutions. VisPlan finds and displays causal relations between actions, it identifies possible flaws in plans (and thus verifies plans' correctness), it highlights the flaws found in the plan and finally, it allows users to interactively modify the plan and hence manually repair the flaws or just fine-tune the plan. Keywords: Planning, Artificial Intelligence, PDDL, Verification
|
|
|
Computer Poker
Kýpeť, Jakub ; Surynek, Pavel (advisor) ; Toropila, Daniel (referee)
The present work describes a design and an implementation of environment for playing Texas Hold'em poker, including design and implementation of a system that simulates a player of this game. This system consists of three developed strategies, using all resources described in the work. The various strategies that we have developed, we have tested on a few games. The results obtained from the tests are analyzed and then compared with our assumptions and expectations. This work also consists a description of existing programs that are about same topic and then comparation with our application.
|
|
|
UNIVERSAL BASIC OPRESSION
Růžičková, Martina ; Jánoščík,, Václav (referee) ; Sterec, Pavel (advisor)
Master's thesis Polyamory Design Unit (PDU) explores the possibilities of collaboration between experts being active in fine arts, product design, graphic design, architecture and philosophy in order to create a speculative future scenario. Together with Jana Trundova, Simon Barak, Ondrej Mohyla and Lukas Likavcan, I create the concept and the presentation structure for a housing complex, which is designed for polyamoric coexistence of human and non-human entities. Such a coexistence is made possible by full automation of work and global implementation of universal basic income. These initial parameters constitute a big emancipatory potential, that could change present meaning of the concept of polyamory and thus redefine networks of relations in bigger scales too.
|
|
| |
|
|
Efective Logistic of Transport
Janovič, Jakub ; Goldefus, Filip (referee) ; Lukáš, Roman (advisor)
This thesis considers with searching the shortest route depends on input conditions as number of vehicles and input map. Presents algorithms used for searching, their use in applications and their adjustment for existing problems. In this thesis is included whole scructure of the application as mentioned searching, its administration and administration of objects used in program.
|
|
|
Visual Simulator and Debugger of Neural Networks
Beluský, Ondrej ; Zbořil, František (referee) ; Martinek, David (advisor)
Artificial neural networks represent computational parallel systems. This part of artificial intelligence is still researched. Basically neural network is the set of neurons, which are connected together. These networks have aspects of human intelligence, because they have an ability to learn. Their main goal is to simulate human brain, but creating such a network with large number of neurons and connections between them is impossible. They simulate some parts of human thinking. My task was to create visual simulator and debugger of these networks. The program was supposed to have a choice to debugging and stepping the algorithm for learning. My goal was also to implement editor, which allows creating and editing neural networks.
|
|
| |
guest ::
