AbstractIn this paper we investigate parallel searching in the plane using robots as searchers. We show that a huge number of robots are not necessary for several problems and under different assumptions. This corresponds to real situations since, actually, the number of processors of parallel machines is fixed and independent of the dimension of the problem to be solved
We consider the problem of fault-tolerant parallel search on an infinite line by n robots. Starting ...
In this paper, we survey online algorithms in computational geometry that have been designed for mob...
We introduce and study a new problem concerning the exploration of a geometric domain by mobile robo...
AbstractIn this paper we investigate parallel searching in the plane using robots as searchers. We s...
In this paper we show that parallel search techniques derived from their sequential counterparts can...
AbstractIn this paper we investigate parallel searches on m concurrent rays for a point target t loc...
AbstractIn this paper we initiate a new area of study dealing with the best way to search a possibly...
In this paper we initiate a new area of study dealing with the best way to search a possibly unbound...
AbstractWe investigate parallel searching on m concurrent rays. We assume that a target t is located...
© Springer Nature Switzerland AG 2018. In the classical search problem on the line or in higher dime...
Abstract — In this paper, we examine the problem of locating a non-adversarial target using multiple...
We consider the problem of searching on a line using n mobile robots, of which at most f are faulty,...
We present a novel approach to parallel motion planning for robot manipulators in 3D workspace...
We introduce and study a new problem concerning the exploration of a geometric domain by mobile robo...
We investigate parallel searching on $m$ concurrent rays. We assume that a target $t$ is located s...
We consider the problem of fault-tolerant parallel search on an infinite line by n robots. Starting ...
In this paper, we survey online algorithms in computational geometry that have been designed for mob...
We introduce and study a new problem concerning the exploration of a geometric domain by mobile robo...
AbstractIn this paper we investigate parallel searching in the plane using robots as searchers. We s...
In this paper we show that parallel search techniques derived from their sequential counterparts can...
AbstractIn this paper we investigate parallel searches on m concurrent rays for a point target t loc...
AbstractIn this paper we initiate a new area of study dealing with the best way to search a possibly...
In this paper we initiate a new area of study dealing with the best way to search a possibly unbound...
AbstractWe investigate parallel searching on m concurrent rays. We assume that a target t is located...
© Springer Nature Switzerland AG 2018. In the classical search problem on the line or in higher dime...
Abstract — In this paper, we examine the problem of locating a non-adversarial target using multiple...
We consider the problem of searching on a line using n mobile robots, of which at most f are faulty,...
We present a novel approach to parallel motion planning for robot manipulators in 3D workspace...
We introduce and study a new problem concerning the exploration of a geometric domain by mobile robo...
We investigate parallel searching on $m$ concurrent rays. We assume that a target $t$ is located s...
We consider the problem of fault-tolerant parallel search on an infinite line by n robots. Starting ...
In this paper, we survey online algorithms in computational geometry that have been designed for mob...
We introduce and study a new problem concerning the exploration of a geometric domain by mobile robo...
DOI
Add to ORKG