Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments

Authors

  • Hang Ma University of Southern California
  • Jingxing Yang University of Southern California
  • Liron Cohen University of Southern California
  • T. K. Kumar University of Southern California
  • Sven Koenig University of Southern California

DOI:

https://doi.org/10.1609/aiide.v13i1.12919

Keywords:

multi-agent path finding, moving in formation, target assignment

Abstract

Multi-agent path finding (MAPF) is a well-studied problem in artificial intelligence, where one needs to find collision-free paths for agents with given start and goal locations. In video games, agents of different types often form teams. In this paper, we demonstrate the usefulness of MAPFalgorithms from artificial intelligence for moving such non-homogeneous teams in congested video game environments.

Downloads

Published

2021-06-25

How to Cite

Ma, H., Yang, J., Cohen, L., Kumar, T. K., & Koenig, S. (2021). Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 13(1), 270-272. https://doi.org/10.1609/aiide.v13i1.12919

Issue

Vol. 13 No. 1 (2017): Thirteenth Artificial Intelligence and Interactive Digital Entertainment Conference

Section

Demonstrations