h1

h2

h3

h4

h5
h6

001     1022411
005     20260310095934.0
024 7 _ |2 datacite_doi
|a 10.18154/RWTH-2025-10004
037 _ _ |a RWTH-2025-10004
041 _ _ |a English
082 _ _ |a 004
100 1 _ |0 P:(DE-82)943248
|a Meiser, Dominic Sebastian
|b 0
|u rwth
245 _ _ |a Multi‐agent path finding for reversible conveyors
|c by Dominic Sebastian Meiser
|h online
260 _ _ |a Aachen
|b RWTH Aachen University
|c 2025
300 _ _ |a 1 Online-Ressource : Illustrationen
336 7 _ |0 2
|2 EndNote
|a Thesis
336 7 _ |0 PUB:(DE-HGF)19
|2 PUB:(DE-HGF)
|a Master Thesis
|b master
|m master
336 7 _ |2 BibTeX
|a MASTERSTHESIS
336 7 _ |2 DRIVER
|a masterThesis
336 7 _ |2 DataCite
|a Output Types/Supervised Student Publication
336 7 _ |2 ORCID
|a SUPERVISED_STUDENT_PUBLICATION
500 _ _ |a Veröffentlicht auf dem Publikationsserver der RWTH Aachen University
502 _ _ |a Masterarbeit, RWTH Aachen University, 2025
|b Masterarbeit
|c RWTH Aachen University
|d 2025
|g Fak09
|o 2025-11-24
520 3 _ |l ger
520 _ _ |a Quantum computers contain qubits that need to be close to each other for certain operations. The SpinBus architecture is a quantum computer architecture that allows shuttling these qubits around on reversible conveyors. The connectivity, i.e. the number of qubits that can be close to each other, is limited to 2. This means that qubits need to be moved frequently. Also, a conveyor can have more than one qubit on it, which means that qubits cannot move independently. A compiler for this architecture needs to plan moving qubits with the specifics of the architecture in mind. This thesis investigates Q‐MAPF, an extension of Multi‐Agent Path Finding (MAPF) for application in qubit routing. We show poor performance in prior work, in terms of both time and memory usage, and explore ways to improve the performance. First, we approach the problem by exploiting symmetries, which turns out to not improve the performance. Then, we work on a more optimal constraint generation for CBS, an algorithm that can solve MAPF problems, which improves performance: The execution time is improved up to 2.5 times, and we can solve more problems than previously due to lower memory usage. Finally, we extend the problem to Q‐TAPF. Combined Target and Path Finding (TAPF) is an extension of MAPF where the destination of an agent is part of the optimisation problem. This has the potential to improve the quality of the result whilst reducing the runtime. While Q‐TAPF can show improvements of halving the execution time, it does not do so consistently.
|l eng
591 _ _ |a Germany
700 1 _ |0 P:(DE-82)IDM01580
|a Noll, Thomas
|b 1
|e Thesis advisor
|u rwth
700 1 _ |0 P:(DE-82)IDM00048
|a Katoen, Joost-Pieter
|b 2
|e Thesis advisor
|u rwth
700 1 _ |0 P:(DE-82)IDM07398
|a Hermanns, Roy
|b 3
|e Consultant
|u rwth
856 4 _ |u https://publications.rwth-aachen.de/record/1022411/files/1022411.pdf
|y OpenAccess
856 4 _ |u https://publications.rwth-aachen.de/record/1022411/files/1022411_AV.pdf
|y Restricted
909 C O |o oai:publications.rwth-aachen.de:1022411
|p openaire
|p open_access
|p VDB
|p driver
|p dnbdelivery
910 1 _ |0 I:(DE-588b)36225-6
|6 P:(DE-82)943248
|a RWTH Aachen
|b 0
|k RWTH
910 1 _ |0 I:(DE-588b)36225-6
|6 P:(DE-82)IDM01580
|a RWTH Aachen
|b 1
|k RWTH
910 1 _ |0 I:(DE-588b)36225-6
|6 P:(DE-82)IDM00048
|a RWTH Aachen
|b 2
|k RWTH
910 1 _ |0 I:(DE-588b)36225-6
|6 P:(DE-82)IDM07398
|a RWTH Aachen
|b 3
|k RWTH
914 1 _ |y 2025
915 _ _ |0 StatID:(DE-HGF)0510
|2 StatID
|a OpenAccess
920 1 _ |0 I:(DE-82)121310_20140620
|k 121310
|l Lehrstuhl für Softwaremodellierung und Verifikation (Informatik 2)
|x 0
980 1 _ |a FullTexts
980 _ _ |a I:(DE-82)121310_20140620
980 _ _ |a UNRESTRICTED
980 _ _ |a VDB
980 _ _ |a master

LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21