Amortized efficiency of list update and paging rules
Communications of the ACM
Information Processing Letters
Shortest watchman routes in simple polygons
Discrete & Computational Geometry
Theoretical Computer Science
Walking an unknown street with bounded detour
Computational Geometry: Theory and Applications
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
Searching for the kernel of a polygon—a competitive strategy
Proceedings of the eleventh annual symposium on Computational geometry
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
Competitive searching in a generalized street
Computational Geometry: Theory and Applications
The Polygon Exploration Problem
SIAM Journal on Computing
Going Home Through an Unknown Street
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Competitive Searching in Polygons - Beyond Generalised Streets
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Competitive exploration of rectilinear polygons
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
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 is the problem of a robot that does not have a map of its surroundings to see the complete polygon. In other words, for the robot to construct a map of the polygon. Exploration can be viewed as an online problem. Typical for online problems is that the solution method must make decisions based on past events but without knowledge about the future. In our case the robot does not have complete information about the environment. Competitive analysis can be used to measure the performance of methods solving online problems. The competitive factor of such a method is the ratio between the method's performance and the performance of the best method having full knowledge about the future. We prove a 5/3-competitive strategy for exploring a simple rectilinear polygon in the L1 metric. This improves the previous factor two bound of Deng, Kameda and Papadimitriou.