Machine Learning

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

Tagged: , ,

This topic contains 0 replies, has 1 voice, and was last updated by  arXiv 1 year, 2 months ago.


  • arXiv
    5 pts

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

    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.

    Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments
    by Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig
    https://arxiv.org/pdf/1710.01447v1.pdf

You must be logged in to reply to this topic.