Environmental Protection by Robots

Authors

  • Rusul J. Alsaedi Al-Qasim Green University, Babylon 51013, Iraq

Keywords:

Environmental Protection, Mobile Robots, Luminous Model, Robot Coordination, Non-Overlapping Movement, Fully-Synchronous Mode, Two-Light Algorithm, O(N) Complexity

Abstract

Mobile robots are increasingly applied in critical domains such as environmental protection, where precise coordination is essential to avoid collision and ensure effective area coverage. In luminous robot models, coordination is typically achieved through visual cues, as robots lack memory, communication, or global knowledge of group size. The fully-synchronous model provides an opportunity to exploit predictability in robot behavior to develop efficient protection algorithms. Although several approaches address robot movement coordination, few achieve optimality with minimal light usage while ensuring non-overlapping trajectories in unknown-sized teams. This study proposes an algorithm that ensures all robots reach the environment’s boundary without overlapping and without prior knowledge of total robot count (n), using only two lights (black and gold) in a fully-synchronous setting. The algorithm successfully guides robots from arbitrary starting positions to non-overlapping positions along the environment’s circumference in O(n)O(n)O(n) rounds. Robots transition their light from black to gold upon reaching their final destination, providing a visible indicator of task completion. Unlike prior methods that assume robot chirality or require more complex communication or sensing capabilities, this solution is optimal in light usage and functions without coordinate agreement or global information. The results offer a practical and efficient strategy for autonomous swarm deployment in scenarios demanding high coordination with minimal resource use. Future work may adapt this approach to asynchronous modes or non-luminous robot models to broaden its applicability.

References

[1] K. Bose, R. Adhikary, M. K. Kundu, and B. Sau, "Arbitrary pattern formation by opaque fat robots with lights," in Conference on Algorithms and Discrete Applied Mathematics (CALDAM), Lecture Notes in Computer Science, vol. 12016, 2020, pp. 347–359.

[2] K. Bose, R. Adhikary, M. K. Kundu, A. Das, and B. Sau, "Distributed pattern formation by autonomous robot swarm," in 23rd International Conference on Distributed Computing and Networking (ICDCN), 2022, pp. 242–243.

[3] R. J. Alsaedi, "Gathering problem for fat mobile robots using memory," Int. J. Sci. Res., 2024.

[4] R. J. A. Alsaedi, "On the mutual visibility of fat mobile robots," PhD Thesis, Kent State University, 2016.

[5] R. J. Alsaedi, J. Gudmundsson, and A. van Renssen, "Pattern formation for fat robots with lights," Comput. Geom., p. 102161, 2024.

[6] R. J. Alsaedi, J. Gudmundsson, and A. van Renssen, "Pattern formation for fat robots with memory," ArXiv Prepr., 2023.

[7] R. J. Alsaedi, J. Gudmundsson, and A. van Renssen, "Shortest paths of mutually visible robots," ArXiv Prepr., 2023.

[8] R. J. Alsaedi, J. Gudmundsson, and A. van Renssen, "The mutual visibility problem for fat robots," in Algorithms and Data Structures Symposium, Springer, 2023, pp. 15–28.

[9] R. J. A. Alsaedi, "Visibility and Pattern Formation Problems in Robotics," PhD Thesis, The University of Sydney, 2024.

[10] K. Bose, M. K. Kundu, R. Adhikary, and B. Sau, "Arbitrary pattern formation by asynchronous opaque robots with lights," Theor. Comput. Sci., vol. 849, pp. 138–158, 2021.

[11] M. K. Kundu, P. Goswami, S. Ghosh, and B. Sau, "Arbitrary pattern formation by opaque fat robots on infinite grid," Int. J. Parallel Emergent Distrib. Syst., vol. 37, no. 5, pp. 542–570, 2022.

[12] S. Das, P. Flocchini, G. Prencipe, N. Santoro, and M. Yamashita, "Autonomous mobile robots with lights," Theor. Comput. Sci., vol. 609, pp. 171–184, 2016.

