Abstract
In this paper, we have proposed a distributed algorithm for assembling of swarm of autonomous mobile robots on the left boundary of a rectangular region in presence of opaque horizontal line obstacles. The robots are having limited visibility capabilities and they are randomly scattered inside the region together with the obstacles. The robots do not have any message exchange among themselves. In the proposed algorithm, the robots follow the CORDA model for computation. In addition to that, synchronous/semi-synchronous timing model and full compass model are also followed. Our algorithm guarantees successful assembling of all the robots on the left boundary of the given region in a collision free manner.
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 subscriptionsReferences
Das, D., Mukhopadhyaya, S.: An algorithm for painting an area by swarm of mobile robots. Int. J. Inf. Process. 7(3), 1–15 (2013)
Das, D., Mukhopadhyaya, S., Nandi, D.: Multi-robot assembling along a boundary of a given region in presence of opaque line obstacles. In: Deiva Sundari, P., Dash, S.S., Das, S., Panigrahi, B.K. (eds.) Proceedings of 2nd International Conference on Intelligent Computing and Applications. AISC, vol. 467, pp. 21–29. Springer, Singapore (2017). doi:10.1007/978-981-10-1645-5_3
Efrima, A., Peleg, D.: Distributed algorithms for partitioning a swarm of autonomous mobile robots. Technical report MCS06-08, The Weizmann Institute of Science (2006)
Pagli, L., Principe, G., Viglietra, G.: Getting close without touching: near-gathering for autonomous mobile robots. Int. J. Distrib. Comput. 28(5), 333–349 (2015). Springer
Flochinni, P., Prencipe, G., Santoro, N., Widmayer, P.: Distributed coordination of a set of autonomous mobile robots. In: Proceedings of the IEEE Intelligent Vehicles Symposium, pp. 480–485 (2000)
Das, D., Mukhopadhyaya, S.: Painting an area by swarm of mobile robots with limited visibility. In: Venugopal, K.R., Patnaik, L.M. (eds.) ICIP 2012. CCIS, vol. 292, pp. 446–455. Springer, Heidelberg (2012). doi:10.1007/978-3-642-31686-9_52
Hoff III, N.R., Sagoff, A., Wood, R.J., Nagpal, R.: Two foraging algorithms for robot swarms using only local communication. In: IEEE International Conference on Robotics and Bioinformatics, pp. 123–130 (2010)
Prencipe, G.: Corda: distributed coordination of a set of autonomous mobile robots. In: Proceedings of 4th European Research Seminar on Advances in Distributed Systems, pp. 185–190 (2001)
Ballerini, M., Cabibbo, N., Candelier, R., Cavagna, A., Cisbani, E., Giardina, I., Lecomte, V., Orlandi, A., Parisi, G., Procaccini, A., Viale, M., Zdravkovic, V.: Interaction ruling animal collective behavior depends on topological rather than metric distance: evidence from a field study. Proc. Natl. Acad. Sci. USA 105(4), 1232–1237 (2007)
Murphy, R.R., Kravitz, J., Stover, S.L., Shoureshi, R.: Mobile robots in mine rescue and recovery. Robot. Autom. Mag. 16(2), 91–103 (2009). IEEE
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Tokas, P., Mekala, A., Das, D. (2017). Assembling Swarm with Limited Visibility in Presence of Line Obstacles. In: Singh, M., Gupta, P., Tyagi, V., Sharma, A., Ören, T., Grosky, W. (eds) Advances in Computing and Data Sciences. ICACDS 2016. Communications in Computer and Information Science, vol 721. Springer, Singapore. https://doi.org/10.1007/978-981-10-5427-3_7
Download citation
DOI: https://doi.org/10.1007/978-981-10-5427-3_7
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-5426-6
Online ISBN: 978-981-10-5427-3
eBook Packages: Computer ScienceComputer Science (R0)