arXiv:1710.01447
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments
著者: Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig
分類: cs.AI, cs.MA, cs.RO
原文アブストラクト
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.