Xiao Essay

5679 WordsAug 10, 201223 Pages
Efficient Triangulation-Based Pathfinding Department of Computing Science, University of Alberta Edmonton, Alberta, Canada T6G 2E8 {demyen|mburo}@cs.ualberta.ca Abstract In this paper we present a method for abstracting an environment represented using constrained Delaunay triangulations in a way that significantly reduces pathfinding search effort, as well as better representing the basic structure of the environment. The techniques shown here are ideal for objects of varying sizes and environments that are not axis-aligned or that contain many dead-ends, long corridors, or jagged walls that complicate other search techniques. In fact, the abstraction simplifies pathfinding to deciding to which side of each obstacle to go. This technique is suited to real-time computation both because of its speed and because it lends itself to an anytime algorithm, allowing it to work when varying amounts of resources are assigned to pathfinding. We test search algorithms running on both the base triangulation (Triangulation A* – TA*) and our abstraction (Triangulation Reduction A* – TRA*) against A* and PRA* on grid-based maps from the commercial games Baldur’s Gate and WarCraft III. We find that in these cases almost all paths are found much faster using TA*, and more so using TRA*. Douglas Demyen and Michael Buro Introduction Pathfinding continues to be a critical area in many fields, not least of which are robotics and games. For the former, it is important to have a technique that incorporates the size of the robot so that a path can be found which will not result in damage to the equipment. In the latter, it is of paramount importance that paths be found very quickly, as there is seldom much time alloted to pathfinding, and that the paths found be close to optimal, in order to give the illusion of intelligent movement. Our technique addresses both concerns, finding the majority

More about Xiao Essay

Open Document