|
|
Framework for development of optimization algorithms
Hurt, Tomáš ; Trunda, Otakar (advisor) ; Hric, Jan (referee)
The aim of the thesis is to design and implement an efficient tool for research and testing of algorithms of the combinatorial optimization. The domain of the planning research will be explained and the steps of design and implementation of such program will be covered. The framework will support two primary for- malisms for the description of optimization problems (PDDL, SAS+ ). The inputs processing will be provided, suitable data structures and efficient implementati- ons of search algorithms will also be included. The emphasis will be on a proper object design and easy extensibility for the future development. To achieve this goal, proven principles of software engineering will be used. 1
|
|
|
Detecting elementary particles with Timepix3 detector
Meduna, Lukáš ; Mráz, František (advisor) ; Hric, Jan (referee)
Detecting elementary particles and observing accompanying events in particle colliders is one of the most important field of current research in experimental physics. TimePix and its successor TimePix3 are types of the currently used detectors which are placed beside other in ATLAS experiment conducted by Eu- ropean Organization for Nuclear Research. Such detectors can produce huge amount of data about passing particles at high rate. The goal of the thesis is to develop methods for detecting and classification of elementary particles observed by detector network ATLAS-TPX3. Suitable methods for clustering and/or classification based on semi-labelled data should be identified or new one should be developed. The proposed methods will be implemented and their performance on real data will be evaluated. The results will also include an implementation of framework for preprocessing low level data from detector network ATLAS-TPX3 in real-time and creating outputs that are suitable for subsequent physics investigation (e.g. ROOT framework files) includ- ing the proposed or future methods for particle classification. 5
|
|
|
Security Game with Planning Agents
Ohman, Ľubomír ; Gemrot, Jakub (advisor) ; Hric, Jan (referee)
The goal of the thesis was to create an application for training security guards, containing a configurable artificial burglar. To fulfill these expectation, a 3D application was implemented, containing a 2D editor of security objects. In order to be able to implement the burglar, we analyzed his objectives and designed an algorithm capable of planning his actions and dealing with the multi- objective optimization. Finally, we compared the performance of our proposed solution to the state- of-the-art algorithm to prove that it solved the optimization more efficiently in our case.
|
|
|
Multi-agent Path Finding on Ozobots
Krasičenko, Ivan ; Barták, Roman (advisor) ; Hric, Jan (referee)
BAKALÁŘSKÁ PRÁCE Ivan Krasičenko Multiagentní hledání cest na Ozobotech Katedra teoretické informatiky a matematické logiky Vedoucí bakalářské práce: prof. RNDr. Roman Barták, Ph.D. Studijní program: Informatika Studijní obor: Programování a softwarové systémy Praha 2018 Prohlašuji, že jsem tuto bakalářskou práci vypracoval(a) samostatně a výhradně s použitím citovaných pramenů, literatury a dalších odborných zdrojů. Beru na vědomí, že se na moji práci vztahují práva a povinnosti vyplývající ze zákona č. 121/2000 Sb., autorského zákona v platném znění, zejména skutečnost, že Univerzita Karlova má právo na uzavření licenční smlouvy o užití této práce jako školního díla podle §60 odst. 1 autorského zákona. V ........ dne ............ Podpis autora i Chtěl bych poděkovat rodičům, že mě vždy podporovali. Bohu, že mě v tom nenechavá samotného. Učitelem ze školy za jejich trpělivost a přívětivost. Všem spolužákům a spolubydlícím se kterými jsem měl tu čest trávit čas. ii Název práce: Multiagentní hledání cest na Ozobotech Autor: Ivan Krasičenko Katedra: Katedra teoretické informatiky a matematické logiky Vedoucí bakalářské práce: prof. RNDr. Roman Barták, Ph.D., Katedra teoretické informatiky a matematické logiky Abstrakt: Vytvořeni testovacího simulačního prostředí pro multiagentní hledání cest na Ozobotech....
|
|
|
Domain Specific Languages in Functional Programming
Rapavá, Jana ; Hric, Jan (advisor) ; Pilát, Martin (referee)
In Artificial Intelligence, especially in area of constraint programming, it's popular to design various modeling languages which allow solving problems on domain level and by using domain specific abstractions. Techniques known from research on Domain-Specific Languages are often useful in this effort. Functional programming languages offer new tools for designing such languages, particularly Domain-Specific Embedded Languages. This work investigates the advantages and disadvantages of using functional programming for designing and implementing a Domain-Specific Embedded Language for state space search problems.
|
|
|
A Controlled Searching of Game Trees
Vrba, Jan ; Hric, Jan (advisor) ; Majerech, Vladan (referee)
Title: A Controlled Searching of Game Trees Author: Jan Vrba Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: RNDr. Jan Hric Abstract: Monte-Carlo Tree Search is a search algorithm based on random Monte- Carlo playouts. Since it was first introduced in 2006, it has been successfully used in several areas. Most notably for the game Go. MCTS is intended mainly for problems with too large a state space to be fully explored in reasonable time. Working with a large state space and the fact that when evaluating a node, it first explores all possible moves leads to large memory complexity. This work explores options a user can use to regulate memory complexity based on the results of previous Monte-Carlo playouts. Keywords: MCTS, UCT, BMCTS, RAVE
|
|
|
λ-calculus as a Tool for Metaprogramming in C++
Šefl, Vít ; Hric, Jan (advisor) ; Kratochvíl, Miroslav (referee)
The template system of C++ is expressive enough to allow the programmer to write programs which are evaluated during compile time. This can be exploited for example in generic programming. However, these programs are very often hard to write, read and maintain. We introduce a simple translation from lambda calculus into C++ templates and show how it can be used to simplify C++ metaprograms. This variation of lambda calculus is then extended with Hindley-Milner type system and various other features (Haskell-like syntax, user-defined data types, tools for interaction with existing C++ template code and so on). We then build a compiler capable of transforming programs written in this language into C++ template metaprograms. Powered by TCPDF (www.tcpdf.org)
|
|
|
Nízkoúrovňový funkcionální programovací jazyk
Kratochvíl, Miroslav ; Bednárek, David (advisor) ; Hric, Jan (referee)
The goal of this thesis is to explore the current possibilities of implementation of compilers of low-level functional languages. It is expected to evaluate theoretical possibilities of functional programming languages, possible limitations that arise from the absence of run-time code support in low-level environment, and to implement a language compiler that demonstrates some chosen properties. Powered by TCPDF (www.tcpdf.org)
|
|
|
Genetic Algorithms driven by MCTS
Havránek, Štěpán ; Hric, Jan (advisor) ; Moudřík, Josef (referee)
Evolutionary and genetic algorithms are problem-solving methods designed according to a nature inspiration. They are used for solving hard problems that we cannot solve by any efficient specialized algorithm. The Monte Carlo method and its derivation the Monte Carlo Tree Search (MCTS) are based on sampling and are also commonly used for too complex problems, where we are dealing with enormous memory consumption and it is impossible to perform a complete searching. The goal of this thesis is to design a general problem solving method that is built from these two completely different approaches. We explain and implement the new method on one example problem: the Traveling salesman problem (TSP). Second part of this thesis contains various tests and experiments. We compare different settings and parametrizations of our method. The best performing variant is then compared with the classical evolutionary TSP solution or, for example, with greedy algorithms. Our method shows competitive results. The best results were achieved with the cooperation of our method and the classical evolutionary TSP solution. This union shows better results than any of its parts separately, which we find as a great success.
|
|
|
Walks in time-dymanic graph model
Beliš, Marek ; Pangrác, Ondřej (advisor) ; Hric, Jan (referee)
Orienteering with moving control points can be represented as a graph model with ranked vertices and oriented edges. The rank of vertex depends on the actual time. Searching for the most optimised walk through this graph is NP-complete problem which can be in real-time solved only with limiting conditions and using of heuristics. SMIK solver software provides implemented heuristics for searching the best walk in several ways. In the thesis we can find description of the problem and algorithms, programming documentation with description of used methods and comparation of results to the real competition. Powered by TCPDF (www.tcpdf.org)
|
guest ::
