Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Walker, Thayne T."'
Autor:
Walker, Thayne T, Sturtevant, Nathan R
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 in parallel, CBS will run forever when given an unsolvable problem in
Externí odkaz:
http://arxiv.org/abs/2408.09028
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 this context, this paper studies symmetry-breaking enhancements for C
Externí odkaz:
http://arxiv.org/abs/2312.16106
Autor:
Pope, Adrian P., Ide, Jaime S., Micovic, Daria, Diaz, Henry, Rosenbluth, David, Ritholtz, Lee, Twedt, Jason C., Walker, Thayne T., Alcedo, Kevin, Javorsek, Daniel
Artificial Intelligence (AI) is becoming a critical component in the defense industry, as recently demonstrated by DARPA`s AlphaDogfight Trials (ADT). ADT sought to vet the feasibility of AI algorithms capable of piloting an F-16 in simulated air-to-
Externí odkaz:
http://arxiv.org/abs/2105.00990
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 constraints. An important aspect of MAPF is collision detection. Many coll
Externí odkaz:
http://arxiv.org/abs/1908.09707