Algorithm 1.
AEMS: Anytime Error Minimization Search
Function SEARCH(t, ε) |
Static: T: an AND-OR tree representing the current search tree. |
t0 ← TIME() |
while TIME() – t0 ≤ t and not SOLVED(ROOT(T), ε) do |
b* ← b̃(T) |
EXPAND(b*) |
UPDATEANCESTORS(b*) |
end while |
return argmaxa∈A LT (ROOT(T), a) |