説明
Considers 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. The authors present a moving-target search algorithm (MTS) to solve this problem. The authors 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, the authors 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. >
収録刊行物
-
- IEEE Transactions on Pattern Analysis and Machine Intelligence
-
IEEE Transactions on Pattern Analysis and Machine Intelligence 17 (6), 609-619, 1995-06
Institute of Electrical and Electronics Engineers (IEEE)