Thesis Details
Multiagentní a optimalizační metody pro hry typu Stealth
This bachelor thesis deals with the opponents' behaviour in stealth-based video games. It's main focus is the credibility of said behaviour in comparison to the opponents' real life counterparts and the overall immersiveness of the experience. The thesis describes the usage of the A* algorithm for dynamic pathfinding in a two-dimensional space. Furthermore it describes the opponents' patrolling system, their ability to detect the player's presence and also their ability to cooperate and communicate while trying to chase the player down. One playable level demonstrating the described behaviour has also been created as part of this thesis using the C++ language. The thesis can be used as an inspiration for anyone interested in making their own intelligent systems for computer games of a similar type.
stealth, sneaking, silent, game, video game, computer game, navigation, pathfinding, a star, artificial intelligence, intelligent system, ai, detection, cooperation, flanking, hierarchical pathfinding, chase, agent, multiagent
Grégr Matěj, Ing., Ph.D. (DIFS FIT BUT), člen
Hradiš Michal, Ing., Ph.D. (DCGM FIT BUT), člen
Kekely Lukáš, Ing., Ph.D. (DCSY FIT BUT), člen
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS FIT BUT), člen
@bachelorsthesis{FITBT22907, author = "Jan L\'{a}nco\v{s}", type = "Bachelor's thesis", title = "Multiagentn\'{i} a optimaliza\v{c}n\'{i} metody pro hry typu Stealth", school = "Brno University of Technology, Faculty of Information Technology", year = 2020, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/22907/" }