[13] G. Sharma, C. Busch, and S. Mukhopadhyay, "Bounds on mutual visibility algorithms," in 27th Canadian Conference on Computational Geometry (CCCG), 2015, pp. 268–274.

[14] D. Pattanayak, K.-T. Foerster, P. S. Mandal, and S. Schmid, "Conic formation in presence of faulty robots," in 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Lecture Notes in Computer Science, vol. 12503, 2020, pp. 170–185.

[15] P. Flocchini, G. Prencipe, and N. Santoro, Distributed Computing by Oblivious Mobile Robots, Synthesis Lectures on Distributed Computing Theory (SLDCT), Springer Cham, 2012.

[16] M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro, "Distributed computing by mobile robots: Gathering," SIAM J. Comput., vol. 41, no. 4, pp. 829–879, 2012.

[17] D. Peleg, "Distributed coordination algorithms for mobile robot swarms: New directions and challenges," in 7th International Workshop on Distributed Computing (IWDC), Lecture Notes in Computer Science, vol. 3741, 2005, pp. 1–12.

[18] R. Vaidyanathan, C. Busch, J. L. Trahan, G. Sharma, and S. Rai, "Logarithmic-time complete visibility for robots with lights," in 29th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2015, pp. 375–384.

[19] S. Ghosh, P. Goswami, A. Sharma, and B. Sau, "Move and time optimal arbitrary pattern formation by asynchronous robots on infinite grid," Int. J. Parallel Emergent Distrib. Syst., vol. 38, no. 1, 2023.

[20] G. A. D. Luna, P. Flocchini, S. G. Chaudhuri, F. Poloni, N. Santoro, and G. Viglietta, "Mutual visibility by luminous robots without collisions," Inf. Comput., vol. 254, pp. 392–418, 2017.

[21] G. Sharma, C. Busch, and S. Mukhopadhyay, "Mutual visibility with an optimal number of colors," in 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Lecture Notes in Computer Science, vol. 9536, 2015, pp. 196–210.

[22] N. Fujinaga, Y. Yamauchi, H. Ono, S. Kijima, and M. Yamashita, "Pattern formation by oblivious asynchronous mobile robots," SIAM J. Comput., vol. 44, no. 3, pp. 740–785, 2015.

[23] R. Vaidyanathan, G. Sharma, and J. Trahan, "On fast pattern formation by autonomous robots," Inf. Comput., vol. 285, p. 104699, 2022.

[24] G. A. D. Luna, P. Flocchini, F. Poloni, N. Santoro, and G. Viglietta, "The mutual visibility problem for oblivious robots," in 26th Canadian Conference on Computational Geometry (CCCG), 2014.

[25] G. Sharma, R. Alsaedi, C. Busch, and S. Mukhopadhyay, "The complete visibility problem for fat robots with lights," in 19th International Conference on Distributed Computing and Networking, 2018, pp. 1–4.

[26] K. Bose, A. Das, and B. Sau, "Pattern formation by robots with inaccurate movements," in 25th International Conference on Principles of Distributed Systems (OPODIS), Leibniz International Proceedings in Informatics (LIPIcs), vol. 217, 2021, pp. 10:1-10:20.

[27] S. G. Chaudhuri, S. Ghike, S. Jain, and K. Mukhopadhyaya, "Pattern formation for asynchronous robots without agreement in chirality," ArXiv Prepr., 2014.

[28] G. A. D. Luna, P. Flocchini, S. G. Chaudhuri, N. Santoro, and G. Viglietta, "Robots with lights: Overcoming obstructed visibility without colliding," in 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Lecture Notes in Computer Science, vol. 8756, 2014, pp. 150–164.

Downloads

Published

2025-04-19

How to Cite

Alsaedi, R. J. (2025). Environmental Protection by Robots . Vital Annex: International Journal of Novel Research in Advanced Sciences (2751-756X), 4(3), 44–50. Retrieved from https://journals.innoscie.com/index.php/ijnras/article/view/68

Issue

Section

Articles

Similar Articles

You may also start an advanced similarity search for this article.