This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 2Pathfinding
- 1Algorithm
- 1Anchor Search
- 1Bidirectional Search
- 1Front-to-front Heuristic
- 1Heuristic Search
-
Spring 2024
In recent years, significant strides in optimal bidirectional heuristic search (Bi-HS) have deepened our theoretical understanding and boosted performance. Yet, algorithms for Bi-HS in unbounded suboptimal scenarios remains largely unexplored. Despite leveraging front-to-end (F2E) and...
-
Fall 2011
Multi-agent pathfinding problems involve finding plans for agents that must travel from their start locations to their targets without colliding. Recent work produced a number of algorithms to solve the problem as well as an ample supply of related theory. This work is based on a related work...