Zobrazeno 1 - 10
of 103
pro vyhledávání: '"Sturtevant, Nathan"'
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
Traditional search algorithms have issues when applied to games of imperfect information where the number of possible underlying states and trajectories are very large. This challenge is particularly evident in trick-taking card games. While state sa
Externí odkaz:
http://arxiv.org/abs/2404.13150
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
Historically applied exclusively to perfect information games, depth-limited search with value functions has been key to recent advances in AI for imperfect information games. Most prominent approaches with strong theoretical guarantees require subga
Externí odkaz:
http://arxiv.org/abs/2311.14651
Publikováno v:
Proceedings of the 17th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment 2021 (AIIDE-21)
Among academic communities there is no single agreed upon definition of a quest. The industry perspective on this topic is also largely unknown. Thus, thee purpose of this paper is to gain an understanding of the definition of a quest from industry p
Externí odkaz:
http://arxiv.org/abs/2110.04148
Publikováno v:
Proceedings of the 17th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment 2021 (AIIDE-21)
Mixed-initiative Procedural Content Generation (PCG) refers to tools or systems in which a human designer works with an algorithm to produce game content. This area of research remains relatively under-explored, with the majority of mixed-initiative
Externí odkaz:
http://arxiv.org/abs/2110.04147
Autor:
Atzmon, Dor, Felner, Ariel, Li, Jiaoyang, Shperberg, Shahaf, Sturtevant, Nathan, Koenig, Sven
Publikováno v:
In Artificial Intelligence September 2023 322
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
We tackle two long-standing problems related to re-expansions in heuristic search algorithms. For graph search, A* can require $\Omega(2^{n})$ expansions, where $n$ is the number of states within the final $f$ bound. Existing algorithms that address
Externí odkaz:
http://arxiv.org/abs/1907.13062
Autor:
Stern, Roni, Sturtevant, Nathan, Felner, Ariel, Koenig, Sven, Ma, Hang, Walker, Thayne, Li, Jiaoyang, Atzmon, Dor, Cohen, Liron, Kumar, T. K. Satish, Boyarski, Eli, Bartak, Roman
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 without colliding with each other. Applications of MAPF include automated w
Externí odkaz:
http://arxiv.org/abs/1906.08291