Moving target search with compressed path databases

Adi Botea, Jorge A. Baier, Daniel Harabor, Carlos Hernández

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

13 Citas (Scopus)

Resumen

Moving target search, where the goal state changes during a search, has recently seen a revived interest. Incremental Anytime Repairing A* (I-ARA*) is a very recent, state-of-the-art algorithm for moving target search in a known terrain. In this work, we address the problem using compressed path databases (CPDs) in moving target search. CPDs have previously been used in standard, fixed-target pathfinding. They encode all-pairs shortest paths in a compressed form and require preprocessing and memory to store the database. In moving-target search, our speed results are orders of magnitude better than state of the art. The time per individual move is improved, which is important in real-time search scenarios, where the time available to make a move is limited. The number of hunter moves is very good, since CPDs provide optimal moves along shortest paths. Compared to previous successful methods, such as I-ARA*, our method is simple to understand and implement.

Idioma originalInglés
Título de la publicación alojadaICAPS 2013 - Proceedings of the 23rd International Conference on Automated Planning and Scheduling
Páginas288-292
Número de páginas5
EstadoPublicada - 2013
Evento23rd International Conference on Automated Planning and Scheduling, ICAPS 2013 - Rome, Italia
Duración: 10 jun. 201314 jun. 2013

Serie de la publicación

NombreICAPS 2013 - Proceedings of the 23rd International Conference on Automated Planning and Scheduling

Otros

Otros23rd International Conference on Automated Planning and Scheduling, ICAPS 2013
País/TerritorioItalia
CiudadRome
Período10/06/1314/06/13

Áreas temáticas de ASJC Scopus

  • Inteligencia artificial
  • Gestión y sistemas de información

Huella

Profundice en los temas de investigación de 'Moving target search with compressed path databases'. En conjunto forman una huella única.

Citar esto