Pathfinding Algorithm Efficiency Analysis in 2D Grid
نویسندگان
چکیده
منابع مشابه
Modified Fixed Grid Finite Element Method in the Analysis of 2D Linear Elastic Problems
In this paper, a modification on the fixed grid finite element method is presented and used in the solution of 2D linear elastic problems. This method uses non-boundary-fitted meshes for the numerical solution of partial differential equations. Special techniques are required to apply boundary conditions on the intersection of domain boundaries and non-boundary-fitted elements. Hence, a new met...
متن کاملModified Fixed Grid Finite Element Method in the Analysis of 2D Linear Elastic Problems
In this paper, a modification on the fixed grid finite element method is presented and used in the solution of 2D linear elastic problems. This method uses non-boundary-fitted meshes for the numerical solution of partial differential equations. Special techniques are required to apply boundary conditions on the intersection of domain boundaries and non-boundary-fitted elements. Hence, a new met...
متن کاملBackward Real Time Heuristic Search in Grid World Pathfinding
The A* algorithm works well for problems where the solution can be computed offline. In the real time search paradigm, an algorithm must compute the solution online: computation time is not free. Real time heuristic search is search in which the goal is to calculate a plan as close to an optimal plan as possible with the constraint that the algorithm executes an action after each tick of comput...
متن کاملAn Optimal Any-Angle Pathfinding Algorithm
Any-angle pathfinding is a common problem from robotics and computer games: it requires finding a Euclidean shortest path between a pair of points in a grid map. Prior research has focused on approximate online solutions. A number of exact methods exist but they all require supra-linear space and preprocessing time. In this paper we describe Anya: a new optimal any-angle pathfinding algorithm w...
متن کاملOnline Graph Pruning for Pathfinding On Grid Maps
Pathfinding in uniform-cost grid environments is a problem commonly found in application areas such as robotics and video games. The state-of-the-art is dominated by hierarchical pathfinding algorithms which are fast and have small memory overheads but usually return suboptimal paths. In this paper we present a novel search strategy, specific to grids, which is fast, optimal and requires no mem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Environment. Technology. Resources. Proceedings of the International Scientific and Practical Conference
سال: 2015
ISSN: 2256-070X,1691-5402
DOI: 10.17770/etr2013vol2.868