Moving target search with intelligence

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

43 Citations (Scopus)

Abstract

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
Pages525-532
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

Conference

ConferenceProceedings Tenth National Conference on Artificial Intelligence - AAAI-92
CitySan Jose, CA, USA
Period92/7/1292/7/16

Fingerprint

Planning

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ishida, T. (1992). Moving target search with intelligence. In Proceedings Tenth National Conference on Artificial Intelligence (pp. 525-532). (Proceedings Tenth National Conference on Artificial Intelligence). Publ by AAAI.

Moving target search with intelligence. / Ishida, Toru.

Proceedings Tenth National Conference on Artificial Intelligence. Publ by AAAI, 1992. p. 525-532 (Proceedings Tenth National Conference on Artificial Intelligence).

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

Ishida, T 1992, Moving target search with intelligence. in Proceedings Tenth National Conference on Artificial Intelligence. Proceedings Tenth National Conference on Artificial Intelligence, Publ by AAAI, pp. 525-532, Proceedings Tenth National Conference on Artificial Intelligence - AAAI-92, San Jose, CA, USA, 92/7/12.
Ishida T. Moving target search with intelligence. In Proceedings Tenth National Conference on Artificial Intelligence. Publ by AAAI. 1992. p. 525-532. (Proceedings Tenth National Conference on Artificial Intelligence).
Ishida, Toru. / Moving target search with intelligence. Proceedings Tenth National Conference on Artificial Intelligence. Publ by AAAI, 1992. pp. 525-532 (Proceedings Tenth National Conference on Artificial Intelligence).
@inproceedings{cdbf7d7c6bf44f5f944dc118cb7c472d,
title = "Moving target search with intelligence",
abstract = "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.",
author = "Toru Ishida",
year = "1992",
month = "12",
day = "1",
language = "English",
isbn = "0262510634",
series = "Proceedings Tenth National Conference on Artificial Intelligence",
publisher = "Publ by AAAI",
pages = "525--532",
booktitle = "Proceedings Tenth National Conference on Artificial Intelligence",

}

TY - GEN

T1 - Moving target search with intelligence

AU - Ishida, Toru

PY - 1992/12/1

Y1 - 1992/12/1

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

SN - 0262510634

T3 - Proceedings Tenth National Conference on Artificial Intelligence

SP - 525

EP - 532

BT - Proceedings Tenth National Conference on Artificial Intelligence

PB - Publ by AAAI

ER -