Incremental heuristic search algorithms
In this paper, we subsequently develop Fringe-Retrieving A* (FRA*), an incremental version of A* that repeatedly finds shortest paths for moving target search in better-known gridworlds. We demonstrate through an experiment that it runs up to one order of magnitude quicker than a range of progressive search algorithms applied to moving target search in better-known gridworlds. 1 Introduction Moving target search is that the downside wherever a hunter needs to catch a moving target [Ishida and Korf, 1991]. Motivated by video games, we tend to perform moving target search in well-known gridworlds with blocked and unblocked cells, wherever hunter continuously is aware of its current cell and therefore the current cell of the target. The moving target search downside is resolved once hunter reaches the present cell of the target.The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expresse...
Efficient Incremental Search for Moving Target Search
This might be interesting
Can’t find the right project?
Our experts can help you get one from scratch.
Sign Up Studybay