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

Carlos Hernández, Pedro Meseguer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication25th International Conference of the Chilean Computer Science Society, SCCC 2005
Pages37-44
Number of pages8
Volume2005
DOIs
Publication statusPublished - 2005
Event25th International Conference of the Chilean Computer Science Society, SCCC 2005 - Valdivia, Chile
Duration: 7 Nov 200511 Nov 2005

Other

Other25th International Conference of the Chilean Computer Science Society, SCCC 2005
Country/TerritoryChile
CityValdivia
Period7/11/0511/11/05

ASJC Scopus subject areas

  • Engineering(all)
  • Computer Science(all)

Cite this