Real-Time Moving Target Search
In this paper, we propose a real-time moving target search algorithm for dynamic and partially observable environments, modeled as grid world. The proposed algorithm, Real-time Moving Target Evaluation Search (MTES), is able to detect the closed directions around the agent, and determine the best direction that avoids the nearby obstacles, leading to a moving target which is assumed to be escaping almost optimally. We compared our proposal with Moving Target Search (MTS) and observed a significant improvement in the solution paths. Furthermore, we also tested our algorithm against A* in order to report quality of our solutions.
KeywordsPath Planning Real-Time Search Moving Target Search
Unable to display preview. Download preview PDF.
- 1.Goldenberg, M., Kovarsky, A., Wu, X., Schaeffer, J.: Multiple agents moving target search. In: Int’l. Joint Conf. on Artificial Intelligence, IJCAI, pp. 1536–1538 (2003)Google Scholar
- 3.Koenig, S., Likhachev, M.: Real-time adaptive a*. In: 5th Int’l. Joint Conf. on Autonomous Agents and Multiagent Systems, pp. 281–288 (2006)Google Scholar
- 4.Koenig, S., Likhachev, M., Sun, X.: Speeding up moving-target search*. In: 6th Int’l. Joint Conf. on Autonomous Agents and Multiagent Systems (2007)Google Scholar
- 6.Russell, S., Norving, P.: Artificial Intelligence: a modern approach. Prentice Hall, Inc., Englewood Cliffs (1995)Google Scholar
- 7.Stentz, A.: The focussed D* algorithm for real-time replanning. In: Proceedings of the Int’l. Joint Conference on Artificial Intelligence (1995)Google Scholar