Advances in Pathfinding Algorithms for Games, Route Planning Software, and Automated Warehouses

The pathfinding problem is a fundamental challenge in artificial intelligence, with numerous real-world applications across a variety of environments and domains. Many of these applications involve a large number of users, making it crucial to solve the pathfinding problem efficiently in order to ensure scalability. In this dissertation, we focus on the pathfinding problems in three distinct applications: computer games, route planning software, and automated warehouses. Our research has contributed a number of efficient and effective pathfinding algorithms that advance the state-of-the-art in each of these areas.