Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract)

Fairbairn, David

Abstract

I specialise in conducting research in Multi-Agent Path- Finding (MAPF) and Algorithmic Graph Theory. Specifically, I investigate the impact of geometric constraints on a given instance of MAPF, as well as the expansion of MAPF to include resource constraints, target assignment path-finding (TAPF), and academic problems that are relevant to industry. In Algorithmic Graph Theory, I extend the capabilities of standard and novel MAPF solvers to temporal graphs, and explore clustering techniques and ideas that utilise Graph Classifications on MAPF domains to reduce the computational complexity of MAPF. Furthermore, I research the implementation and application of massively parallelized computing techniques on MAPF, especially in relation to distance matrix computation and parallelized centralized MAPF. Aside from my PhD research, I have the pleasure to collaborate with researchers at Tharsus Limited, to directly apply my research to novel industrial problems and develop benchmarks that are relevant to both the industry and the research community for Multi-Agent Systems.

Citation

Fairbairn, D. (2023). Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract). In Proceedings of the International Symposium on Combinatorial Search (190-191). https://doi.org/10.1609/socs.v16i1.27308

• Conference Name: Sixteenth International Symposium on Combinatorial Search
• Conference Location: Prague, Czech Republic
• Start Date: Jul 14, 2023
• End Date: Jul 16, 2023
• Acceptance Date: May 10, 2023
• Online Publication Date: Jul 2, 2023
• Publication Date: 2023
• Deposit Date: Sep 29, 2023
• Publicly Available Date: Oct 2, 2023
• Publisher: AAAI Press
• Volume: 16
• Pages: 190-191
• Book Title: Proceedings of the International Symposium on Combinatorial Search
• ISBN: 9781577358824
• DOI: https://doi.org/10.1609/socs.v16i1.27308
• Public URL: https://durham-repository.worktribe.com/output/1753410