Abstract—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 obtained an impressive improvement over moving target search, real-time target evaluation search, and real-time edge follow with respect to path length. Furthermore, we have also tested our algorithm against A*. Index Terms—Moving ta...
Traditional single-agent search algorithms usually make simplifying assumptions (single search agent...
Abstract: We consider an Ishida and Korf Moving Target Search (MTS) algorithm with informational dis...
We address the problem of searching for moving targets in large outdoor environments represented by ...
In this correspondence, we address the problem of real-time moving target search in dynamic and part...
In this paper, we propose a real-time moving target search algorithm for dynamic and partially obser...
In this thesis, we address the problem of real-time path search in partially observable grid worlds,...
In this paper we propose a real-time search algorithm called Real-Time Target Evaluation Search (RTT...
In this paper, we study moving-target search, where an agent (= hunter) has to catch a moving target...
Abstract—Path finding has its applications in both static and dynamic environments. Various algorith...
In moving target search, the objective is to guide a hunter agent to catch a moving prey. Even thoug...
Moving Target Search (MTS) is a dynamic path plan-ning problem, where an agent is trying to reach a ...
Moving Target Search (MTS) is a dynamic path planning problem, where an agent is trying to reach a m...
In this thesis, a new real-time multi-agent moving target pursuit algorithm and a moving target algo...
Path searching and mission planning are challenging problems in many domains such as war games, robo...
International audienceThis paper presents a generic discrete model for the moving, intelligent targe...
Traditional single-agent search algorithms usually make simplifying assumptions (single search agent...
Abstract: We consider an Ishida and Korf Moving Target Search (MTS) algorithm with informational dis...
We address the problem of searching for moving targets in large outdoor environments represented by ...
In this correspondence, we address the problem of real-time moving target search in dynamic and part...
In this paper, we propose a real-time moving target search algorithm for dynamic and partially obser...
In this thesis, we address the problem of real-time path search in partially observable grid worlds,...
In this paper we propose a real-time search algorithm called Real-Time Target Evaluation Search (RTT...
In this paper, we study moving-target search, where an agent (= hunter) has to catch a moving target...
Abstract—Path finding has its applications in both static and dynamic environments. Various algorith...
In moving target search, the objective is to guide a hunter agent to catch a moving prey. Even thoug...
Moving Target Search (MTS) is a dynamic path plan-ning problem, where an agent is trying to reach a ...
Moving Target Search (MTS) is a dynamic path planning problem, where an agent is trying to reach a m...
In this thesis, a new real-time multi-agent moving target pursuit algorithm and a moving target algo...
Path searching and mission planning are challenging problems in many domains such as war games, robo...
International audienceThis paper presents a generic discrete model for the moving, intelligent targe...
Traditional single-agent search algorithms usually make simplifying assumptions (single search agent...
Abstract: We consider an Ishida and Korf Moving Target Search (MTS) algorithm with informational dis...
We address the problem of searching for moving targets in large outdoor environments represented by ...