Rectangle expansion A∗ pathfinding for grid maps
نویسندگان
چکیده
منابع مشابه
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...
متن کاملComparison of Different Grid Abstractions for Pathfinding on Maps
Pathfinding on a map is a fundamental problem in many applications, including robotics and computer games. Typically a grid is superimposed over the map where each cell in the grid forms a unique state. A state-space-based search algorithm, such as A* or IDA*, is then used for finding the optimal (shortest) path. In this paper we analyze the search behavior of both A* and IDA* using different g...
متن کاملDirection Maps for Cooperative Pathfinding
Cooperative behavior is a desired trait in many fields from computer games to robotics. Yet, achieving cooperative behavior is often difficult, as maintaining shared information about the dynamics of agents in the world can be complex. We focus on the specific task of cooperative pathfinding and introduce a new approach based on the idea of “direction maps” that learns about the movement of age...
متن کاملApplication of A Route Expansion Algorithm for Transit Routes Design in Grid Networks
Establishing a network of transit routes with satisfactory demand coverage is one of the main goals of transitagencies in moving towards a sustainable urban development. A primary concern in obtaining such anetwork is reducing operational costs. This paper deals with the problem of minimizing construction costsin a grid transportation network while satisfying a certain level o...
متن کاملVideo Game Pathfinding and Improvements to Discrete Search on Grid-based Maps
The most basic requirement for any computer controlled game agent in a video game is to be able to successfully navigate the game environment. Pathfinding is an essential component of any agent navigation system. Pathfinding is, at the simplest level, a search technique for finding a route between two points in an environment. The real-time multi-agent nature of video games places extremely tig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Journal of Aeronautics
سال: 2016
ISSN: 1000-9361
DOI: 10.1016/j.cja.2016.04.023