作者: Toru Ishida
DOI:
关键词: Search algorithm 、 Moving target search 、 Completeness (order theory) 、 Computer science 、 Course (navigation) 、 Artificial intelligence
摘要: We previously proposed the moving target search (MTS) algorithm, where location of goal may change during course search. MTS is first algorithm concerned with problem solving in a dynamically changing environment. However, since we constructed minimum operations necessary for guaranteeing its completeness, as neither efficient nor intelligent. In this paper, introduce innovative notions created area resource-bounded planning into formal MTS. Our to improve efficiency MTS, while retaining completeness. Notions that are introduced (1) commitment goals, and (2) deliberation selecting plans. Evaluation results demonstrate intelligent 10 20 times more than original uncertain situations.