Original title: Redukční řešiče pro multiagentní plánování cest: porovnání modelů
Translated title: Reduction-based Solvers for Multi-agent Pathfinding: Comparing Different Models
Authors: Ramesh, Samyuktha ; Švancara, Jiří (advisor) ; Barták, Roman (referee)
Document type: Bachelor's theses
Year: 2023
Language: eng
Abstract: - Samyuktha Ramesh Thesis Title: Reduction-based Solvers for Multi-agent Pathfinding: Comparing Different Models Multi-agent path finding (MAPF) is the problem of navigating a set of agents from their starting position to their respective goal position without any collisions. In this thesis, we provide an overview of the current approaches to solving MAPF. We implement six different encodings found in the literature using the Python programming language and the Glucose3 SAT solver. We run experiments on maps of different types and sizes to compare the performances of the encodings.
Keywords: multi-agent pathfinding|reduction-based solvers|SAT|makespan; multi-agent pathfinding|reduction-based solvers|SAT|makespan

Institution: Charles University Faculties (theses) (web)
Document availability information: Available in the Charles University Digital Repository.
Original record: http://hdl.handle.net/20.500.11956/183059

Permalink: http://www.nusl.cz/ntk/nusl-532172


The record appears in these collections:
Universities and colleges > Public universities > Charles University > Charles University Faculties (theses)
Academic theses (ETDs) > Bachelor's theses