We present deterministic strategies for capturing a target taking a discrete random walk on a line segment. The searcher has a limited time budget. Its goal is to maximize the probability of capturing the target within the budget. A challenging aspect of our model is that the target can cross the searcher without being captured when they take the same edge at the same time in opposite directions. We present a POMDP approach for finding the optimal search strategy, as well as an efficient approximate solution to the POMDP. The strategies found by this approach reveal structural properties of the efficient search strategies which we exploit to solve the problem efficiently without the POMPD
We consider a search for a target moving within a known indoor environment partitioned into intercon...
Abstract — This paper studies the problem of searching for an unknown moving target in a bounded two...
Abstract. In search theory, the goal of the Optimal Search Path (OSP) problem is to find a finite le...
This paper addresses a fundamental search problem in which a searcher subject to time and energ...
In this paper we study the the problem of designing search strategies to find a target whose motion...
A lost target is a random walker on one of n disjoint lines, and the purpose is to detect the target...
Abstract This paper investiga-tes the search problem for a moving target when a search path is given...
AbstractA target, whose initial position is unknown, is performing a random walk on the integers. A ...
We present a simple paradigm for detection of an immobile target by a space-time coupled random walk...
We investigate the problem in which an agent has to find an object that moves between two locations ...
We propose a new heuristic for the single-searcher path-constrained discrete-time Markovian-target s...
We investigate the problem in which an agent has to find an object that moves between two locations ...
Abstract. We consider the problem of a robot searching for an unknown, yet visually recognizable tar...
Abstract. In the Optimal Search Path problem from search theory, the objective is to find a finite l...
We introduce a discrete-time search game, in which two players compete to find an invisible object f...
We consider a search for a target moving within a known indoor environment partitioned into intercon...
Abstract — This paper studies the problem of searching for an unknown moving target in a bounded two...
Abstract. In search theory, the goal of the Optimal Search Path (OSP) problem is to find a finite le...
This paper addresses a fundamental search problem in which a searcher subject to time and energ...
In this paper we study the the problem of designing search strategies to find a target whose motion...
A lost target is a random walker on one of n disjoint lines, and the purpose is to detect the target...
Abstract This paper investiga-tes the search problem for a moving target when a search path is given...
AbstractA target, whose initial position is unknown, is performing a random walk on the integers. A ...
We present a simple paradigm for detection of an immobile target by a space-time coupled random walk...
We investigate the problem in which an agent has to find an object that moves between two locations ...
We propose a new heuristic for the single-searcher path-constrained discrete-time Markovian-target s...
We investigate the problem in which an agent has to find an object that moves between two locations ...
Abstract. We consider the problem of a robot searching for an unknown, yet visually recognizable tar...
Abstract. In the Optimal Search Path problem from search theory, the objective is to find a finite l...
We introduce a discrete-time search game, in which two players compete to find an invisible object f...
We consider a search for a target moving within a known indoor environment partitioned into intercon...
Abstract — This paper studies the problem of searching for an unknown moving target in a bounded two...
Abstract. In search theory, the goal of the Optimal Search Path (OSP) problem is to find a finite le...