Abstract
We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets in a (simply- or multiply-connected) polygonal workspace, and a moving point-robot whose sensory input at any location is a binary vector representing the cyclic order of the polygon vertices and targets visible to the robot. In particular, the sensing model provides no coordinates, distance or angle measurements. We investigate this problem under two natural models of environment, friendly and hostile, which differ only in whether the robot can visit the targets or not, and under three different models of motion capability.
In the friendly scenario we show that the robots can count the targets, whereas in the hostile scenario no (2 − ε)-approximation is possible, for any ε> 0. Next we consider two, possibly minimally more powerful robots that can count the targets exactly.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Suri, S., Vicari, E., Widmayer, P.: Simple robots with minimal sensing: From local visibility to global geometry. In: Proceedings of the Twenty-Second National Conference on Artificial Intelligence and the Nineteenth Innovative Applications of Artificial Intelligence Conference, pp. 1114–1120. AAAI Press, Stanford, California, USA (2007)
Chvátal, V.: A combinatorial theorem in plane geometry. Journal of Combinatorial Theory 18, 39–41 (1975)
Latombe, J.C.: Robot Motion Planning. Kluwer Academic Publishers, Norwell, MA, USA (1991)
LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge, UK (2006)
Tovar, B., Freda, L., LaValle, S.M.: Using a robot to learn geometric information from permutations of landmarks. Contemporary Mathematics (to appear, 2007)
Yershova, A., Tovar, B., Ghrist, R., LaValle, S.M.: Bitbots: Simple robots solving complex tasks. In: Proceedings of the Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, pp. 1336–1341 (2005)
Guibas, L.J., Latombe, J.C., LaValle, S.M., Lin, D., Motwani, R.: A visibility-based pursuit-evasion problem. International Journal of Computational Geometry and Applications 9, 471–494 (1999)
Sachs, S., Rajko, S., LaValle, S.M.: Visibility-based pursuit-evasion in an unknown planar environment. International Journal of Robotics Research 23, 3–26 (2004)
Gfeller, B., Suri, S., Mihalák, M., Vicari, E., Widmayer, P.: Counting targets with mobile sensors in an unknown environment. Technical Report 571, Department of Computer Science, ETH Zurich (2007)
Narasimhan, G.: On hamiltonian triangulations in simple polygons. International Journal of Computational Geometry and Applications 9, 261–275 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gfeller, B., Mihalák, M., Suri, S., Vicari, E., Widmayer, P. (2008). Counting Targets with Mobile Sensors in an Unknown Environment. In: Kutyłowski, M., Cichoń, J., Kubiak, P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2007. Lecture Notes in Computer Science, vol 4837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77871-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-77871-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77870-7
Online ISBN: 978-3-540-77871-4
eBook Packages: Computer ScienceComputer Science (R0)