1 citations · 1 across the 4 of their papers we have counts for
3 papers · 1 filter
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…
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…