Lab Meeting 27 August (fish60): Speeding up Moving-Target Search

Abstract:

In this paper, we study moving-target search, where an agent has to catch a moving target . The agent does not necessarily know the terrain initially but can observe it within a certain sensor range around itself.
It uses the strategy to always move on a shortest presumed unblocked path toward the target. We study how the agent can find such paths faster by exploiting the fact that it performs A* searches repeatedly.
To this end, we extend Adaptive A* to moving-target search and demonstrate experimentally that the resulting MT-Adaptive A* is faster than isolated A* searches.

Link