|
|
Soccer
Beneš, Jan ; Babilon, Robert (referee) ; Lidický, Bernard (advisor)
The purpose of this thesis was to design and implement an association football (soccer) match simulator and to compare the resulting implementation with other programs of similar function. A model after which both out eld players and goalkeepers play in an association football match was designed. It is possible to run the program in an interactive mode, whereby the players of one of the teams are controlled by the user, or to spectate a match of arti cial intelligencies. Included in the simulation are the physics of the football and deflections off the crossbar and the posts.
|
|
|
Simulation in traffic networks
Fischer, René ; Babilon, Robert (referee) ; Pangrác, Ondřej (advisor)
The programme offers to the user the option to create his own traffic network or to adapt already existing traffi network, all with parameters and rules required by user. Afterwards the user can make a simulation of the network and thus get a valuabe informations about possible development of the traffic. Simulation should reveal stressed places in the traffic, where traffic jams would be possible to occur in a reality. Under the observation the user is able to adapt the network in order to resolve unwanted situations. The programme also involves option of constricted simulation.
|
|
|
Comparing chess strategies
Kacz, Kristián ; Babilon, Robert (referee) ; Cibulka, Josef (advisor)
The aim of this work is to provide an overview of approaches in computer chess. It designs and implements a chess engine for multiplayer network chess program ChessNet. Within the engine implements several search algorithms like Negamax, Alpha-beta, Negascout and points to their weaknesses. Adds a possibility to the ChessNet environment to compare chess engines. Compares implemented algorithms in terms of time complexity. Shows several factors wich we have to take into consideration during the design of evaluation function of game states. Implements some such functions and compares them in terms of success against each other.
|
|
|
Spread of delay on railway network
Straka, Martin ; Pergel, Martin (referee) ; Babilon, Robert (advisor)
Title: Spread of delay on railway network Author: Martin Straka Department: Department of Applied Mathematics Supervisor: Mgr. Robert Babilon Supervisor's e-mail address: babilon@kam.ms.mff.cuni.cz Abstract: The subject of this work is a simulation of late trains spreading in railway net. This program shows the single simulations and creates their statistics according to different criteria (for example changing waiting periods or changes in crossing of the trains). This work evaluates and compares the results. Next point of this work is an effort to suggest the most appropriate criteria in order to prevent the train lag. Another element of this work includes searching for weak points in grafikon, which includes the trains that are late more frequently than other or do not wait for an arrival of the previous ones on their way because of the great lag. Keywords: trains, late, simulation, statistic Keywords: trains, late, simulation, statistic
|
|
|
Automatic Rail Traffic Controller
Chytil, Martin ; Kofroň, Jan (referee) ; Babilon, Robert (advisor)
The goal of this work is to create program environment which is simulating railway activity during unexpected situations. For that reason it is important to separate creating program into two separated parts which are cooperating with each other - editor and simulator. At first user makes his own railway model, creates trains and generates traffic order. Then simulator starts simulating and user can create exceptionalities on it. Automatic Controller solves these special situations to minimalize consequences of railway activity.
|
|
|
Construction of Periodic Railway Timetables
Kalický, Andrej ; Pergel, Martin (referee) ; Babilon, Robert (advisor)
In the propounded thesis author studies the periodic railway timetable. The aim of this thesis is to construct time shifts among train lines so that transfers between lines would be planned in the best possible way. Author discusses the problem to solve, and its differences from standard processing of periodic railway timetable construction. Author propounds and code 2 algorithms for optimization of given timetable. At the end of thesis the solutions and algorithms are compared based on statistical data related with the process of periodic railway timetable construction.
|
|
|
Spread of delay on railway network
Straka, Martin ; Babilon, Robert (advisor) ; Libič, Peter (referee)
The subject of this work is a simulation of late trains spreading in railway net. This program shows the single simulations and creates their statistics according to different criteria (for example changing waiting periods or changes in crossing of the trains). This work evaluates and compares the results. Next point of this work is an effort to suggest the most appropriate criteria in order to prevent the train lag. Another element of this work includes searching for weak points in grafikon, which includes the trains that are late more frequently than other or do not wait for an arrival of the previous ones on their way because of the great lag.
|
|
|
Spread of delay on railway network
Straka, Martin ; Babilon, Robert (advisor) ; Pergel, Martin (referee)
The subject of this work is a simulation of late trains spreading in railway net. This program shows the single simulations and creates their statistics according to different criteria (for example changing waiting periods or changes in crossing of the trains). This work evaluates and compares the results. Next point of this work is an effort to suggest the most appropriate criteria in order to prevent the train lag. Another element of this work includes searching for weak points in grafikon, which includes the trains that are late more frequently than other or do not wait for an arrival of the previous ones on their way because of the great lag.
|
|
|
Timetable generation for public mass transportation
Trenkler, Pavol ; Pergel, Martin (referee) ; Babilon, Robert (advisor)
In this work we study two problems arising in transport planning: the vehicle scheduling problem and the duty scheduling problem. We present the most promising algorithms for solving these problems optimally, based on the minimum cost multicommodity flow problem and the set partitioning problem. Then we discuss an implementation using freely available integer programming libraries, within the context of a transit scheduling application developed.
|
|
|
Scrabble
Dvořák, Filip ; Hric, Jan (referee) ; Babilon, Robert (advisor)
The subject matter of the submitted thesis is a study of the board game Scrabble and its transfer to electronic form. The object of this thesis is to present possible and used approaches in implementation of Scrabble systems and to present and evaluate data structures and algorithms used in those systems. The implementation of the chosen approaches is a part of this thesis. After the brief introduction into the rules of Scrabble and initiatory problem's analyse there are presented data structures used for dictionary storage, move generating algorithms and possible approaches in game strategies. The practical part of this thesis deals with chosen approaches and reasons why they were chosen. At the end of this thesis there is a summary of possible contributions of developed system and its possible following expansions.
|
guest ::
