AAAI

Association for the Advancement of Artificial Intelligence

Home > Proceedings / Proceedings of the International Symposium on Combinatorial Search, 8

Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation

Authors

William Lam,Kalev Kask,Rina Dechter

University of California, Irvine,University of California, Irvine,University of California, Irvine


Proceedings:

Proceedings of the International Symposium on Combinatorial Search, 8

Volume

Issue:

Vol. 8 No. 1 (2015): Eighth Annual Symposium on Combinatorial Search

Track:

Original Research Abstracts

Downloads:

Download PDF

Abstract:

The paper explores the potential of look-ahead methods within the context of AND/OR search in graphical models using the Mini-Bucket heuristic for combinatorial optimization tasks (e.g., weighted CSPS or MAP inference). We study how these methods can be used to compensate for the approximation error of the initially generated Mini-Bucket heuristics, within the context of anytime Branch-And-Bound search.

DOI:

10.1609/socs.v6i1.18367


SOCS

Vol. 8 No. 1 (2015): Eighth Annual Symposium on Combinatorial Search