Multiagentní plánování cest per partes: automatická skladiště

• Thesis title in Czech: Multiagentní plánování cest per partes: automatická skladiště
• Thesis title in English: Multi-Agent Path Finding Per Partes: Automatic Warehouses
• Academic year of topic announcement: 2022/2023
• Thesis type: diploma thesis
• Thesis language: čeština
• Department: Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
• Supervisor: RNDr. Jiří Švancara, Ph.D.
• Author: hidden - assigned and confirmed by the Study Dept.
• Date of registration: 07.06.2023
• Date of assignment: 07.06.2023
• Confirmed by Study dept. on: 30.06.2023

Guidelines

A large number of agents need to be coordinated in autonomous warehouses to fulfill an ongoing stream of delivery tasks. The goal of this thesis is to design a novel approach to coordinate the agents in such a warehouse. The new method will be based on splitting the warehouse into independent sections, each governed by a subset of agents. The main contribution of the thesis is to develop ways of splitting and managing cooperation of the sections of the warehouse. Experimental comparison and evaluation will also be part of the thesis.

References

[1] 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.

[2] Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig. Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. AAAI 2021: 11272-11281.

[3] Poom Pianpak, Tran Cao Son. Improving Problem Decomposition and Regulation in Distributed Multi-Agent Path Finder (DMAPF). PRIMA 2022: 156-172.