Algoritmy pro multi-agentní hledání cest s protivníkem
| Thesis title in Czech: | Algoritmy pro multi-agentní hledání cest s protivníkem |
|---|---|
| Thesis title in English: | Algorithms for adversarial multi-agent path finding |
| Key words: | MAPF|AMAPF|protivník|autonomní agent|diskrétní simulace |
| English key words: | MAPF|AMAPF|adversary|autonomous agent|discrete simmulation |
| Academic year of topic announcement: | 2023/2024 |
| Thesis type: | Bachelor's thesis |
| Thesis language: | čeština |
| Department: | Department of Theoretical Computer Science and Mathematical Logic (32-KTIML) |
| Supervisor: | Mgr. Marika Ivanová, Ph.D. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 15.03.2024 |
| Date of assignment: | 22.04.2024 |
| Confirmed by Study dept. on: | 22.04.2024 |
| Date and time of defence: | 06.09.2024 09:00 |
| Date of electronic submission: | 04.07.2024 |
| Date of submission of printed version: | 04.07.2024 |
| Date of proceeded defence: | 06.09.2024 |
| Opponents: | RNDr. Jakub Bulín, Ph.D. |
| Guidelines |
| The problem is defined by a graph and multiple mobile agents placed in its vertices. The agents are divided into two groups: defenders and attackers. Each attacker is given a target vertex in the graph. The aim of the defenders is to prevent the attackers from reaching their goal. The objective of this work is to implement several existing algorithms and design a few new methods and/or extensions of the existing methods. An experimental comparison of the considered methods should give an insight into the suitability of the methods for various types of instances. |
| References |
| David Silver. 2005. Cooperative pathfinding. In Proceedings of the First AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE'05). AAAI Press, 117–122.
Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Barták, Eli Boyarski: Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. SOCS 2019: 151-159 Ivanová, M.; Surynek, P. and Hirayama, K. (2018). Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination. In Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART; ISBN 978-989-758-275-2; ISSN 2184-433X, SciTePress, pages 184-191. Marika Ivanová, Pavel Surynek: Adversarial Cooperative Path-Finding: Complexity and Algorithms. ICTAI 2014: 75-82 |