61 citations · 243 across the 64 of their papers we have counts for
4 papers · 1 filter
Dynamic Adversarial Resource Allocation: the dDAB Game
Yue Guan, Daigo Shishika, Jason R. Marden +3
This work introduces the dynamic Defender-Attacker Blotto (dDAB) game, extending the classical static Blotto game to a dynamic resource allocation setting over graphs. In the dDAB…
CBS-Budget (CBSB): A Complete and Bounded Suboptimal Search for Multi-Agent Path Finding
Jaein Lim, Panagiotis Tsiotras
Multi-Agent Path Finding (MAPF) is the problem of finding a collection of collision-free paths for a team of multiple agents while minimizing some global cost, such as the sum of t…
Hierarchical Decompositions of Stochastic Pursuit-Evasion Games
Yue Guan, Mohammad Afshari, Qifan Zhang +1
In this work we present a hierarchical framework for solving discrete stochastic pursuit-evasion games (PEGs) in large grid worlds. With a partition of the grid world into supersta…
MAMS-A*: Multi-Agent Multi-Scale A*
Jaein Lim, Panagiotis Tsiotras
We present a multi-scale forward search algorithm for distributed agents to solve single-query shortest path planning problems. Each agent first builds a representation of its own…