Lookahead, propagation and moves in real-time heuristic search

Carlos Hernández, Pedro Meseguer

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

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationInternational Symposium on Combinatorial Search, SoCS 2009
Publication statusPublished - 2009
Event2009 2nd International Symposium on Combinatorial Search, SoCS 2009 - Lake Arrowhead, CA, United States
Duration: 8 Jul 200910 Jul 2009

Other

Other2009 2nd International Symposium on Combinatorial Search, SoCS 2009
Country/TerritoryUnited States
CityLake Arrowhead, CA
Period8/07/0910/07/09

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this