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

2017/10/04 by Hang Ma, Ma, Hang, Jingxing Yang +7 · 3 citations
Computer Science · #Artificial Intelligence (cs.AI) #Artificial Intelligence in Games #FOS: Computer and information sciences #Multi-Agent Systems and Negotiation #Multiagent Systems (cs.MA) #Robotic Path Planning Algorithms #Robotics (cs.RO)

paper · pdf · doi:10.48550/arxiv.1710.01447

openalex publication_date 2017/10/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Analyzing Planner Design Trade-offs for MAPF under Realistic Simulation
• Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and Delivery
• WinkTPG: An Execution Framework for Multi-Agent Path Finding Using Temporal Reasoning

Related

• Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios
• Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding
• MAPF-HD: Multi-Agent Path Finding in High-Density Environments
• Optimal Target Assignment and Path Finding for Teams of Agents
• Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks