Skip to main content
SpringerLink
Log in

Grid-Based Path-Finding

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2338))

Abstract

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 hexes. This paper introduces texes as an efficient representation of hexes. The search algorithms used are A* and iterative deepening A* (IDA*). Application-dependent properties dictate which grid representation and search algorithm will yield the best results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Forbus, J. Mahoney, and K. Dill. How qualitative spatial reasoning can improve strategy game AIs. AAAI Spring Symposium on Artificial Intelligence and Interactive Entertainment, pages 35–40, 2001.

    Google Scholar 

  2. P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybernet., 4(2):100–107, 1968.

    Article  Google Scholar 

  3. S. Johnson. Wild Things. Wired, pages 78–83, 2002. March issue.

    Google Scholar 

  4. R. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97–109, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Korf, M. Reid, and S. Edelkamp. Time complexity of iterative-deepening A*. Artificial Intelligence, 129(2):199–218, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Laird and M. van Lent. Human-level AI’s killer application: Interactive computer games. In AAAI National Conference, pages 1171–1178, 2000.

    Google Scholar 

  7. J. Pearl. Heuristics: Intelligent search strategies. In Addison-Wesley, 1984.

    Google Scholar 

  8. S. Rabin. A* Aesthetic Optimizations. Game Programming Gems. Charles River Media, pages 264–271, 2000.

    Google Scholar 

  9. B. Stout. Smart moves: Intelligent path-finding. Game Developer Magazine, (October):28–35, 1996.

    Google Scholar 

  10. D. Takahashi. Games get serious. Red Herring, (87):64–70, 2000. December 18 issue.

    Google Scholar 

  11. P. Yap. New Ideas in Pathfinding. PhD thesis, Department of Computing Science, University of Alberta. In preparation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Alberta, Edmonton, Canada, T6G 2E8

    Peter Yap

Authors
  1. Peter Yap
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science, University of Waterloo, 200 University Ave.W., Waterloo, Ontario, Canada, N2L 3G1

    Robin Cohen

  2. IIT - e-Business, National Research Council, Incutech Brunswick, 2 Garland Court, Frederiction, New Brunswick, Canada, E3B 6C2

    Bruce Spencer

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yap, P. (2002). Grid-Based Path-Finding. In: Cohen, R., Spencer, B. (eds) Advances in Artificial Intelligence. Canadian AI 2002. Lecture Notes in Computer Science(), vol 2338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47922-8_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-47922-8_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43724-6

  • Online ISBN: 978-3-540-47922-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation