Table of Contents Author Guidelines Submit a Manuscript
International Journal of Computer Games Technology
Volume 2009, Article ID 745219, 6 pages
Research Article

Performance Simulations of Moving Target Search Algorithms

1Division of Computer Science, School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798
2Department of Computing and Mathematics, Manchester Metropolitan University, Chester Street, Manchester M1 5GD, UK

Received 9 April 2008; Revised 9 July 2008; Accepted 25 September 2008

Academic Editor: Kok Wai Wong

Copyright © 2009 Peter K. K. Loh and Edmond C. Prakash. 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. Hellgate Alliance, “The Official Hellgate: London Community Site for South East Asia, offering community, news, information, contests, guides, and more,” September 2008,
  2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, MIT Press and McGraw-Hill, Boston, Mass, USA, 2nd edition, 2001.
  3. A. J. Patel, “Amit's Game Programming,” September 2006,
  4. D. C. Pottinger, “Terrain analysis in realtime strategy games,” in Proceedings of Computer Game Developers Conference (CGDC '00), 2000.
  5. S. Koenig, “A comparison of fast search methods for real-time situated agents,” in Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS '04), vol. 2, pp. 864–871, IEEE Computer Society, New York, NY, USA, August 2004. View at Publisher · View at Google Scholar
  6. T. Ishida and M. Shimbo, “Improving the learning efficiencies of realtime search,” in Proceedings of the 13th National Conference on Artificial Intelligence (AAAI '96), vol. 1, pp. 305–310, Portland, Ore, USA, August 1996.
  7. S. Rabin, AI Game Programming Wisdom, Charles River Media, Rockland, Mass, USA, 2002.
  8. T. C. H. John, E. C. Prakash, and N. S. Chaudhari, “Strategic team AI path plans: probabilistic pathfinding,” International Journal of Computer Games Technology, vol. 2008, Article ID 834616, 6 pages, 2008. View at Publisher · View at Google Scholar
  9. V. Bulitko and G. Lee, “Learning in real-time search: a unifying framework,” Journal of Artificial Intelligence Research, vol. 25, pp. 119–157, 2006. View at Google Scholar
  10. T. Ishida and R. E. Korf, “Moving-target search: a real-time search for changing goals,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 6, pp. 609–619, 1995. View at Publisher · View at Google Scholar
  11. R. E. Korf, “Artificial intelligence search algorithms,” in Handbook of Algorithms and Theory of Computation, CRC Press, Boca Raton, Fla, USA, 1999. View at Google Scholar
  12. M. Shimbo and T. Ishida, “Controlling the learning process of real-time heuristic search,” Artificial Intelligence, vol. 146, no. 1, pp. 1–41, 2003. View at Publisher · View at Google Scholar
  13. Think Labyrinth: Computer Mazes, September 2008,