1 code implementation • 19 Dec 2023 • Sofia Lemons, Wheeler Ruml, Robert C. Holte, Carlos Linares López
In this paper, we propose a new algorithm, rectangle search, that is instead based on beam search, a variant of breadth-first search.
no code implementations • 6 Apr 2022 • Sofia Lemons, Carlos Linares López, Robert C. Holte, Wheeler Ruml
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 parameter.
no code implementations • 27 May 2019 • Robert C. Holte, Ruben Majadas, Alberto Pozanco, Daniel Borrajo
There is broad consensus that this bound is not very accurate, that the actual suboptimality of wA*'s solution is often much less than W times optimal.
no code implementations • 14 Nov 2017 • Mehdi Sadeqi, Robert C. Holte, Sandra Zilles
However, the quality of abstraction-based heuristic functions, and thus the speed of search, can suffer from spurious transitions, i. e., state transitions in the abstract state space for which no corresponding transitions in the reachable component of the original state space exist.
1 code implementation • 10 Mar 2017 • Jingwei Chen, Robert C. Holte, Sandra Zilles, Nathan R. Sturtevant
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.
no code implementations • 15 Jan 2014 • Uzi Zahavi, Ariel Felner, Neil Burch, Robert C. Holte
In this paper we show that, in addition to requiring the heuristic to be consistent, their formulas predictions are accurate only at levels of the brute-force search tree where the heuristic values obey the unconditional distribution that they defined and then used in their formula.
