Grid-Based Path-Finding

@inproceedings{Yap2002GridBasedP,
  title={Grid-Based Path-Finding},
  author={Peter Yap},
  booktitle={Canadian Conference on AI},
  year={2002}
}
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 region, and a graph search is used to find the optimal (minimal cost) path. The most common scenario is to use a grid of tiles and to search using A*. This paper discusses the tradeoffs for different grid representations and grid search algorithms. Grid representations discussed are 4-way tiles, 8-way tiles, and… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 66 CITATIONS, ESTIMATED 96% COVERAGE

Automatic search space generation with Hierarchical Adaptive Flood Filled for simulation and computer game in confined environment

  • 13th International Conference on Advanced Communication Technology (ICACT2011)
  • 2011
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Assessing Raster GIS Approximation for Euclidean Shortest Path Routing

  • Trans. GIS
  • 2016
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Fast and Optimal Pathfinding

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Planning of Diverse Trajectories

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A Modified Fuzzy A* Based Inference System for Path Planning in an Unknown Environment

  • 2018 2nd International Conference on Trends in Electronics and Informatics (ICOEI)
  • 2018
VIEW 1 EXCERPT
CITES METHODS

FILTER CITATIONS BY YEAR

2002
2019

CITATION STATISTICS

  • 4 Highly Influenced Citations

  • Averaged 5 Citations per year from 2017 through 2019

References

Publications referenced by this paper.