Tree adaptive A*

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

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

17 Citas (Scopus)

Resumen

Incremental heuristic search algorithms can solve sequences of similar search problems potentially faster than heuristic search algorithms that solve each search problem from scratch. So far, there existed incremental heuristic search algorithms (such as Adaptive A*) that make the h-values of the current A* search more informed, which can speed up future A* searches, and incremental heuristic search algorithms (such as D* Lite) that change the search tree of the current A* search to the search tree of the next A* search, which can be faster than constructing it from scratch. In this paper, we present Tree Adaptive A*, which applies to goal-directed navigation in unknown terrain and builds on Adaptive A* but combines both classes of incremental heuristic search algorithms in a novel way. We demonstrate experimentally that it can run faster than Adaptive A*, Path Adaptive A* and D* Lite, the top incremental heuristic search algorithms in the context of goal-directed navigation in unknown grids. Categories and Subject Descriptors 1.2.8 [Problem Solving, Control Methods, and Search]: [Graph and tree search strategies] General Terms Algorithms, Experimentation.

Idioma originalInglés
Título de la publicación alojada10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011
EditorialInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Páginas113-120
Número de páginas8
Volumen1
EstadoPublicada - 2011
Evento10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011 - Taipei, Taiwán
Duración: 2 may 20116 may 2011

Otros

Otros10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011
País/TerritorioTaiwán
CiudadTaipei
Período2/05/116/05/11

Áreas temáticas de ASJC Scopus

  • Inteligencia artificial

Huella

Profundice en los temas de investigación de 'Tree adaptive A*'. En conjunto forman una huella única.

Citar esto