Skip to main content
Log in

Hark! Who goes there? Concurrent association of communication channels for multiple mobile robots

  • Published:
Autonomous Robots Aims and scope Submit manuscript

Abstract

Robots working in teams can benefit from recruiting the help of nearby robots. But, while robots are typically aware of their neighbors’ relative positions through information sensed locally (e.g., range and bearing), a robot does not necessarily know the network identifiers (IDs) of its neighbors directly from observation. In this work robots use a simple visual gesture, paired with wireless messages, to rapidly and effectively establish a one-to-one association between the relative positions (local, visual IDs) of neighboring robots and their network addresses (global, wireless IDs). We formalize the channel association problem and explore its structure from an information filter perspective. Under an idealized communication model, we investigate two simple probabilistic algorithms and contribute analyses of performance in terms of parameters, such as robot density, communication range, and movement speed. Branching Processes are used to predict the macroscopic performance of the algorithms, producing models that characterize the channel association behavior, given parameters that describe the multi-robot system. The approach also allows parameters to be fine-tuned when designing a system so that its performance meets some specified threshold.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26

Similar content being viewed by others

Notes

  1. The systems in Fig. 1 also established a shared spatial representation and the visual markers were helpful in that regard too—the present work is concerned solely with the association problem.

References

  • Agre, P. E., Chapman, D. (1987). Pengi an implementation of a theory of activity. In Proceedings of the Sixth National Conference on Artificial Intelligence, (Vol. 1, pp. 268–272). Palo Alto, CA: AAAI Press.

  • Batalin, M. A., Sukhatme, G. S. (2002). Spreading out: A local approach to multi-robot coverage. In Distributed Autonomous Robotic Systems 5, (pp. 373–382). Tokyo: Springer.

  • Berend, D., & Tassa, T. (2010). Improved bounds on Bell numbers and on moments of sums of random variables. Probability and Mathematical Statistics, 30(2), 185–205.

    MathSciNet  MATH  Google Scholar 

  • Dieudonné, Y., Dolev, S., Petit, F., Segal. M. (2009). Deaf, dumb, and chatting asynchronous robots. In Proceedings of the 13th International Conference on Principles of Distributed Systems, (Vol. 09, pp. 71–85). Berlin: Springer.

  • Fox, D., Burgard, W., Kruppa, H., & Thrun, S. (2000). A probabilistic approach to collaborative multi-robot localization. Autonomous Robots, 8(3), 325–344.

    Article  Google Scholar 

  • Franchi, A., Oriolo, G., Stegagno, P. (2009). Mutual localization in a multi-robot system with anonymous relative position measures. In Proceedings of the 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS’09, (pp. 3974–3980). Piscataway, NJ: IEEE Press.

  • Garrido-Jurado, S., Muñoz Salinas, R., Madrid-Cuevas, F. J., & Marín-Jiménez, M. J. (2014). Automatic generation and detection of highly reliable fiducial markers under occlusion. Pattern Recognition, 47(6), 2280–2292.

    Article  Google Scholar 

  • Grinstead, C. M., & Snell, J. L. (1997). Introduction to probability., Chapter 11: markov chains Providence, RI: American Mathematical Society.

    MATH  Google Scholar 

  • Gutiérrez, Á., Campo, A., Dorigo, M., Amor, D., Magdalena, L., & Monasterio-Huelin, F. (2008). An open localization and local communication embodied sensor. Sensors, 8(11), 7545–7563.

    Article  Google Scholar 

  • Haccou, P., Jagers, P., & Vatutin, V. A. (2007). Branching processes: Variation, growth, and extinction of populations. Cambridge: Cambridge University Press.

    MATH  Google Scholar 

  • Howard, A., Parker, L. E., Sukhatme, G. S. (2006). The SDR experience: Experiments with a large-scale heterogeneous mobile robot team. In Experimental Robotics IX: The 9th International Symposium on Experimental Robotics, (pp. 121–130). Heidelberg: Springer.

  • Ivanov, P., Shell, D. A.(2014). Associating nearby robots to their voices. In Proceedings of The Fourteenth International Conference on the Synthesis and Simulation of Living Systems (ALIFE 14) 2014, (pp. 274–281). Cambridge, MA: MIT Press.

  • Kwak, B., Song, N., & Miller, L. E. (2005). Performance analysis of exponential backoff. IEEE/ACM Transactions on Networking, 13(2), 343–355.

    Article  Google Scholar 

  • LaValle, S. M. (2009). Tutorial: Filtering and planning in information space. In Proceedings of the 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS’09, Piscataway, NJ: IEEE Press.

  • Lespérance, Y., & Levesque, H. J. (1995). Indexical knowledge and robot action: A logical account. Artificial Intelligence, 73(1–2), 69–115.

    Article  Google Scholar 

  • Mathews, N., Christensen, A. L., O’Grady, R., Dorigo, M. (2012). Spatially targeted communication and self-assembly. In 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS’12, (pp. 2678–2679), Piscataway, NJ: IEEE Press.

  • Mathews, N., Valentini, G., Christensen, A. L., O’Grady, R., Brutschy, A., & Dorigo, M. (2015). Spatially targeted communication in decentralized multirobot systems. Autonomous Robots, 38(4), 439–457.

    Article  Google Scholar 

  • Olson, E. (2011). Apriltag: A robust and flexible visual fiducial system. In 2011 IEEE International Conference on Robotics and Automation (ICRA), (pp. 3400–3407). Piscataway, NJ: IEEE Press.

  • Pulli, K., Baksheev, A., Kornyakov, K., & Eruhimov, V. (2012). Real-time computer vision with openCV. Communications of the ACM, 55(6), 61–69.

    Article  Google Scholar 

  • Støy, K. (2001). Using situated communication in distributed autonomous mobile robotics. In Proceedings of the Seventh Scandinavian Conference on Artificial Intelligence, SCAI’01, (pp. 44–52), Amsterdam: IOS Press.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Plamen Ivanov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ivanov, P., Shell, D.A. Hark! Who goes there? Concurrent association of communication channels for multiple mobile robots. Auton Robot 41, 811–829 (2017). https://doi.org/10.1007/s10514-016-9570-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10514-016-9570-4

Keywords

Navigation