Path-finding for large scale multiplayer computer games

2nd International North-American Conference on Intelligent Games and Simulation, Game-On 'NA 2006

Volumn , Issue , 2006, Pages 26-33

  Lanctot, Marc ^a   Verbrugge, Clark ^a   Sun, Nicolas Ng Man ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Caching; Computer Games; Multiplayer; Path finding

Indexed keywords

COMPUTER GAMES; OPTIMIZATION;

CACHING; GAME DESIGN; HIERARCHICAL PATH FINDINGS; MULTIPLAYER COMPUTER GAMES; MULTIPLAYER GAMES; MULTIPLAYERS; PATHFINDING; WORKLOAD VARIATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84898614439     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. O. B. Bayazit, J-M Lien, and N. M. Amato. Roadmap-based flocking for complex environments. In The Pacific Conference on Computer Graphics and App. (PG), pages 104-113, Oct 2002.
2. A. Botea, M. Mullor, and J. Schaoffcr. Near optimal hierarchical path-finding. Journal of Game Development, 1:7-28, 2004.
3. D. Z. Chen, R. J. Szczerba, and J. J. Urban Jr. Planning conditional shortest paths through an unknown en-vironment: a framed-quadtrec approach. In IEEE/RJS International Conference on Intelligent Robots and Systems (IROS 95), volume 3, pages 33-38, Aug 1995.
4. I. L. Davis. Warp speed: Path planning for star trek armada. In AAAI 2000 Spring Symposium on Interactive Entertainment and AI, pages 18-21, March 2000.
5. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSCJt (2), pages 100-107, 1968.
6. R. C. Holte, M. B. Perez, R. M. Zimmer, and A. J. MacDonald. Hierarchical A: Searching abstraction hierarchies efficiently. In The Thirteenth National Conference on Artificial Intelligence (AAAI-96), pages 530 535, 1996.
7. L. E. Kavraki, P. Svestka, J. C. Latombe, and M. H.Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics & Automation, pages 566-580, June 1996.
8. O. Khatib. Real-time obstacle avoidance for manipulators and mobile robots. In IEEE International Conference on Robotics and Automation, volume 2, pages 500 505, 1985.
9. R. Korf. Depth-first iterative deepening: An optimal admissible tree search. In Artificial Intelligence, pages 97-109, 1985.
10. D. Maio and S. Rizzi. A hybrid approach to path planning in autonomous agents. In Second International Conference, on Expert Systems for Development, pages 222 227, 1994.
11. McGill University. Mammoth: The massively multi-player prototype. http://mammoth.cs.mcgill.ca, Aug 2005.
12. C. Niederberger, D. Radovic, and M. Gross. Generic path planning for real-time applications. In Computer Graphics International (CGI'04), pages 299-306, 2004.
13. Amit Patel. Amit's thoughts on path-finding and A-star. http://theory.stanford.edu/amitp/GameProgramming/, 2003.
14. D. C. Pottinger. Terrain analysis in realtime strategy games. In Computer Game Developers Conference, 2000.
15. C. Reynolds. Steering behaviors for autonomous characters. In Computer Game Developers Conference, pages 763-782, 1999.
16. N. Sturtevant and M. Buro. Partial pathfinding using map abstraction and refinement. In The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, 2005.
17. Peter Yap. Grid-based path-finding. In AI '02: Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence, pages 44-55. Springer-Verlag, 2002.