Efficient incremental search for moving target search

Incremental search algorithms reuse information from previous searches to speed up the current search and are thus often able to find shortest paths for series of sim-ilar search problems faster than by solving each search problem independently from scratch. However, they do poorly on moving target search problems, where both the start and goal cells change over time. In this pa-per, we thus develop Fringe-Retrieving A * (FRA*), an incremental version of A * that repeatedly finds shortest paths for moving target search in known gridworlds. We demonstrate experimentally that it runs up to one order of magnitude faster than a variety of state-of-the-art incre-mental search algorithms applied to moving target search in known gridworlds. 1