π
π
The Cartographer
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments
October 04, 2017 Β· Declared Dead Β· π Artificial Intelligence and Interactive Digital Entertainment Conference
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig
arXiv ID
1710.01447
Category
cs.AI: Artificial Intelligence
Cross-listed
cs.MA,
cs.RO
Citations
80
Venue
Artificial Intelligence and Interactive Digital Entertainment Conference
Last Checked
3 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Artificial Intelligence
R.I.P.
π»
Ghosted
Explanation in Artificial Intelligence: Insights from the Social Sciences
R.I.P.
π»
Ghosted
Federated Machine Learning: Concept and Applications
R.I.P.
π»
Ghosted
Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPR
R.I.P.
π»
Ghosted
DeepAR: Probabilistic Forecasting with Autoregressive Recurrent Networks
R.I.P.
π»
Ghosted
Rainbow: Combining Improvements in Deep Reinforcement Learning
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted