Paper summary: Time-bounded adaptive A*

Carlos Hernández, Jorge Baier, Tansel Uras, Sven Koenig

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

Resumen

This paper summarizes our AAMAS 2012 paper on "Time- Bounded Adaptive A*," which introduces the game time model to evaluate search algorithms in real-time settings, such as video games. It then extends the existing real-time search algorithm TBA* to path planning with the freespace assumption in initially partially or completely unknown terrain, resulting in Time-Bounded Adaptive A* (TBAA*). TBAA* needs fewer time intervals in the game time model than several state-of-the-art complete and real-time search algorithms and about the same number of time intervals as the best compared complete search algorithm, even though it has the advantage over complete search algorithms that the agent starts to move right away.

Idioma originalInglés
Título de la publicación alojadaProceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012
Páginas184-185
Número de páginas2
EstadoPublicada - 2012
Evento5th International Symposium on Combinatorial Search, SoCS 2012 - Niagara Falls, ON, Canadá
Duración: 19 jul 201221 jul 2012

Otros

Otros5th International Symposium on Combinatorial Search, SoCS 2012
PaísCanadá
CiudadNiagara Falls, ON
Período19/07/1221/07/12

Áreas temáticas de ASJC Scopus

  • Redes de ordenadores y comunicaciones

Huella Profundice en los temas de investigación de 'Paper summary: Time-bounded adaptive A*'. En conjunto forman una huella única.

  • Citar esto

    Hernández, C., Baier, J., Uras, T., & Koenig, S. (2012). Paper summary: Time-bounded adaptive A*. En Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012 (pp. 184-185)