Lookahead, propagation and moves in real-time heuristic search

Carlos Hernández, Pedro Meseguer

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

1 Cita (Scopus)

Resumen

Bounded propagation of heuristic changes has been shown beneficial for real-time search methods with lookahead = 1. Here we combine bounded propagation with lookahead > 1, keeping the cycle lookahead, update, move of initial LRTA* (propagation is included in update). Bounded propagation can start from any heuristic inaccuracy found during lookahead, and update can go outside the local search space. After update, promising states found during lookahead could no longer be "promising", and this has to be considered for the next move. We give evidences of the benefits of this new approach, on several benchmarks with different heuristics.

Idioma originalInglés
Título de la publicación alojadaInternational Symposium on Combinatorial Search, SoCS 2009
EstadoPublicada - 2009
Evento2009 2nd International Symposium on Combinatorial Search, SoCS 2009 - Lake Arrowhead, CA, Estados Unidos
Duración: 8 jul 200910 jul 2009

Otros

Otros2009 2nd International Symposium on Combinatorial Search, SoCS 2009
País/TerritorioEstados Unidos
CiudadLake Arrowhead, CA
Período8/07/0910/07/09

Áreas temáticas de ASJC Scopus

  • Redes de ordenadores y comunicaciones

Citar esto