Propagating updates in real-time search: FALCONS(k)

Carlos Hernández, Pedro Meseguer

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

Resumen

We enhance real-time search algorithms with bounded propagation of heuristic changes. When the heuristic of the current state is updated, this change is propagated consistently up to k states not necessarily distinct. Applying this idea to FALCONS, we have develop the new FALCONS(k), an algorithm that keeps the good theoretical properties of FALCONS and improves its performance. We provide experimental results on benchmarks for real-time search, showing the benefits of our approach.

Idioma originalInglés
Título de la publicación alojada25th International Conference of the Chilean Computer Science Society, SCCC 2005
Páginas37-44
Número de páginas8
Volumen2005
DOI
EstadoPublicada - 2005
Evento25th International Conference of the Chilean Computer Science Society, SCCC 2005 - Valdivia, Chile
Duración: 7 nov 200511 nov 2005

Otros

Otros25th International Conference of the Chilean Computer Science Society, SCCC 2005
PaísChile
CiudadValdivia
Período7/11/0511/11/05

Áreas temáticas de ASJC Scopus

  • Ingeniería (todo)
  • Informática (todo)

Citar esto

Hernández, C., & Meseguer, P. (2005). Propagating updates in real-time search: FALCONS(k). En 25th International Conference of the Chilean Computer Science Society, SCCC 2005 (Vol. 2005, pp. 37-44). [1587864] https://doi.org/10.1109/SCCC.2005.1587864