DOIAbstract
In this paper, we survey online algorithms in computational geometry that have been designed for mobile robots for searching a target and for exploring a region in the plane
In this paper, we survey online algorithms in computational geometry that have been designed for mobile robots for searching a target and for exploring a region in the plane
AbstractWe discuss online strategies for visibility-based searching for an object hidden behind a co...
AbstractIn this paper we investigate parallel searching in the plane using robots as searchers. We s...
In this survey, two different kinds of geometrical localization problems with applications in robo...
We consider a number of problems faced by a robot trying to navigate inside a simple polygon. Such ...
There are three fundamental online problems in robotics: naviga-tion/search, localization, and explo...
In the mathematical discipline of computational geometry (CG), practical algorithms for resolving ge...
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...
Searching for a target in an unknown environment is a basic task scenario of robots. It has a wide r...
In this paper we study the problem of a robot searching for a visually recognizable target in an unk...
In this paper we study the problem of a robot searching for a visually recognizable target in an unk...
An agent is placed in an unknown environment and charged with the task of locating a lost object. Wh...
International audienceA mobile robot, represented by a point moving along a polygonal line in the pl...
The detection of planes is a useful capability for a safe navigation algorithm, which is a crucial t...
We discuss online strategies for visibility-based searching for an object hidden behind a corner, us...
AbstractWe discuss online strategies for visibility-based searching for an object hidden behind a co...
AbstractIn this paper we investigate parallel searching in the plane using robots as searchers. We s...
In this survey, two different kinds of geometrical localization problems with applications in robo...
We consider a number of problems faced by a robot trying to navigate inside a simple polygon. Such ...
There are three fundamental online problems in robotics: naviga-tion/search, localization, and explo...
In the mathematical discipline of computational geometry (CG), practical algorithms for resolving ge...
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...
Searching for a target in an unknown environment is a basic task scenario of robots. It has a wide r...
In this paper we study the problem of a robot searching for a visually recognizable target in an unk...
In this paper we study the problem of a robot searching for a visually recognizable target in an unk...
An agent is placed in an unknown environment and charged with the task of locating a lost object. Wh...
International audienceA mobile robot, represented by a point moving along a polygonal line in the pl...
The detection of planes is a useful capability for a safe navigation algorithm, which is a crucial t...
We discuss online strategies for visibility-based searching for an object hidden behind a corner, us...
AbstractWe discuss online strategies for visibility-based searching for an object hidden behind a co...
AbstractIn this paper we investigate parallel searching in the plane using robots as searchers. We s...
In this survey, two different kinds of geometrical localization problems with applications in robo...
Add to ORKG