Real-Time Moving Target Search

Undeger, Cagatay
Polat, Faruk
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 (NITS) 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.
10th Pacific Rim International Conference on Multi-Agent Systems


Real-Time Moving Target Evaluation Search
Undeger, Cagatay; Polat, Faruk (Institute of Electrical and Electronics Engineers (IEEE), 2009-05-01)
In this correspondence, we address the problem of real-time moving target search in dynamic and partially observable environments, and propose an algorithm called real-time moving target evaluation search (MTES). MTES is able to detect the closed directions around the agent and determines the estimated best direction to capture a moving target avoiding the obstacles nearby. We have also developed a new prey algorithm (Prey-A*) to test the existing and our predator algorithms in our experiments. We have obta...
Real-time edge follow: A real-time path search approach
Undeger, Cagatay; Polat, Faruk (2007-09-01)
Real-time path search is the problem of searching a path from a starting point to a goal point in real-time. In dynamic and partially observable environments, agents need to observe the environment to track changes, explore to learn unknowns, and search suitable routes to reach the goal rapidly. These tasks frequently require real-time search. In this paper, we address the problem of real-time path search for grid-type environments; we propose an effective heuristic method, namely a real-time edge follow al...
Limited-Damage A*: A path search algorithm that considers damage as a feasibility criterion
Bayılı, Serhat; Polat, Faruk (2011-05-01)
Pathfinding algorithms used in todays computer games consider the path length or a similar criterion as the only measure of optimality. However, these games usually involve opposing parties, whose agents can inflict damage on those of the others. Therefore, the shortest path in such games may not always be the safest one. Consequently, a new suboptimal offline path search algorithm based on the A* algorithm was developed, which takes the threat zones in the game map into consideration. Given an upper limit ...
BUZCU, ILKER; Alatan, Abdullah Aydın (2016-09-28)
An enhancement to one of the existing visual object detection approaches is proposed for generating candidate windows that improves detection accuracy at no additional computational cost. Hypothesis windows for object detection are obtained based on Fisher Vector representations over initially obtained superpixels. In order to obtain new window hypotheses, hierarchical merging of superpixel regions are applied, depending upon improvements on some objectiveness measures with no additional cost due to additiv...
Single and multi agent real-time path search in dynamic and partially observable environments
Ündeğer, Çağatay; Polat, Faruk; Department of Computer Engineering (2007)
In this thesis, we address the problem of real-time path search in partially observable grid worlds, and propose two single agent and one multi-agent search algorithm. The first algorithm, Real-Time Edge Follow (RTEF), is capable of detecting the closed directions around the agent by analyzing the nearby obstacles, thus avoiding dead-ends in order to reach a static target more effectively. We compared RTEF with a well-known algorithm, Real-Time A* (RTA*) proposed by Korf, and observed significant improvemen...
Citation Formats
C. Undeger and F. Polat, “Real-Time Moving Target Search,” Bangkok, THAILAND, 2007, vol. 5044, Accessed: 00, 2020. [Online]. Available: