|
|
Cooperation of Multiagent Group in Dynamic Environment
Balajka, Pavel ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
The thesis summarises thorough analysis of rules and mechanisms of Multiagent Contest for year 2020 followed by design of multiagent group which will try to succeed in a simulation of the mentioned contest with the best results. The design was created according to the Prometheus metodology from general view (scenarios, goals) to specific details (agent plans, messages). Implementation is realized through JaCaMo system, which is also briefly described in this paper. Then the pros and cons of JaCaMo system are analyzed. Lastly the implemented solution of this work is compared with other teams that participated in the mentioned agent competition this year.
|
|
|
Path Planning Algorithms Visualisation
Řepka, Michal ; Uhlíř, Václav (referee) ; Rozman, Jaroslav (advisor)
Finding of collision free path is central in creation of mobile, autonomous robot. Goal of this paper is to show the most important algorithms implementing such solutions. It also describes application that is being created to allow students experiment with these methods. For this purpose it uses library that was introduced by Jakub Rusnák in 2017, which means this is a continuation and possibly extension of his work.
|
|
|
Multirobot Path Planning in a Dynamic System
Plachý, Dominik ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
This thesis deals with the design of a path planning algorithm for a multi-robot system in order to cover a dynamic environment. The coverage problem is solved by dividing the space into equal sized areas, of which there are at least as many as the number of agents covering the space. The agents divide the areas among themselves and resolve any collisions that occur. They are also able to react by changing their plan when they encounter an obstacle. The thesis contains measured and commented data from running the algorithm for different parameters of the environment dynamics. The result of the work is an algorithm whose efficiency increases directly proportional to the number of agents.
|
|
|
Cooperation of Multiagent Group in Dynamic Environment
Balajka, Pavel ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
The thesis summarises thorough analysis of rules and mechanisms of Multiagent Contest for year 2020 followed by design of multiagent group which will try to succeed in a simulation of the mentioned contest with the best results. The design was created according to the Prometheus metodology from general view (scenarios, goals) to specific details (agent plans, messages). Implementation is realized through JaCaMo system, which is also briefly described in this paper. Then the pros and cons of JaCaMo system are analyzed. Lastly the implemented solution of this work is compared with other teams that participated in the mentioned agent competition this year.
|
|
|
Multirobot Path Planning in a Dynamic System
Plachý, Dominik ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
This thesis deals with the design of a path planning algorithm for a multi-robot system in order to cover a dynamic environment. The coverage problem is solved by dividing the space into equal sized areas, of which there are at least as many as the number of agents covering the space. The agents divide the areas among themselves and resolve any collisions that occur. They are also able to react by changing their plan when they encounter an obstacle. The thesis contains measured and commented data from running the algorithm for different parameters of the environment dynamics. The result of the work is an algorithm whose efficiency increases directly proportional to the number of agents.
|
|
|
Film Suggestions Based on CSFD User Profiles
Janko, Pavel ; Šůstek, Martin (referee) ; Uhlíř, Václav (advisor)
This thesis covers the topic of utilizing neural nets for recommending movies. The principle of using neural nets with machine learning and both the general and the advanced techniques of creating a recommender system are also covered in the thesis. The core of the thesis is the design, implementation and finally the evaluation of a system for movie recommendations based upon the data mined from the user profiles from the ČSFD (Czech-Slovak film database). In order to accomplish this goal the system utilizies an explicit factorization model based on collaborative filtering between items to predict an accurate rating that the user would presumably give to a movie after watching it. This thesis also describes the relation between dataset size and prediction accuracy and demonstrates this accuracy by analyzing user feedback.
|
|
|
User Interface for RoboDelivery Unit
Vostřejž, Tomáš ; Zbořil, František (referee) ; Uhlíř, Václav (advisor)
The aim of this thesis is to design and implement user interface for RoboDelivery service. In addressing the problem, attention is drawn to the fact that interaction with the delivery unit must be intuitive and cover the widest possible range of users, including users with visual, auditory or tactile disabilities. Furthermore, the designed interface is tested with the help of users. The result is an ODROID application.
|
|
|
Multiagent Support for Strategic Games
Knapek, Petr ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
This thesis is dedicated to creating a new system with capabilities to create new generic, autonomous strategy computer game controlling elements based on multi-agent systems with social, intelligent decision-making and learning skills. Basic types of strategy games and problems of their playing will be introduced, along with currently used methods of intelligent game AI development. This thesis also presents design and implementation of the new system, working model for a specific game and results obtained while testing it.
|
|
|
Coalition Games in a Dynamic Multiagent Environment
Hamran, Peter ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
The essence of this bachelor thesis was to implement an algorithm for suitable coalition forming in multi-agent system. Suitable coalition denotes a coalition which is not formed in super-additive environment and so it depends on its size and members. Aim of this thesis was to adjust an algorithm for coalition bounds forming between agents in a way, that it is applicable in a multi-agent competition MASSIM. Key aspects are amount of messages sent between agents for coalition to form and also a time it takes to calculate all coalitional values required for such a process. Final scenario is where two competitive groups of agents compete for resources in a multi-agent system simulation.
|
|
|
Coalition Games in a Dynamic Multiagent Environment
Hamran, Peter ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
The essence of this bachelor thesis was to implement an algorithm for suitable coalition forming in multi-agent system. Suitable coalition denotes a coalition which is not formed in super-additive environment and so it depends on its size and members. Aim of this thesis was to adjust an algorithm for coalition bounds forming between agents in a way, that it is applicable in a multi-agent competition MASSIM. Key aspects are amount of messages sent between agents for coalition to form and also a time it takes to calculate all coalitional values required for such a process. Final scenario is where two competitive groups of agents compete for resources in a multi-agent system simulation.
|
guest ::
RSS feed.