Fast and optimal pathfinding
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]
|Collections||Open Access Theses|
|Access Rights:||Open Access|
|b36002203_Harabor_D_D.pdf||63.43 MB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.