Information Processing Letters
Theoretical Computer Science
An efficient strategy for robot navigation in unknown environment
Information Processing Letters
Piecemeal Learning of an Unknown Environment
Machine Learning - Special issue on COLT '93
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
On-line search in a simple polygon
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The Polygon Exploration Problem
SIAM Journal on Computing
Improved exploration of rectilinear polygons
Nordic Journal of Computing
Polygon exploration with time-discrete vision
Computational Geometry: Theory and Applications
An information-based exploration strategy for environment mapping with mobile robots
Robotics and Autonomous Systems
Optimality and competitiveness of exploring polygons by mobile robots
Information and Computation
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
| Hi-index | 0.00 |
Exploring a polygon with robots when the robots do not have knowledge of the surroundings can be viewed as an online problem. Typical for online problems is that decisions must be made based on past events without complete information about the future. In our case the robots do not have complete information about the environment. Competitive analysis can be used to measure the performance of methods solving online problems. The competitive ratio of such a method is the ratio between the method's performance and the performance of the best method having full knowledge of the future. We prove constant competitive strategies and lower bounds for exploring a simple rectilinear polygon in the L1 metric.