Moving-Target Search

A Real-Time Search for Changing Goals

Toru Ishida, Richard E. Korf

Research output: Contribution to journalArticle

82 Citations (Scopus)

Abstract

We consider the case of heuristic search where the goal may change during the course of the search. For example, the goal may be a target that actively avoids 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 in a connected problem space. The original MTS algorithm was constructed with the minimum operations necessary to guarantee its completeness, and hence is not very efficient. To improve its efficiency, we introduce ideas from the area of resource-bounded planning into MTS, including 1) commitment to goals, and 2) deliberation for selecting plans. Experimental results demonstrate that the improved MTS is 10 to 20 times more efficient than the original MTS in uncertain situations.

Original languageEnglish
Pages (from-to)609-619
Number of pages11
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Volume17
Issue number6
DOIs
Publication statusPublished - 1995 Jan 1
Externally publishedYes

Fingerprint

Moving Target
Search Algorithm
Real-time
Target
Heuristic Search
Completeness
Planning
Resources
Necessary
Experimental Results
Demonstrate

Keywords

  • commitment
  • deliberation
  • learning
  • moving target
  • problem solving
  • reactiveness
  • real-time
  • Search

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Applied Mathematics

Cite this

Moving-Target Search : A Real-Time Search for Changing Goals. / Ishida, Toru; Korf, Richard E.

In: IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 17, No. 6, 01.01.1995, p. 609-619.

Research output: Contribution to journalArticle

@article{d10c6d0d3d9e4767973af7243ac889dc,
title = "Moving-Target Search: A Real-Time Search for Changing Goals",
abstract = "We consider the case of heuristic search where the goal may change during the course of the search. For example, the goal may be a target that actively avoids 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 in a connected problem space. The original MTS algorithm was constructed with the minimum operations necessary to guarantee its completeness, and hence is not very efficient. To improve its efficiency, we introduce ideas from the area of resource-bounded planning into MTS, including 1) commitment to goals, and 2) deliberation for selecting plans. Experimental results demonstrate that the improved MTS is 10 to 20 times more efficient than the original MTS in uncertain situations.",
keywords = "commitment, deliberation, learning, moving target, problem solving, reactiveness, real-time, Search",
author = "Toru Ishida and Korf, {Richard E.}",
year = "1995",
month = "1",
day = "1",
doi = "10.1109/34.387507",
language = "English",
volume = "17",
pages = "609--619",
journal = "IEEE Transactions on Pattern Analysis and Machine Intelligence",
issn = "0162-8828",
publisher = "IEEE Computer Society",
number = "6",

}

TY - JOUR

T1 - Moving-Target Search

T2 - A Real-Time Search for Changing Goals

AU - Ishida, Toru

AU - Korf, Richard E.

PY - 1995/1/1

Y1 - 1995/1/1

N2 - We consider the case of heuristic search where the goal may change during the course of the search. For example, the goal may be a target that actively avoids 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 in a connected problem space. The original MTS algorithm was constructed with the minimum operations necessary to guarantee its completeness, and hence is not very efficient. To improve its efficiency, we introduce ideas from the area of resource-bounded planning into MTS, including 1) commitment to goals, and 2) deliberation for selecting plans. Experimental results demonstrate that the improved MTS is 10 to 20 times more efficient than the original MTS in uncertain situations.

AB - We consider the case of heuristic search where the goal may change during the course of the search. For example, the goal may be a target that actively avoids 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 in a connected problem space. The original MTS algorithm was constructed with the minimum operations necessary to guarantee its completeness, and hence is not very efficient. To improve its efficiency, we introduce ideas from the area of resource-bounded planning into MTS, including 1) commitment to goals, and 2) deliberation for selecting plans. Experimental results demonstrate that the improved MTS is 10 to 20 times more efficient than the original MTS in uncertain situations.

KW - commitment

KW - deliberation

KW - learning

KW - moving target

KW - problem solving

KW - reactiveness

KW - real-time

KW - Search

UR - http://www.scopus.com/inward/record.url?scp=0029326195&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029326195&partnerID=8YFLogxK

U2 - 10.1109/34.387507

DO - 10.1109/34.387507

M3 - Article

VL - 17

SP - 609

EP - 619

JO - IEEE Transactions on Pattern Analysis and Machine Intelligence

JF - IEEE Transactions on Pattern Analysis and Machine Intelligence

SN - 0162-8828

IS - 6

ER -