2000 character limit reached
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments
Published 4 Oct 2017 in cs.AI, cs.MA, and cs.RO | (1710.01447v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.