Skip to main content
SpringerLink
Log in

Directed Recursion Search: A Directed DFS for Online Pathfinding in Random Grid-Based Environments

  • Conference paper
  • First Online:
Artificial Intelligence XXXV (SGAI 2018)

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

  • 2535 Accesses

Abstract

The most popular pathfinding approach used in video games is the A* algorithm. This paper looks at depth-first search to determine if, with modifications, it can be made into a viable alternative. Proposed is a method of directing a search, which utilises a scoring system. Tests conducted on randomly generated maps of varying sizes showed that Directed Recursion Search calculated near-optimal paths in less time, by expanding fewer nodes, and with less memory required to store the paths, than A* or depth-first search.

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 EPUB and 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

References

  1. Algfoor, Z.A., Sunar, M.S., Abdullah, A.: A new weighted pathfinding algorithm to reduce the search time on grid maps. Expert Syst. Appl. 71, 319–331 (2017)

    Article  Google Scholar 

  2. Mathew, G.E., Malathy, G.: Direction based heuristic for pathfinding in video games. In: 2nd International Conference on Electronics and Communication Systems, ICECS 2015, pp. 1651–1657 (2015)

    Google Scholar 

  3. Cui, X., Shi, H.: An overview of pathfinding in navigation mesh. Int. J. Comput. Sci. Netw. Secur. 12, 48–51 (2012)

    Google Scholar 

  4. Valenzano, R., Arfaee, S.J., Thayer, J., Stern, R., Sturtevant, N.R.: Using alternative suboptimality bounds in heuristic search. In: Association for the Advancement of Artificial Intelligence (2013)

    Google Scholar 

  5. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. Trans. Syst. Sci. Cybern. SSC4, 100–107 (1968)

    Article  Google Scholar 

  6. Cui, X., Shi, H.: A*-based pathfinding in modern computer games. Int. J. Comput. Sci. Netw. Secur. 11, 125–130 (2011)

    Google Scholar 

  7. Nash, A., Koenig, S.: Theta* for any-angle pathfinding. In: Game AI Pro 2. CRC Press (2015)

    Google Scholar 

  8. Graham, T., McCabe, H., Sheridan, S.: Pathfinding in computer games. ITB J. 4, 57–81 (2003)

    Google Scholar 

  9. Tarjan, R.: Depth-first search and linear graph algorithms. In: IEEE Switching and Automata Theory, pp. 114–121. Stanford University, California (1971)

    Google Scholar 

  10. Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. In: Artificial Intelligence 27, pp. 97–109. Elsevier Science Publishers (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and Digital Technologies, Staffordshire University, Stoke-on-Trent, ST4 2DE, UK

    Paul M. Roberts

Authors
  1. Paul M. Roberts
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paul M. Roberts .

Editor information

Editors and Affiliations

  1. University of Portsmouth, Portsmouth, UK

    Max Bramer

  2. Middlesex University, London, UK

    Miltos Petridis

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Roberts, P.M. (2018). Directed Recursion Search: A Directed DFS for Online Pathfinding in Random Grid-Based Environments. In: Bramer, M., Petridis, M. (eds) Artificial Intelligence XXXV. SGAI 2018. Lecture Notes in Computer Science(), vol 11311. Springer, Cham. https://doi.org/10.1007/978-3-030-04191-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-04191-5_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-04190-8

  • Online ISBN: 978-3-030-04191-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation