124 citations · 203 across the 11 of their papers we have counts for
9 papers · 1 filter
Solving Witness-type Triangle Puzzles Faster with an Automatically Learned Human-Explainable Predicate
Justin Stevens, Vadim Bulitko, David Thue
Automatically solving puzzle instances in the game The Witness can guide players toward solutions and help puzzle designers generate better puzzles. In the latter case such an Arti…
Automatic Algorithm Selection In Multi-agent Pathfinding
Devon Sigurdson, Vadim Bulitko, Sven Koenig +2
In a multi-agent pathfinding (MAPF) problem, agents need to navigate from their start to their goal locations without colliding into each other. There are various MAPF algorithms,…
Flow for Meta Control
Vadim Bulitko
The psychological state of flow has been linked to optimizing human performance. A key condition of flow emergence is a match between the human abilities and complexity of the task…
Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding
Vadim Bulitko, Yngvi Björnsson, Ramon Lawrence
Real-time heuristic search algorithms satisfy a constant bound on the amount of planning per action, independent of problem size. As a result, they scale up well as problems become…
Search-Space Characterization for Real-time Heuristic Search
Daniel Huntley, Vadim Bulitko
Recent real-time heuristic search algorithms have demonstrated outstanding performance in video-game pathfinding. However, their applications have been thus far limited to that dom…
Speeding Up Planning in Markov Decision Processes via Automatically Constructed Abstractions
Alejandro Isaza, Csaba Szepesvari, Vadim Bulitko +1
In this paper, we consider planning in stochastic shortest path (SSP) problems, a subclass of Markov Decision Problems (MDP). We focus on medium-size problems whose state space can…