Toward a search strategy for anytime search in linear space using depth-first branch and bound

Carlos Hernández, Jorge A. Baier

Resultado de la investigación: Contribución a los tipos de informe/libroContribución a la conferencia

1 Cita (Scopus)

Resumen

Depth-First Branch and Bound (DFBnB) is an anytime algorithm for solving combinatorial optimization problems. In this paper we present a weighted version of DFBnB, wDFBnB, which incorporates standard techniques for using weights in heuristic search and offers suboptimality guarantees. Our main contribution drawn from a preliminary evaluation is the observation that wDFBnB, used along with automated or hand-crafted weight schedules, can significantly outperform DFBnB both in terms of anytime behavior and convergence to the optimal. We think this small study calls for more research on the design of automated weight schedules that could provide superior anytime performance across a wider range of domains.

Idioma originalInglés
Título de la publicación alojadaProceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014
EditoresStefan Edelkamp, Roman Bartak
EditorialAAAI press
Páginas198-199
Número de páginas2
Volumen2014-January
ISBN (versión digital)9781577356769
EstadoPublicada - 1 ene 2014
Evento7th Annual Symposium on Combinatorial Search, SoCS 2014 - Prague, República Checa
Duración: 15 ago 201417 ago 2014

Conferencia

Conferencia7th Annual Symposium on Combinatorial Search, SoCS 2014
PaísRepública Checa
CiudadPrague
Período15/08/1417/08/14

Áreas temáticas de ASJC Scopus

  • Redes de ordenadores y comunicaciones

Huella Profundice en los temas de investigación de 'Toward a search strategy for anytime search in linear space using depth-first branch and bound'. En conjunto forman una huella única.

  • Citar esto

    Hernández, C., & Baier, J. A. (2014). Toward a search strategy for anytime search in linear space using depth-first branch and bound. En S. Edelkamp, & R. Bartak (Eds.), Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014 (Vol. 2014-January, pp. 198-199). AAAI press.