Abstract
We consider the convergence problem of autonomous mobile robots with inaccurate sensors, which may return the erroneous location of other robots. In this paper, we newly introduce a uniform error model, which is a restricted variant of the original observation-error model proposed by Cohen and Peleg [4]. The degree of an observation error is characterized by distance errors and angle errors. While the original model (non-uniform model) allows that two or more points can have different error degrees, the uniform error model assumes that the same amount of error degree is incurred to all observed points in a single observation. The main focus of our study is to reveal how much such uniformity expands the feasibility of the convergence. In the non-uniform error model, it has been shown that no algorithm can achieve the convergence if the maximum error angle is more than or equal to π/3. This paper shows that the convergence problem is solvable under the uniform error if the maximum error angle is less than π/ 2. We also prove that there is no convergence algorithm for the maximum error angle more than or equal to π/2 even in the uniform error model, which implies the optimality of our algorithm in the sense of angle errors.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distreibuted memoryless point convergence algorithm for mobile robots with lemited visibility. IEEE Transactions on Robotics and Automation 15(5), 818–828 (1999)
Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the robots gathering problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1181–1196. Springer, Heidelberg (2003)
Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM Journal on Computing 34(6), 1516–1528 (2005)
Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movement. SIAM Journal on Computing 38, 276–302 (2008)
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theoretical Computer Science 337(1-3), 147–168 (2005)
Izumi, T., Katayama, Y., Inuzuka, N., Wada, K.: Gathering autonomous mobile robots with dynamic compasses: An optimal result. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 298–312. Springer, Heidelberg (2007)
Katayama, Y., Tomida, Y., Imazu, H., Inuzuka, N., Wada, K.: Dynamic compass models and gathering algorithms for autonomous mobile robots. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 274–288. Springer, Heidelberg (2007)
Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theoretical Computer Science 384(2-3), 222–231 (2007)
Souissi, S., Defago, X., Yamashita, M.: Gathering asynchronous mobile robots with inaccurate compasses. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 333–349. Springer, Heidelberg (2006)
Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal on Computing 28(4), 1347–1363 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamamoto, K., Izumi, T., Katayama, Y., Inuzuka, N., Wada, K. (2010). Convergence of Mobile Robots with Uniformly-Inaccurate Sensors. In: Kutten, S., Žerovnik, J. (eds) Structural Information and Communication Complexity. SIROCCO 2009. Lecture Notes in Computer Science, vol 5869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11476-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-11476-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11475-5
Online ISBN: 978-3-642-11476-2
eBook Packages: Computer ScienceComputer Science (R0)