|
|
Matrix calculator
Krč-Jediný, Ondrej ; Chrpa, Lukáš (advisor) ; Surynek, Pavel (referee)
The aim of this project is creating an environment which would allow the user to work with chosen matrix algorithms, with the emphasis on understanding their principles. Using a simple programming language, the user will be able to perform computations and display their results. Moreover, the environment is able to show a characterisation, and a description of the course of computation of each algorithm, thus providing information about the means of its operation. The project implements several basic and several advanced algorithms for handling matrices.
|
|
|
The Implementation of an Artificial Intelligence in a Strategy Game Simulator
Fürbach, Radek ; Mrázová, Iveta (advisor) ; Chrpa, Lukáš (referee)
The aim of this thesis is a comparison of a few selected methods of an artificial intelligence in a specified strategy game. The thesis contains three parts. The first part specifies a model of the strategy game, whereat are simulated some experiments. It defines objects that occur in the game, relation among them, and used algorithms. The second part specifies of the artificial intelligence that is used in the strategy game. It explains the genetic algorithm and shows a few methods of so called selection, crossing, and mutation. It describes some basic artificial neural networks and their architectures. The last part describes several algorithms of the artificial intelligence using theory from the second part. It compares their efficiency on the simulated experiments.
|
|
|
Compiling Planning Problems
Toropila, Daniel ; Barták, Roman (advisor) ; Chrpa, Lukáš (referee)
Constraint satisfaction techniques are used frequently for solving scheduling problems, but they are still seldom in AI planning. There exist several attempts to apply constraint satisfaction for solving AI planning problems, however, these techniques never became prevailing in planning and did not reach the success of, for example, SATbased planners. In this work we argue that the existing constraint models for classical AI planning are indeed not exploiting fully the power of constraint satisfaction and we propose their reformulation which significantly improves efficiency.
|
|
|
Visualisation of planning domains
Vodrážka, Jindřich ; Chrpa, Lukáš (advisor) ; Dokulil, Jiří (referee)
Předložená práce zkoumá možnosti vizualizace plánovacích domén. Náplní této práce je návrh grafické reprezentace pro plánovací domény a následné použití tohoto návrhu v programu, který bude fungovat jako grafický editor. Výsledná grafická reprezentace by měla být snadno převoditelná na klasickou reprezentaci plánovacích domén. Program by měl umožňovat práci s plánovacími doménami v rozsahu typed STRIPS reprezentace. Měl by poskytovat uživateli možnost návrhu plánovací domény a její následný export do jazyka PDDL.
|
|
|
Web shop
Petrůšek, Tomáš ; Zlomek, Josef (advisor) ; Chrpa, Lukáš (referee)
In my bachelor thesis I have designed and programmed an open source application that implements basic functions of a business-to-consumer e-shop. The system is modular and easily extensible with simple module administration. In the customer section it is possible to browse the product catalogue, view the price of products, their quantity in stock etc. The application maintenance is situated in the employees' section, as is the maintenance of employee and customer accounts, permissions, goods and their categories.
|
|
|
Blind Friendly Time Organizer
Šatánek, Jaromír ; Cejnar, Pavel (advisor) ; Chrpa, Lukáš (referee)
In present many diaries and organizers use attractive but nonstandard controls, which are problematic to read for software designated for blind people (e.g. JAWS, www.freedomscientific.com). The aim of this bachelor work is to analyze functions and controls of commonly used diaries and create diary, which demands minimal configuration of applications for reading the screen. The diary must support functions like planning occurrences, repeated occurrences, tally of contacts, reminding occurrences at certain time, searching in text of occurrences, backing up and transmissibility of data. Everything with emphasis on the way of managing routine tasks.
|
|
|
Modelling Planning Problems
Vodrážka, Jindřich ; Barták, Roman (advisor) ; Chrpa, Lukáš (referee)
This thesis deals with the knowledge engineering for Automated Planning. The concept of state variables has been recently used with benefits for representation of planning problems. In this thesis the same concept is used in a novel formalism for planning domain and problem modeling. A proof-of-concept knowledge modeling tool is developed based on the new formalism. This tool is then used for modeling of example classical planning domain to show its capabilities. The export to standard domain modeling language is also implemented in the tool in order to provide connection to existing planning systems.
|
|
|
Learning for Classical Planning
Chrpa, Lukáš ; Barták, Roman (advisor) ; Železný, Filip (referee) ; Berka, Petr (referee)
This thesis is mainly about classical planning for artificial intelligence (AI). In planning, we deal with searching for a sequence of actions that changes the environment from a given initial state to a goal state. Planning problems in general are ones of the hardest problems not only in the area of AI, but in the whole computer science. Even though classical planning problems do not consider many aspects from the real world, their complexity reaches EXPSPACE-completeness. Nevertheless, there exist many planning systems (not only for classical planning) that were developed in the past, mainly thanks to the International Planning Competitions (IPC). Despite the current planning systems are very advanced, we have to boost these systems with additional knowledge provided by learning. In this thesis, we focused on developing learning techniques which produce additional knowledge from the training plans and transform it back into planning do mains and problems. We do not have to modify the planners. The contribution of this thesis is included in three areas. First, we provided theoretical background for plan analysis by investigating action dependencies or independencies. Second, we provided a method for generating macro-operators and removing unnecessary primitive operators. Experimental evaluation of this...
|
|
|
Modular system for managing web contents
Kulman, Igor ; Chrpa, Lukáš (advisor) ; Lokoč, Jakub (referee)
Modular web content management system (thereinafter ModularCMS) offers the users an easy and simple way to create an manage their own website, from a simple personal presentation to complex and extensive company web. ModularCMS puts the main afford on the simplicity of user and programming interface, separating itself from other existing CMSs. The simplicity of user inteface maens, taht if an end user orderes an web presentation based on this CMS, atfer its deployment, he will be able to manage the content and do all the other actions he may need very easy and quickly. The architecture of MudularCMS is modular, it could be extended with other functions a project may need by programming new moduls.
|
|
|
AI Planning with Time and Resource Constraints
Dvořák, Filip ; Barták, Roman (advisor) ; Chrpa, Lukáš (referee)
Automated planning plays an important role in many fields of human interest, where complex and changing tasks involve demanding efficiency and error-avoidance requirements. Research in planning is also motivated by capturing the computational aspects of Artificial Intelligence, where planning, being a reasoning side of acting, is one of the key elements. Introduction of time and resources into planning is an important step towards modelling problems from the real world, however planning is generally hard and introduction of time and resources makes it even harder. In this thesis we explore theoretical aspects of planning, temporal reasoning and resource reasoning. Based on these studies we develop our own suboptimal domain-independent planning system that focuses on planning, where time plays a major role and resources are constrained. We test the developed planning system on the planning problems with time and resources from the International Planning Competition 2008 and compare our results with the competition participants.
|
guest ::
