Emergent Mind
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments
(1710.01447)
Published Oct 4, 2017
in
cs.AI
,
cs.MA
,
and
cs.RO
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 MAPF algorithms from artificial intelligence for moving such non-homogeneous teams in congested video game environments.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.