Moving Target Search
暂无分享,去创建一个
We consider the case of heuristic search where the location of the goal may change during the course of the search. For example, the goal may be a target that is actively avoiding 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. An implementation with randomly positioned obstacles confirms that the MTS algorithm is highly effective in various situations.
[1] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[2] Jesfis Peral,et al. Heuristics -- intelligent search strategies for computer problem solving , 1984 .
[3] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[4] Richard E. Korf,et al. Real-Time Heuristic Search , 1990, Artif. Intell..