Pathfinding

Known as: List of algorithms used in pathfinding, Path finding, Pathing 
Pathfinding or pathing is the plotting, by a computer application, of the shortest route between two points. It is a more practical variant on… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2018
0204019762018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
The study of algorithms on grids has been widespread in a number of research areas. Grids are easy to implement and offer fast… (More)
  • figure 3
  • figure 1
  • figure 2
  • figure 4
  • table I
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Problems that require multiple agents to follow non-interfering paths from their current states to their respective goal states… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
Multi-agent pathfinding, where multiple agents must travel to their goal locations without getting stuck, has been studied in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
In the past few years the graphics programmable processor (GPU) has evolved into an increasingly convincing computational… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Pathfinding for commercial games is a challenging problem, and many existing methods use abstractions which lose details of the… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
2006
2006
In this paper we introduce the Biased Cost Pathfinding (BCP) algorithm as a simple yet effective meta-algorithm that can be fused… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Cooperative Pathfinding is a multi-agent path planning problem where agents must find non-colliding routes to separate… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2003
2003
One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement… (More)
  • figure 2.1
  • table 2.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
First-order learning systems (e.g., FOIL, FOCL, FORTE) generally rely on hill-climbing heuristics in order to avoid the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?