Moving target search

Authors:
Toru Ishida;Richard E. Korf
Affiliations:
NTT Communications and Information Processing Laboratories, Yokosuka, Japan;Computer Science Department, University of California, Los Angeles, Los Angeles, CA
Venue:
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Year:
1991

Citing 2
Cited 12

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Real-time heuristic search

Artificial Intelligence

Value-update rules for real-time search

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Hardness measures for gridworld benchmarks and performance analysis of real-time heuristic search algorithms

Journal of Heuristics
Moving target D* Lite

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
On learning in agent-centered search

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Generalized Fringe-Retrieving A*: faster moving target search on state lattices

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Moving target search with intelligence

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Easy and hard testbeds for real-time search algorithms

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Applying coordination in moving target search (MTS) algorithm

ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Moving Target Search Using Theory of Mind

WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Optimization of route planning and exploration using multi agent system

Multimedia Tools and Applications
Cops and robber game without recharging

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Hierarchical visibility for guaranteed search in large-scale outdoor terrain

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.