## Resumen

In this paper, we present a conceptually simple, easy-toimplement real-time search algorithm suitable for a priori partially known environments. Instead of performing a series of searches towards the goal, like most Real-Time Heuristic Search Algorithms do, our algorithm follows the arcs of a tree T rooted in the goal state that is built initially using the heuristic h. When the agent observes that an arc in the tree cannot be traversed in the actual environment, it removes such an arc from T and our algorithm carries out a reconnection search whose objective is to find a path between the current state and any node in T. The reconnection search need not be guided by h, since the search objective is not to encounter the goal. Furthermore, h need not be updated. We implemented versions of our algorithm that utilize various blind search algorithms for reconnection. We show experimentally that these implementations significantly outperform state-of-the-art real-time heuristic search algorithms for the task of pathfinding in grids. In grids, our algorithms, which do not incorporate any geometrical knowledge, naturally behaves similarly to a bug algorithm, moving around obstacles, and never returning to areas that have been visited in the past. In addition, we prove theoretical properties of the algorithm.

Idioma original | Inglés |
---|---|

Título de la publicación alojada | Proceedings of the 6th Annual Symposium on Combinatorial Search, SoCS 2013 |

Páginas | 158-166 |

Número de páginas | 9 |

Estado | Publicada - 2013 |

Evento | 6th Annual Symposium on Combinatorial Search, SoCS 2013 - Leavenworth, WA, Estados Unidos Duración: 11 jul 2013 → 13 jul 2013 |

### Otros

Otros | 6th Annual Symposium on Combinatorial Search, SoCS 2013 |
---|---|

País/Territorio | Estados Unidos |

Ciudad | Leavenworth, WA |

Período | 11/07/13 → 13/07/13 |

## Áreas temáticas de ASJC Scopus

- Redes de ordenadores y comunicaciones