Moving Target Search

Ishida, Toru; Korf, Richard E.

Moving Target Search

Download BibTeX Cite

Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 204-210.

Abstract

We consider the case of heuristic search where the location of the goal may change during the course of the search. For example, the goal may be a target that is actively avoiding the problem solver. We present a moving target search algorithm (MTS} to solve this problem. We prove that if the average speed of the target is slower than that of the problem solver, then the problem solver is guaranteed to eventually reach the target. An implementation with randomly positioned obstacles confirms that the MTS algorithm is highly effective in various situations.

Toru Ishida, and Richard E. Korf. 1991. Moving Target Search. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91. IJCAI, 204–210. https://ijcai.org/proceedings/1991/31

@inproceedings{ijcai1991p31,
  title     = {Moving Target Search},
  author    = {Ishida, Toru and Korf, Richard E.},
  booktitle = {Proceedings of the Twelfth International Joint Conference on
               Artificial Intelligence, {IJCAI-91}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {John Mylopoulos and Ray Reiter},
  pages     = {204--210},
  year      = {1991},
  month     = {8},
  note      = {Automated Reasoning},
  url       = {https://ijcai.org/proceedings/1991/31},
}

TY  - CPAPER
TI  - Moving Target Search
AU  - Ishida, Toru
AU  - Korf, Richard E.
T2  - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1991
SP  - 204
EP  - 210
UR  - https://ijcai.org/proceedings/1991/31
ER  -