Amortized efficiency of list update and paging rules
Communications of the ACM
Self-adjusting binary search trees
Journal of the ACM (JACM)
Shortest watchman routes in simple polygons
Discrete & Computational Geometry
Theoretical Computer Science
How to learn an unknown environment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Walking an unknown street with bounded detour
Computational Geometry: Theory and Applications
Three-dimensional computer vision: a geometric viewpoint
Three-dimensional computer vision: a geometric viewpoint
Information and Computation
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
An efficient strategy for robot navigation in unknown environment
Information Processing Letters
Searching for the kernel of a polygon—a competitive strategy
Proceedings of the eleventh annual symposium on Computational geometry
Navigating in Unfamiliar Geometric Terrain
SIAM Journal on Computing
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem
Information and Computation
New competitive strategies for searching in unknown star-shaped polygons
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Optimal on-line algorithms for walking with minimum number of turns in unknown streets
Computational Geometry: Theory and Applications
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
Optimal constructions of hybrid algorithms
Journal of Algorithms
Tight analysis of a self-approaching strategy for the online kernel-search problem
Information Processing Letters
How to find a point on a line within a fixed distance
Discrete Applied Mathematics - Special issue on the 13th European workshop on computational geometry CG '97
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A competitive strategy for learning a polygon
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
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
An Online Algorithm for Improving Performance in Navigation
SIAM Journal on Computing
The ultimate strategy to search on m rays?
Theoretical Computer Science
Robot Motion Planning
Navigating Mobile Robots: Systems and Techniques
Navigating Mobile Robots: Systems and Techniques
Directed Sonar Sensing for Mobile Robot Navigation
Directed Sonar Sensing for Mobile Robot Navigation
The Polygon Exploration Problem
SIAM Journal on Computing
Improved exploration of rectilinear polygons
Nordic Journal of Computing
Exploring an Unknown Polygonal Environment with Bounded Visibility
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Going Home Through an Unknown Street
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Position-Independent Street Searching
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Searching Rectilinear Streets Completely
WADS '99 Proceedings of the 6th 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
A New Competitive Algorithm for Agent Searching in Unknown Streets
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
On-line Searching and Navigation
Developments from a June 1996 seminar on Online algorithms: the state of the art
Competitive Analysis of Algorithms
Developments from a June 1996 seminar on Online algorithms: the state of the art
On-Line Searching in Simple Polygons
Selected Papers from the International Workshop on Sensor Based Intelligent Robots
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
A lower bound for randomized searching on m rays
Computer Science in Perspective
On-line target searching in bounded and unbounded domains
On-line target searching in bounded and unbounded domains
Searching and on-line recognition of star-shaped polygons
Information and Computation
Theoretical Computer Science
An Optimal Competitive Strategy for Walking in Streets
SIAM Journal on Computing
On-line path planning in an unknown polygonal environment
Information Sciences—Informatics and Computer Science: An International Journal
Competitive exploration of rectilinear polygons
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Online searching with turn cost
Theoretical Computer Science - Approximation and online algorithms
Visibility Algorithms in the Plane
Visibility Algorithms in the Plane
Polygon exploration with time-discrete vision
Computational Geometry: Theory and Applications
On the optimality of spiral search
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Computational Geometry: Theory and Applications
Online exploration of all vertices in a simple polygon
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science
| Hi-index | 0.00 |
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.