SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The vertex-edge visibility graph of a polygon
Computational Geometry: Theory and Applications
Piecemeal graph exploration by a mobile robot
Information and Computation
Exploring unknown undirected graphs
Journal of Algorithms
Discrete Mathematics
Orthogonal polygon reconstruction from stabbing information
Computational Geometry: Theory and Applications
Visibility graph recognition
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Visibility Algorithms in the Plane
Visibility Algorithms in the Plane
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
International Journal of Robotics Research
Simple Robots in Polygonal Environments: A Hierarchy
Algorithmic Aspects of Wireless Sensor Networks
Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Reconstructing Polygons from Scanner Data
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Counting targets with mobile sensors in an unknown environment
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Constructing a map of an anonymous graph: applications of universal sequences
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A polygon is determined by its angles
Computational Geometry: Theory and Applications
An improved algorithm for reconstructing a simple polygon from its visibility angles
Computational Geometry: Theory and Applications
Reconstructing visibility graphs with simple robots
Theoretical Computer Science
Hi-index | 0.04 |
This paper gives an introduction to the problem of mapping simple polygons with autonomous agents. We focus on minimalistic agents that move from vertex to vertex along straight lines inside a polygon, using their sensors to gather local data at each vertex. Our attention revolves around the question whether a given configuration of sensors and movement capabilities of the agents allows them to capture enough data in order to draw conclusions regarding the global layout of the polygon. In particular, we study the problem of reconstructing the visibility graph of a simple polygon by an agent moving either inside or on the boundary of the polygon. Our aim is to provide insight about the algorithmic challenges faced by an agent trying to map a polygon. We present an overview of techniques for solving this problem with agents that are equipped with simple sensorial capabilities. We illustrate these techniques on examples with sensors that measure angles between lines of sight or identify the previous location. We also give an overview over related problems in combinatorial geometry as well as graph exploration.