Moving target search with intelligence

Toru Ishida*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

51 Citations (Scopus)


We previously proposed the moving target search (MTS) algorithm, where the location of the goal may change during the course of the search. MTS is the first search algorithm concerned with problem solving in a dynamically changing environment. However, since we constructed the algorithm with the minimum operations necessary for guaranteeing its completeness, the algorithm as proposed is neither efficient nor intelligent. In this paper, we introduce innovative notions created in the area of resource-bounded planning into the formal search algorithm, MTS. Our goal is to improve the efficiency of MTS, while retaining its completeness. Notions that are introduced are (1) commitment to goals, and (2) deliberation for selecting plans. Evaluation results demonstrate that the intelligent MTS is 10 to 20 times more efficient than the original MTS in uncertain situations.

Original languageEnglish
Title of host publicationProceedings Tenth National Conference on Artificial Intelligence
PublisherPubl by AAAI
Number of pages8
ISBN (Print)0262510634
Publication statusPublished - 1992 Dec 1
Externally publishedYes
EventProceedings Tenth National Conference on Artificial Intelligence - AAAI-92 - San Jose, CA, USA
Duration: 1992 Jul 121992 Jul 16

Publication series

NameProceedings Tenth National Conference on Artificial Intelligence


ConferenceProceedings Tenth National Conference on Artificial Intelligence - AAAI-92
CitySan Jose, CA, USA

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'Moving target search with intelligence'. Together they form a unique fingerprint.

Cite this