5 citations · 7 across the 5 of their papers we have counts for
6 papers
On the Completeness of Conflict-Based Search: Temporally-Relative Duplicate Pruning
Thayne T Walker, Nathan R Sturtevant
Conflict-Based Search (CBS) algorithm for the multi-agent pathfinding (MAPF) problem is that it is incomplete for problems which have no solution; if no mitigating procedure is run…
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search
Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner
While the study of unit-cost Multi-Agent Pathfinding (MAPF) problems has been popular, many real-world problems require continuous time and costs due to various movement models. In…
Multi-Object Tracking with Deep Learning Ensemble for Unmanned Aerial System Applications
Wanlin Xie, Jaime Ide, Daniel Izadi +7
Multi-object tracking (MOT) is a crucial component of situational awareness in military defense applications. With the growing use of unmanned aerial systems (UASs), MOT methods fo…
Hierarchical Reinforcement Learning for Air Combat at DARPA's AlphaDogfight Trials
Adrian P. Pope, Jaime S. Ide, Daria Micovic +7
Autonomous control in high-dimensional, continuous state spaces is a persistent and important challenge in the fields of robotics and artificial intelligence. Because of high risk…
Collision Detection for Agents in Multi-Agent Pathfinding
Thayne T. Walker, Nathan R. Sturtevant
Recent work on the multi-agent pathfinding problem (MAPF) has begun to study agents with motion that is more complex, for example, with non-unit action durations and kinematic cons…
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Roni Stern, Nathan Sturtevant, Ariel Felner +9
The MAPF problem is the fundamental problem of planning paths for multiple agents, where the key constraint is that the agents will be able to follow these paths concurrently witho…