A* is a search algorithm that has long been used in the pathfinding research community. Its
efficiency, simplicity, and modularity are often highlighted as its strengths compared to other …

Pathfinding in computer games has been investigated for many years. It is probably the most
popular but frustrating game artificial intelligence (AI) problem in game industry. Various …

We describe a pathfinding system based on Jump Point Search (JPS): a recent and very
successful search strategy that performs symmetry breaking to speed up optimal pathfinding …

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 …

We study the point-to-point shortest path problem in a setting where preprocessing is
allowed. We improve the reach-based approach of Gutman [17] in several ways. In …

In this paper, we conduct a detailed study of the arc-flag approach introduced in [Lau97,
Lau04]. Arc-flags are a modification of Dijkstra's algorithm to accelerate point-to-point (p2p) …

Path-finding is an important problem for many applications, including network traffic, robot
planning, military simulations, and computer games. Typically, a grid is superimposed over a …

We present a directed search algorithm, called K⁎, for finding the k shortest paths between a
designated pair of vertices in a given directed weighted graph. K⁎ has two advantages …

In obstacle spatial path planning, the traditional A* algorithm has the problem of too many
turning points and slow search speed. With this in mind, a path planning method that …

As one form of the greedy algorithm, Dijkstra's can handle the shortest path search with
optimum result in longer search time. Dijkstra's is contrary to A-Star, a best-first search …