Skip to main content
SpringerLink
Log in
Book cover

International Conference on Motion in Games

MIG 2012: Motion in Games pp 1–6Cite as

Moving Path Planning Forward

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 7660))

Abstract

Path planning technologies have rapidly improved over the last 10 years, but further integration is needed if pathfinding engines are to drive the behavior of even more realistic characters. This paper briefly outlines existing approaches for path planning and suggests scenarios where integration of information about character’s relationships could improve the quality of path planning in games.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hart, P., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4, 100–107 (1968)

    Article  Google Scholar 

  2. Zahavi, U., Felner, A., Schaeffer, J., Sturtevant, N.R.: Inconsistent heuristics. In: National Conference on Artificial Intelligence (AAAI 2007), pp. 1211–1216 (2007)

    Google Scholar 

  3. Sturtevant, N.: Memory-efficient abstractions for pathfinding, pp. 31–36 (2007)

    Google Scholar 

  4. Floyd, R.W.: Algorithm 97: Shortest path. Commun. ACM 5(6), 345 (1962)

    Article  Google Scholar 

  5. Sturtevant, N., Felner, A., Barer, M., Schaeffer, J., Burch, N.: Memory-based heuristics for explicit state spaces. In: International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 609–614 (2009)

    Google Scholar 

  6. Botea, A.: Ultra-fast Optimal Pathfinding without Runtime Search. In: Proceedings of the Conference on AI and Interactive Digital Entertainment (AIIDE 2011), pp. 122–127 (2011)

    Google Scholar 

  7. Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast Routing in Road Networks with Transit Nodes. Science 316, 566 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jurney, C.: Postprocessing for high-quality turns. In: AI Programming Wisdom 4. Charles River Media (2008)

    Google Scholar 

  9. Sturtevant, N.: Optimizing motion-constrained pathfinding (2009)

    Google Scholar 

  10. Snape, J., van den Berg, J.P., Guy, S.J., Manocha, D.: The hybrid reciprocal velocity obstacle. IEEE Transactions on Robotics 27(4), 696–706 (2011)

    Article  Google Scholar 

  11. Reynolds, C.W.: Flocks, herds and schools: A distributed behavioral model. In: Stone, M.C. (ed.) SIGGRAPH, pp. 25–34. ACM (1987)

    Google Scholar 

  12. Treuille, A., Cooper, S., Popovic, Z.: Continuum crowds. ACM Trans. Graph. 25(3), 1160–1168 (2006)

    Article  Google Scholar 

  13. Gayle, R., Moss, W., Lin, M.C., Manocha, D.: Multi-robot coordination using generalized social potential fields. In: ICRA, pp. 106–113. IEEE (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Denver, Denver, CO, USA

    Nathan R. Sturtevant

Authors
  1. Nathan R. Sturtevant
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering, University of California, Merced, 5200 N. Lake Road, 95343, Merced, CA, USA

    Marcelo Kallmann

  2. Department of Computer Science, Rutgers University, 110 Frelinghuysen Road, 08854, Piscataway, NJ, USA

    Kostas Bekris

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sturtevant, N.R. (2012). Moving Path Planning Forward. In: Kallmann, M., Bekris, K. (eds) Motion in Games. MIG 2012. Lecture Notes in Computer Science, vol 7660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34710-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34710-8_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34709-2

  • Online ISBN: 978-3-642-34710-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation