Any-angle path planning

Known as: Anyangle search, Any-angle planning, Theta* 
Any-angle path planning algorithms search for paths on a cell decomposition of a continuous configuration space (such as a two-dimensional terrain).
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2017
024619992017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We compare five any-angle path-planning algorithms, Theta*, Block A*, Field D*, ANYA, and Any-Angle Subgoal Graphs in terms of… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
Review
2013
Review
2013
In robotics and video games, one often discretizes continuous terrain into a grid with blocked and unblocked grid cells and then… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2012
2012
Most path planning algorithms for a marine surface vehicle in the ocean environment have been developed only for a 2-D (x,y… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2011
2011
Path planning is a critical part of modern computer games; rare is the game where nothing moves and path planning is not… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 4
Is this relevant?
2011
2011
We present three new ideas for grid-based path-planning algorithms that improve the search speed and quality of the paths found… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2011
2011
Block A* and Any-angle Path-Planning Peter Yap and Neil Burch and Robert C. Holte and Jonathan Schaeffer Computing Science… (More)
  • figure 1
  • table 2
  • table 1
Is this relevant?
2010
2010
Grids with blocked and unblocked cells are often used to represent continuous 2D and 3D environments in robotics and video games… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
A* on grid maps generates a path with zig-zag pattern as shown in Figure 1(a). Theta* had been proposed to produce a natural and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
We study path planning on grids with blocked and unblocked cells. Any-angle path-planning algorithms find short paths fast… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Grids with blocked and unblocked cells are often used to represent terrain in computer games and robotics. However, paths formed… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?