Reconnection with the ideal tree: A new approach to real-time search

Nicolás Rivera, León Illanes, Jorge A. Baier, Carlos Hernández

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

5 Citas (Scopus)


Many applications, ranging from video games to dynamic robotics, require solving single-agent, deterministic search problems in partially known environments under very tight time constraints. Real-Time Heuristic Search (RTHS) algorithms are specifically designed for those applications. As a subroutine, most of them invoke a standard, but bounded, search algorithm that searches for the goal. In this paper we present FRIT, a simple approach for single-agent deterministic search problems under tight constraints and partially known environments that unlike traditional RTHS does not search for the goal but rather searches for a path that connects the current state with a so-called ideal tree Τ. When the agent observes that an arc in the tree cannot be traversed in the actual environment, it removes such an arc from Τand then carries out a reconnection search whose objective is to find a path between the current state and any node in Τ. The reconnection search is done using an algorithm that is passed as a parameter to FRIT. If such a parameter is an RTHS algorithm, then the resulting algorithm can be an RTHS algorithm. We show, in addition, that FRIT may be fed with a (bounded) complete blind-search algorithm. We evaluate our approach over grid path finding benchmarks including game maps and mazes. Our results show that FRIT, used with RTAA*, a standard RTHS algorithm, outperforms RTAA* significantly; by one order of magnitude under tight time constraints. In addition, FRIT(daRTAA*) substantially outperforms daRTAA*, a state-of-the-art RTHS algorithm, usually obtaining solutions 50% cheaper on average when performing the same search effort. Finally, FRIT(BFS), i.e., FRIT using breadth-first-search, obtains best-quality solutions when time is limited compared to Adaptive A* and Repeated A*. Finally we show that Bug2, a path finding-specific navigation algorithm, outperforms FRIT(BFS) when planning time is extremely limited, but when given more time, the situation reverses.

Idioma originalInglés
Páginas (desde-hasta)235-264
Número de páginas30
PublicaciónJournal of Artificial Intelligence Research
EstadoPublicada - jun 2014

Áreas temáticas de ASJC Scopus

  • Inteligencia artificial


Profundice en los temas de investigación de 'Reconnection with the ideal tree: A new approach to real-time search'. En conjunto forman una huella única.

Citar esto