Skip navigation
Skip navigation

Fast and optimal pathfinding

Harabor, Daniel Damir


Pathfinding (or navigating) from A to B is a common problem in Computer Science with broad practical applications in areas as diverse as digital entertainment, logistics and robotics. Pathfinding is made difficult when many variations, or symmetries, of the same path exist. Symmetry slows down search by forcing otherwise performant algorithms to waste time considering many equivalent states. We speed things up by developing new online and offline symmetry-breaking techniques that eliminate a...[Show more]

CollectionsOpen Access Theses
Date published: 2014
Type: Thesis (PhD)
DOI: 10.25911/5d611e273981b
Access Rights: Open Access


File Description SizeFormat Image
b36002203_Harabor_D_D.pdf63.43 MBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator