Moving target search with intelligence

Toru Ishida*

*この研究の対応する著者

研究成果: Conference contribution

51 被引用数 (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.

本文言語English
ホスト出版物のタイトルProceedings Tenth National Conference on Artificial Intelligence
出版社Publ by AAAI
ページ525-532
ページ数8
ISBN(印刷版)0262510634
出版ステータスPublished - 1992 12月 1
外部発表はい
イベントProceedings Tenth National Conference on Artificial Intelligence - AAAI-92 - San Jose, CA, USA
継続期間: 1992 7月 121992 7月 16

出版物シリーズ

名前Proceedings 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

ASJC Scopus subject areas

  • 工学(全般)

フィンガープリント

「Moving target search with intelligence」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル