56 search results - page 2 / 12 » Optimality and Competitiveness of Exploring Polygons by Mobi... |
84
Voted
STACS
1999
Springer
15 years 3 months ago
1999
Springer
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally ...
100
click to vote
DAGSTUHL
1994
15 years 27 days ago
1994
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
102
click to vote
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...
113
click to vote
IJCGA
2010
14 years 10 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
— Our goal is polygonal approximation of laser range data points obtained by a mobile robot. The proposed approach provides a precise estimation of the number of model components...