Table of Contents Author Guidelines Submit a Manuscript
International Journal of Computer Games Technology
Volume 2008 (2008), Article ID 873913, 11 pages
Research Article

Hierarchical Pathfinding and AI-Based Learning Approach in Strategy Game Design

School of Computer Engineering, Nanyang Technological University, 50 Nanyang Avenue, Singapore, Singapore 639798

Received 10 October 2007; Accepted 26 February 2008

Academic Editor: Kok Wai Wong

Copyright © 2008 Le Minh Duc et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. K. D. Forbus, J. V. Mahoney, and K. Dill, “How qualitative spatial reasoning can improve strategy game AIs,” IEEE Intelligent Systems, vol. 17, no. 4, pp. 25–30, 2002. View at Publisher · View at Google Scholar
  2. E. Bethke, Game Development and Production, Wordware, Plano, Tex, USA, 2003.
  3. K. Forbus, “Qualitative reasoning,” in CRC Handbook of Computer Science and Engineering, pp. 715–733, CRC Press, Boca Raton, Fla, USA, 1996. View at Google Scholar
  4. A. G. Cohn, “Qualitative spatial representation and reasoning techniques,” in Proceedings of the 21st Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence (KI '97), vol. 1303 of Lecture Notes in Computer Science, pp. 1–30, Springer, Freiburg, Germany, September 1997. View at Publisher · View at Google Scholar
  5. A. Botea, M. Müller, and J. Schaeffer, “Near optimal hierarchical path-finding,” Journal of Game Development, vol. 1, no. 1, pp. 7–28, 2004. View at Google Scholar
  6. S. Rabin, “A speed optimizations,” in Game Programming Gems, M. DeLoura, Ed., pp. 272–287, Charles River Media, Rockland, Mass, USA, 2000. View at Google Scholar
  7. J. W. J. Williams, “Algorithm 232: heapsort,” Communications of the ACM, vol. 7, no. 6, pp. 347–348, 1964. View at Google Scholar
  8. R. W. Floyd, “Algorithm 113: treesort,” Communications of the ACM, vol. 5, no. 8, p. 434, 1962. View at Publisher · View at Google Scholar
  9. k. E. Iverson, “A programming Language,” John Wiley and Sons, New York, NY, USA, 1962. View at Google Scholar
  10. E. H. Friend, “Sorting on electronic computer systems,” Journal of the ACM, vol. 3, no. 3, pp. 134–168, 1956. View at Publisher · View at Google Scholar
  11. R. D. Dutton, “Weak-heap sort,” BIT Numerical Mathematics, vol. 33, no. 3, pp. 372–381, 1993. View at Publisher · View at Google Scholar
  12. J. Katajainen, “The ultimate heapsort,” Australian Computer Science Communications, vol. 20, no. 3, pp. 87–95, 1995. View at Google Scholar
  13. R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction, MIT Press, Cambridge, Mass, USA, 1998.
  14. I. Millington, Artificial Intelligence for Games, Morgan Kaufmann, San Mateo, Calif, USA, 2006.
  15. D. Michie, D. J. Spiegelhalter, and C. C. Taylor, Machine Learning, Neural and Statistical Classification, Prentice Hall, Upper Saddle River, NJ, USA, 1994.