1 citations · 1 across the 3 of their papers we have counts for
6 papers
Beam Search: Faster and Monotonic
Sofia Lemons, Carlos Linares López, Robert C. Holte +1
Beam search is a popular satisficing approach to heuristic search problems that allows one to trade increased computation time for lower solution cost by increasing the beam width…
Optimal Edge Weight Perturbations to Attack Shortest Paths
Benjamin A. Miller, Zohair Shafi, Wheeler Ruml +3
Finding shortest paths in a given network (e.g., a computer network or a road network) is a well-studied task with many applications. We consider this task under the presence of an…
PATHATTACK: Attacking Shortest Paths in Complex Networks
Benjamin A. Miller, Zohair Shafi, Wheeler Ruml +3
Shortest paths in complex networks play key roles in many applications. Examples include routing packets in a computer network, routing traffic on a transportation network, and inf…
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding
Jiaoyang Li, Wheeler Ruml, Sven Koenig
Multi-Agent Path Finding (MAPF), i.e., finding collision-free paths for multiple robots, is important for many applications where small runtimes are necessary, including the kind o…
Improved Safe Real-time Heuristic Search
Bence Cserna, Kevin C. Gall, Wheeler Ruml
A fundamental concern in real-time planning is the presence of dead-ends in the state space, from which no goal is reachable. Recently, the SafeRTS algorithm was proposed for searc…
Value Directed Exploration in Multi-Armed Bandits with Structured Priors
Bence Cserna, Marek Petrik, Reazul Hasan Russel +1
Multi-armed bandits are a quintessential machine learning problem requiring the balancing of exploration and exploitation. While there has been progress in developing algorithms wi…