Improved exploration of rectilinear polygons
Nordic Journal of Computing
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
VC-Dimension of Exterior Visibility
IEEE Transactions on Pattern Analysis and Machine Intelligence
Searching with an autonomous robot
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Competitive exploration of rectilinear polygons
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Online searching with an autonomous robot
Computational Geometry: Theory and Applications
Optimal constrained graph exploration
ACM Transactions on Algorithms (TALG)
Online searching with turn cost
Theoretical Computer Science - Approximation and online algorithms
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Polygon exploration with time-discrete vision
Computational Geometry: Theory and Applications
Inspecting a Set of Strips Optimally
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Online searching with an autonomous robot
Computational Geometry: Theory and Applications
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Information Processing Letters
Multi-robot tree and graph exploration
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
Optimality and competitiveness of exploring polygons by mobile robots
Information and Computation
Exploration strategies for a robot with a continously rotating 3D scanner
SIMPAR'10 Proceedings of the Second international conference on Simulation, modeling, and programming for autonomous robots
Exploring and triangulating a region by a swarm of robots
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Exploring an unknown graph efficiently
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Exploring simple grid polygons
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Optimal exploration of terrains with obstacles
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Reconstructing visibility graphs with simple robots
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Reconstructing visibility graphs with simple robots
Theoretical Computer Science
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
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
Observe and remain silent (communication-less agent location discovery)
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Worst-case optimal exploration of terrains with obstacles
Information and Computation
Characterizing and recognizing LR-visibility polygons
Discrete Applied Mathematics
Hi-index | 0.00 |
We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be computed off-line.Our analysis is doubly founded on a novel geometric structure called angle hull. Let D be a connected region inside a simple polygon, P. We define the angle hull of D, ${\cal AH}(D)$, to be the set of all points in P that can see two points of D at a right angle. We show that the perimeter of ${\cal AH}(D)$ cannot exceed in length the perimeter of D by more than a factor of 2. This upper bound is tight.