73 citations · 100 across the 8 of their papers we have counts for
8 papers
Rectangle Search: An Anytime Beam Search (Extended Version)
Sofia Lemons, Wheeler Ruml, Robert C. Holte +1
Anytime heuristic search algorithms try to find a (potentially suboptimal) solution as quickly as possible and then work to find better and better solutions until an optimal soluti…
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…
Error Analysis and Correction for Weighted A*'s Suboptimality (Extended Version)
Robert C. Holte, Ruben Majadas, Alberto Pozanco +1
Weighted A* (wA*) is a widely used algorithm for rapidly, but suboptimally, solving planning and search problems. The cost of the solution it produces is guaranteed to be at most W…
An Empirical Study of the Effects of Spurious Transitions on Abstraction-based Heuristics
Mehdi Sadeqi, Robert C. Holte, Sandra Zilles
The efficient solution of state space search problems is often attempted by guiding search algorithms with heuristics (estimates of the distance from any state to the goal). A popu…
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions
Jingwei Chen, Robert C. Holte, Sandra Zilles +1
It is well-known that any admissible unidirectional heuristic search algorithm must expand all states whose -value is smaller than the optimal solution cost when using a consist…
Predicting the Performance of IDA* using Conditional Distributions
Uzi Zahavi, Ariel Felner, Neil Burch +1
Korf, Reid, and Edelkamp introduced a formula to predict the number of nodes IDA* will expand on a single iteration for a given consistent heuristic, and experimentally demonstrate…