ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1710.01447
  4. Cited By
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game
  Environments

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

4 October 2017
Hang Ma
Jingxing Yang
L. Cohen
T. K. S. Kumar
Sven Koenig
ArXiv (abs)PDFHTML

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

4 / 4 papers shown
Title
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks
Hang Ma
Jiaoyang Li
T. K. S. Kumar
Sven Koenig
47
252
0
30 May 2017
Overview: Generalizations of Multi-Agent Path Finding to Real-World
  Scenarios
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios
Hang Ma
Sven Koenig
Nora Ayanian
L. Cohen
Wolfgang Hönig
T. K. S. Kumar
T. Uras
Hong Xu
C. Tovey
Guni Sharon
AI4CE
78
98
0
17 Feb 2017
MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability
  and Completeness Guarantees
MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees
Koping Wang
A. Botea
84
183
0
16 Jan 2014
Planning Optimal Paths for Multiple Robots on Graphs
Planning Optimal Paths for Multiple Robots on Graphs
Jingjin Yu
Steven M. Lavalle
87
176
0
17 Apr 2012
1