Moving Target Search
Abstract
We consider the case of heuristic search where the location of the goal maychange during the course of the search. For example, the goal may be a target that is actively avoiding the problem solver. We presentamoving target search algorithm (MTS) to solve this problem. Weprove that if the average speed of the target is slower than that of the problem solver, then the problem solver is guaranteed to eventually reachthe target. An implementation with randomly positioned obstacles confirms that the MTS algorithm is highly effectiveinvarious situations.
Cite
Text
Ishida and Korf. "Moving Target Search." International Joint Conference on Artificial Intelligence, 1991.Markdown
[Ishida and Korf. "Moving Target Search." International Joint Conference on Artificial Intelligence, 1991.](https://mlanthology.org/ijcai/1991/ishida1991ijcai-moving/)BibTeX
@inproceedings{ishida1991ijcai-moving,
title = {{Moving Target Search}},
author = {Ishida, Toru and Korf, Richard E.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1991},
pages = {204-211},
url = {https://mlanthology.org/ijcai/1991/ishida1991ijcai-moving/}
}