Search Results for author:
Found 6 papers, 1 papers with code
Transformer Based Planning in the Observation Space with Applications to Trick Taking Card Games
Traditional search algorithms have issues when applied to games of imperfect information where the number of possible underlying states and trajectories are very large.
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search
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.
Iterative Budgeted Exponential Search
For graph search, A* can require $\Omega(2^{n})$ expansions, where $n$ is the number of states within the final $f$ bound.
Policy Based Inference in Trick-Taking Card Games
Trick-taking card games feature a large amount of private information that slowly gets revealed through a long sequence of actions.
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions
pairs, and present a new admissible front-to-end bidirectional heuristic search algorithm, Near-Optimal Bidirectional Search (NBS), that is guaranteed to do no more than 2VC expansions.
Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups
In recent years, combining ideas from traditional minimax search in MCTS has been shown to be advantageous in some domains, such as Lines of Action, Amazons, and Breakthrough.
