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 MAPF algorithms from artificial intelligence for moving such non-homogeneous teams in congested video game environments.
@article{arxiv.1710.01447,
title = {Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments},
author = {Hang Ma and Jingxing Yang and Liron Cohen and T. K. Satish Kumar and Sven Koenig},
journal= {arXiv preprint arXiv:1710.01447},
year = {2017}
}