Path-adaptive A* for incremental heuristic search in unknown terrain

Carlos Hernández, Pedro Meseguer, Xiaoxun Sun, Sven Koenig

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

8 Citas (Scopus)

Resumen

Adaptive A* is an incremental version of A* that updates the h-values of the previous A* search to make them more informed and thus future A* searches more focused. In this paper, we show how the A* searches performed by Adaptive A* can reuse part of the path of the previous search and terminate before they expand a goal state, resulting in Path-Adaptive A*. We demonstrate experimentally that Path-Adaptive A* expands fewer states per search and runs faster than Adaptive A* when solving path-planning problems in initially unknown terrain.

Idioma originalInglés
Título de la publicación alojadaICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling
Páginas358-361
Número de páginas4
EstadoPublicada - 2009
Evento19th International Conference on Automated Planning and Scheduling, ICAPS 2009 - Thessaloniki, Grecia
Duración: 19 sep 200923 sep 2009

Otros

Otros19th International Conference on Automated Planning and Scheduling, ICAPS 2009
PaísGrecia
CiudadThessaloniki
Período19/09/0923/09/09

Áreas temáticas de ASJC Scopus

  • Estrategia y gestión

Huella Profundice en los temas de investigación de 'Path-adaptive A* for incremental heuristic search in unknown terrain'. En conjunto forman una huella única.

  • Citar esto

    Hernández, C., Meseguer, P., Sun, X., & Koenig, S. (2009). Path-adaptive A* for incremental heuristic search in unknown terrain. En ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling (pp. 358-361)