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

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

Resultado de la investigación: Conference contribution

7 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 originalEnglish
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
EstadoPublished - 2009
Evento19th International Conference on Automated Planning and Scheduling, ICAPS 2009 - Thessaloniki, Greece
Duración: 19 sep 200923 sep 2009

Other

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

Huella dactilar

Incremental
Heuristic search
Reuse
Planning

ASJC Scopus subject areas

  • Strategy and Management

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)
Hernández, Carlos ; Meseguer, Pedro ; Sun, Xiaoxun ; Koenig, Sven. / Path-adaptive A* for incremental heuristic search in unknown terrain. ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling. 2009. pp. 358-361
@inproceedings{8856d4edbadc41d783b4eb021b04093e,
title = "Path-adaptive A* for incremental heuristic search in unknown terrain",
abstract = "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.",
author = "Carlos Hern{\'a}ndez and Pedro Meseguer and Xiaoxun Sun and Sven Koenig",
year = "2009",
language = "English",
isbn = "9781577354062",
pages = "358--361",
booktitle = "ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling",

}

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, 19th International Conference on Automated Planning and Scheduling, ICAPS 2009, Thessaloniki, Greece, 19/09/09.

Path-adaptive A* for incremental heuristic search in unknown terrain. / Hernández, Carlos; Meseguer, Pedro; Sun, Xiaoxun; Koenig, Sven.

ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling. 2009. p. 358-361.

Resultado de la investigación: Conference contribution

TY - GEN

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

AU - Hernández, Carlos

AU - Meseguer, Pedro

AU - Sun, Xiaoxun

AU - Koenig, Sven

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=78650602132&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:78650602132

SN - 9781577354062

SP - 358

EP - 361

BT - ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

ER -

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