Paper summary: Time-bounded adaptive A*

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

Resultado de la investigación: Conference contribution

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 originalEnglish
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
EstadoPublished - 2012
Evento5th International Symposium on Combinatorial Search, SoCS 2012 - Niagara Falls, ON, Canada
Duración: 19 jul 201221 jul 2012

Other

Other5th International Symposium on Combinatorial Search, SoCS 2012
PaísCanada
CiudadNiagara Falls, ON
Período19/07/1221/07/12

Huella dactilar

Motion planning

ASJC Scopus subject areas

  • Computer Networks and Communications

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)
Hernández, Carlos ; Baier, Jorge ; Uras, Tansel ; Koenig, Sven. / Paper summary : Time-bounded adaptive A*. Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012. 2012. pp. 184-185
@inproceedings{68675a4ba75947939810b479c98e2528,
title = "Paper summary: Time-bounded adaptive A*",
abstract = "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.",
author = "Carlos Hern{\'a}ndez and Jorge Baier and Tansel Uras and Sven Koenig",
year = "2012",
language = "English",
isbn = "9781577355847",
pages = "184--185",
booktitle = "Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012",

}

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, 5th International Symposium on Combinatorial Search, SoCS 2012, Niagara Falls, ON, Canada, 19/07/12.

Paper summary : Time-bounded adaptive A*. / Hernández, Carlos; Baier, Jorge; Uras, Tansel; Koenig, Sven.

Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012. 2012. p. 184-185.

Resultado de la investigación: Conference contribution

TY - GEN

T1 - Paper summary

T2 - Time-bounded adaptive A*

AU - Hernández, Carlos

AU - Baier, Jorge

AU - Uras, Tansel

AU - Koenig, Sven

PY - 2012

Y1 - 2012

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

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

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

M3 - Conference contribution

AN - SCOPUS:84893392583

SN - 9781577355847

SP - 184

EP - 185

BT - Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012

ER -

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