Improving HLRTA*(k)

• Hernández, Carlos ^[1] ; Meseguer, Pedro ^[2]
  1. [1] Universidad Católica de la Santísima Concepción

     Universidad Católica de la Santísima Concepción

     Comuna de Concepción, Chile

     
  2. [2] Instituto de Investigación en Inteligencia Artificial (CSIC)
• Localización: XII Conferencia de la Asociación Española para la Inteligencia Artificial: (CAEPIA 2007). Actas / coord. por Daniel Borrajo Millán , Luis Castillo Vidal , Juan Manuel Corchado Rodríguez , Vol. 1, 2007, ISBN 978-84-611-8847-5, págs. 47-56
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Real-time search methods allow an agent to move in unknown environments. We provide two enhancements to the real-time search algorithm HLRTA*(k). First, we give a better way to perform bounded propagation, generating the HLRTA*LS(k) algorithm. Second, we consider the option of doing more than one action per planning step, by analyzing the quality of the heuristic found during lookahead, producing the HLRTA*(k,d) algorithm. We provide experimental evidence of the benefits of both algorithms, with respect to other real-time algorithms on existing benchmarks.