|
|
Determination of criteria for the selection of football talents for the position of central midfielder in selected formations
Valta, Marek ; Kaprálková, Michaela (advisor) ; Šíma, Jan (referee)
Title: Determination of criteria for the selection of football talents for the position of central midfielder in selected formations Objectives: The main aim of this work is to compile a list of the most important criteria, which will allow identifying football talents in the U15 category playing the position of central midfielder in selected game systems from the perspective of the representative agency. Methods: Qualitative and quantitative research methods were used to create a list of the most important criteria for selecting football talents. In the first phase of the research, semi-structured interviews were conducted with player agents and scouts, which brought a unique insight into the issue of identifying talents and their subsequent care. Based on previous research, a list of criteria observed in a central midfielder was compiled. It was consequently narrowed by scaling each criteria into the final form of the most important criteria for the identification of football talents in the U15 category playing as a central midfielder in selected formations. Results: The result of the diploma thesis is the compilation of a list of the most important criteria, which will enable the identification of football talents in the U15 age category for the position of central midfielder in selected...
|
|
|
Adaptive formations for virtual agents
Švagerka, Michal ; Plch, Tomáš (advisor) ; Čermák, Miroslav (referee)
There is a growing number of virtual agents in today's virtual worlds. This is directly related to the need of coordinating their behavior and movement. In this work we design algorithms to maintain desired formation of agents while moving through difficult terrain. The methods we study should maintain the requirements of the formation as well as traverse along various obstacles. We then use an arbitrary fitness function to compare the performance of these methods on typical scenarios.
|
|
|
Coordinated pathfinding with formations
Obrázek, Václav ; Surynek, Pavel (advisor) ; Balyo, Tomáš (referee)
The topic of cooperative pathfinding with the extension of formations is addressed in this thesis. The problem of cooperative pathfinding with formations was formally defined and a new scalable hierarchical modular solving algorithm named APriCA was introduced and implemented. For testing and benchmarking purposes an environment called ChessWars was developed. In order to measure the quality of maintaining formations we introduced a new quantity named "fragmentation". The APriCA algorithm performed better than external domain independent planners such as LPG, Blackbox and SASE in all aspects. In comparison with the LRA* algorithm the solutions found by APriCA were of better quality and with certain parameters settings were found faster.
|
|
|
Coordinated pathfinding with formations
Obrázek, Václav ; Surynek, Pavel (advisor) ; Balyo, Tomáš (referee)
The topic of cooperative pathfinding with the extension of formations is addressed in this thesis. The problem of cooperative pathfinding with formations was formally defined and a new scalable hierarchical modular solving algorithm named APriCA was introduced and implemented. For testing and benchmarking purposes an environment called ChessWars was developed. In order to measure the quality of maintaining formations we introduced a new quantity named "fragmentation". The APriCA algorithm performed better than external domain independent planners such as LPG, Blackbox and SASE in all aspects. In comparison with the LRA* algorithm the solutions found by APriCA were of better quality and with certain parameters settings were found faster.
|
|
|
Adaptive formations for virtual agents
Švagerka, Michal ; Plch, Tomáš (advisor) ; Čermák, Miroslav (referee)
There is a growing number of virtual agents in today's virtual worlds. This is directly related to the need of coordinating their behavior and movement. In this work we design algorithms to maintain desired formation of agents while moving through difficult terrain. The methods we study should maintain the requirements of the formation as well as traverse along various obstacles. We then use an arbitrary fitness function to compare the performance of these methods on typical scenarios.
|
guest ::
