Skip to main content
SpringerLink
Log in

Knowledge-Based Probability Maps for Covert Pathfinding

  • Conference paper
Motion in Games (MIG 2010)

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

Included in the following conference series:

Abstract

Virtual characters in computer games sometimes need to find a path from point A to point B while minimizing the risk of being spotted by an enemy. Visibility calculations of the environment are needed to accomplish this. While previous methods have focused on either general visibility calculations or calculations based only on current enemy positions, we suggest a method to incorporate the agent’s knowledge of previous enemy positions. By creating a probability distribution of the positions of the enemies and using this in the visibility calculation, we create a more accurate visibility map.

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. Batty, M.: Exploring isovist fields: space and shape in architectural and urban morphology. Environment and Planning B: Planning and Design 28, 123–150 (2001)

    Article  Google Scholar 

  2. Behnke, S.: Local multiresolution path planning. In: Polani, D., Browning, B., Bonarini, A., Yoshida, K. (eds.) RoboCup 2003. LNCS (LNAI), vol. 3020, pp. 332–343. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Benedikt, M.L.: To take hold of space: isovist fields. Environment and Planning B: Planning and Design 6(1), 47–65 (1979)

    Article  Google Scholar 

  4. Bittner, J., Wonka, P.: Visibility in computer graphics. Journal of Environmental Planning 30, 729–756 (2003)

    Article  Google Scholar 

  5. Cohen-or, D., Chrysanthou, Y., Silva, C.T., Durand, F.: A survey of visibility for walkthrough applications, tech. report (2000)

    Google Scholar 

  6. Geraerts, R., Overmars, M.: The corridor map method: A general framework for real-time high-quality path planning. Computer Animation and Virtual Worlds 18(2), 107–119 (2007)

    Article  Google Scholar 

  7. Geraerts, R., Schager, E.: Stealth-based path planning using corridor maps. In: Proc. Computer Animation and Social Agents, CASA 2010 (2010)

    Google Scholar 

  8. Johansson, A., Dell’Acqua, P.: Introducing time in behavior networks. In: Proceedings of 2010 IEEE Conference on Computational Intelligence and Games (CIG), pp. 297–304 (2010)

    Google Scholar 

  9. Johansson, A., Dell’Acqua, P.: Affective states in behavior networks. In: Plemenos, D., Miaoulis, G. (eds.) Intelligent Computer Graphics 2009. Studies in Computational Intelligence, vol. 240, pp. 19–39. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Karamouzas, I., Overmars, M.H.: Adding variation to path planning. Computer Animation and Virtual Worlds 19(3-4), 283–293 (2008)

    Article  Google Scholar 

  11. Lozano-Pérez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM 22(10), 560–570 (1979)

    Article  Google Scholar 

  12. Marzouqi, M., Jarvis, R.: Covert path planning for autonomous robot navigation in known environments. In: Proc. of the Australian Conference on Robotics and Automation (2003)

    Google Scholar 

  13. Marzouqi, M., Jarvis, R.: Covert robotics: Covert path planning in unknown environments. In: Proc. of the Australian Conference on Robotics and Automation (2003)

    Google Scholar 

  14. Obermeyer, K.J.: The VisiLibity library, r-1 (2008), http://www.VisiLibity.org

  15. Overmars, M., Karamouzas, I., Geraerts, R.: Flexible path planning using corridor maps. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 1–12. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Stenz, A.: Optimal and efficient path planning for partially-known environments. In: Proc. of the IEEE International Conference on Robotics and Automation, pp. 3310–3317 (1994)

    Google Scholar 

  17. Tozour, P.: Game programming gems 2, chap. 3.6. Cengage Learning (2001)

    Google Scholar 

  18. Van Bilsen, A.: How can serious games benefit from 3d visibility analysis? In: Proc. of International Simulation and Gaming Association 2009 (2009)

    Google Scholar 

  19. Van Bilsen, A.: Mathematical Explorations in Urban and Regional Design. Ph.D. thesis, Delft University of Technology, Netherlands (2008)

    Google Scholar 

  20. Van Bilsen, A., Stolk, E.: Solving error problems in visibility analysis for urban environments by shifting from a discrete to a continuous approach. In: ICCSA 2008: Proceedings of the 2008 International Conference on Computational Sciences and Its Applications, pp. 523–528. IEEE Computer Society Press, Washington (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Science and Technology, Linköping University, Sweden

    Anja Johansson & Pierangelo Dell’Acqua

Authors
  1. Anja Johansson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierangelo Dell’Acqua
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. VRLab, Ecole Polytechnique Fédérale de Lausanne, EPFL, 1015, Lausanne, Switzerland

    Ronan Boulic

  2. Dept. of Computer Science, University of Cyprus, 1678, Nicosia, Cyprus

    Yiorgos Chrysanthou

  3. School of Informatics, University of Edinburgh, EH8 9YL, Edinburgh, UK

    Taku Komura

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Johansson, A., Dell’Acqua, P. (2010). Knowledge-Based Probability Maps for Covert Pathfinding. In: Boulic, R., Chrysanthou, Y., Komura, T. (eds) Motion in Games. MIG 2010. Lecture Notes in Computer Science, vol 6459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16958-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16958-8_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16957-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation