Abstract
We consider a simple robot inside a polygon \(\mathcal{P}\) with holes. The robot can move between vertices of \(\mathcal{P}\) along lines of sight. When sitting at a vertex, the robot observes the vertices visible from its current location, and it can use a compass to measure the angle of the boundary of \(\mathcal{P}\) towards north. The robot initially only knows an upper bound \(\bar{n}\) on the total number of vertices of \(\mathcal{P}\). We study the mapping problem in which the robot needs to infer the visibility graph G vis of \(\mathcal{P}\) and needs to localize itself within G vis. We show that the robot can always solve this mapping problem. To do this, we show that the minimum base graph of G vis is identical to G vis itself. This proves that the robot can solve the mapping problem, since knowing an upper bound on the number of vertices was previously shown to suffice for computing G vis.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transactions on Robotics and Automation 15(5), 818–828 (1999)
Bender, M., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: Exploring and mapping directed graphs. In: Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 269–287 (1998)
Bilò, D., Disser, Y., Mihalák, M., Suri, S., Vicari, E., Widmayer, P.: Reconstructing visibility graphs with simple robots. Theoretical Computer Science 444, 52–59 (2012)
Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Mathematics 243(1-3), 21–66 (2002)
Brunner, J., Mihalák, M., Suri, S., Vicari, E., Widmayer, P.: Simple robots in polygonal environments: A hierarchy. In: Proceedings of the Fourth International Workshop on Algorithmic Aspects of Wireless Sensor Networks, pp. 111–124 (2008)
Chalopin, J., Das, S., Disser, Y., Mihalák, M., Widmayer, P.: Mapping simple polygons: How robots benefit from looking back. Algorithmica (2011)
Chalopin, J., Das, S., Disser, Y., Mihalák, M., Widmayer, P.: Telling convex from reflex allows to map a polygon. In: Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, pp. 153–164 (2011)
Chen, D., Wang, H.: An improved algorithm for reconstructing a simple polygon from the visibility angles. Computational Geometry: Theory and Applications 45, 254–257 (2012)
Disser, Y.: Mapping Polygons. Ph.D. thesis, ETH Zurich (2011)
Disser, Y., Mihalák, M., Widmayer, P.: Reconstruction of a polygon from angles without prior knowledge of the size. Tech. Rep. 700, ETH Zürich, Institute of Theoretical Computer Science (November 2010)
Disser, Y., Mihalák, M., Widmayer, P.: A polygon is determined by its angles. Computational Geometry: Theory and Applications 44, 418–426 (2011)
Donald, B.R.: On information invariants in robotics. Artificial Intelligence 72(1-2), 217–304 (1995)
Ganguli, A., Cortés, J., Bullo, F.: Distributed deployment of asynchronous guards in art galleries. In: Proceedings of the 2006 American Control Conference, pp. 1416–1421 (2006)
Gfeller, B., Mihalak, M., Suri, S., Vicari, E., Widmayer, P.: Counting targets with mobile sensors in an unknown environment. In: Proceedings of the 3rd International Workshop on Algorithmic Aspects of Wireless Sensor Networks, pp. 32–45 (2007)
Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press (2007)
Ghosh, S.K., Goswami, P.P.: Unsolved problems in visibility graph theory. In: Proceedings of the India-Taiwan Conference on Discrete Mathematics, pp. 44–54 (2009)
Katsev, M., Yershova, A., Tovar, B., Ghrist, R., LaValle, S.M.: Mapping and pursuit-evasion strategies for a simple wall-following robot. IEEE Transactions on Robotics 27(1), 113–128 (2011)
O’Kane, J.M., LaValle, S.M.: On comparing the power of robots. International Journal of Robotics Research 27(1), 5–23 (2008)
Suri, S., Vicari, E., Widmayer, P.: Simple robots with minimal sensing: From local visibility to global geometry. International Journal of Robotics Research 27(9), 1055–1067 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Disser, Y., Ghosh, S.K., Mihalák, M., Widmayer, P. (2013). Mapping a Polygon with Holes Using a Compass. In: Bar-Noy, A., Halldórsson, M.M. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2012. Lecture Notes in Computer Science, vol 7718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36092-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-36092-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36091-6
Online ISBN: 978-3-642-36092-3
eBook Packages: Computer ScienceComputer Science (R0)