(44-3) 19 * << * >> * Russian * English * Content * All Issues

Optimal planning of networks of mobile objects under uncertainty
Y.A. Mostovoy 1, V.A. Berdnikov 1

1 Samara National Research University, 443086, Samara, Russia, Moskovskoye Shosse 34

 PDF, 923 kB

DOI: 10.18287/2412-6179-CO-599

Pages: 466-475.

Full text of article: Russian language.

Abstract:
When solving a given common task, a swarm of moving objects coordinates the state of its individual members. When planning swarm operations, there is a need to take into account the possibility of its operational regrouping, since at the time of planning the exact purpose of the swarm operation may be either not yet defined, or secret, or determined by a number of random circumstances. At the same time, the swarm resources are insufficient for one-time coverage of all possible targets in a given service area. Therefore, the execution of the operation of the swarm begins to resolve the aforementioned uncertainties. In this case, the operation time can be significantly reduced. This problem is solved by methods of the percolation theory. A concept of programmable percolation of the service area, which is implemented in two phases, is introduced. The value of the concentration of objects in a basic stochastic swarm is obtained numerically -- using the results of statistical modeling of two-phase operations -- and analytically, providing a minimum total cost of the two-phase operation. The synergy of information interaction between the swarm objects when implementing a programmable percolation path is analyzed.

Keywords:
mathematical modeling, percolation theory, probability theory, swarm of robots.

Citation:
Mostovoy YA, Berdnikov VA. Optimal planning of networks of mobile objects under uncertainty. Computer Optics 2020; 44(3): 466-475. DOI: 10.18287/2412-6179-CO-599.

References:
  1. Kalyaev IA, Gayduk AR, Kapustyan SG. Models and algorithms of team management in robot teams [In Russian]. Moscow: "Fizmatlit" Publisher; 2009.
  2. Kalyaev IA, Gaiduk AR. Social principles of management in the entity groups. Mechatronics, Automation, Control 2004; 12: 27-38.
  3. Grosan C, Abraham A, Chis M. Swarm intelligence in data mining. In Book: Abraham A, Grosan C, Ramos V, eds. Swarm intelligence in data mining. Berlin, Heidelberg: Springer-Verlag; 2006: 1-20. DOI: 10.1007/978-3-540-34956-3_1.
  4. Beni G. From swarm intelligence to swarm robotics. In Book: Şahin E, Spears WM, eds. Swarm Robotics. SAB 2004 International Workshop. Berlin, Heidelberg: Springer-Verlag; 2005: 1-9.
  5. Bonabeau E, Meyer Ch. Swarm intelligence: a whole new way to think about business. Harv Bus Rev 2001; 79(5): 106-114.
  6. Sahin E. Swarm robotics: From sources of inspiration to domains of application. In Book: Şahin E, Spears WM, eds. Swarm Robotics. SAB 2004 International Workshop. Berlin, Heidelberg: Springer-Verlag; 2005: 10-20.
  7. Moskalev PV, Shitov VV. Mathematical modeling of porous structures [In Russian]. Moscow: "Fizmatlit" Publisher; 2007.
  8. Alexandrowicz Z. Critically branched chains and percolation clusters. Phys Lett A 1980; 80(4): 284-286.
  9. Stauffer D. Scaling theory of percolation clusters. Phys Rep 1979; 54: 1-74.
  10. Stauffer D, Aharony A. Introduction to percolation theory. London: Taylor & Francis; 1992.
  11. Tarasevich YY. Percolation: theory, applications, algorithms. Moscow: "URSS" Publisher; 2002.
  12. Galam S, Mauger A. Universal formulas for percolation thresholds. Phys Rev E 1996; 53(3): 2177-2181.
  13. Mostovoy JA. Statistical phenomena for scale distributed clusters of nanosatellites [In Russian]. Vestnik of Samara University 2011; 26: 80-89.
  14. Mostovoy YA. Two-phase operations in scale networks of nanosatellites. Computer Optics 2013; 37(1): 120-130.
  15. Mostovoy YaA. Controlled percolation and optimal two-phase operations in scale networks of nanosatellites [In Russian]. Vestnik of Samara University. Aerospace and Mechanical Engineering 2014; 1(43): 253-266.
  16. Mostovoi YA. Simulation of optimal two-phase operations in random operating environments. Optoelectronics, In-strumentation and Data Processing 2015; 51(3): 241-246.
  17. Mostovoy YA, Berdnikov VA. Large scale networks security strategy. CEUR Workshop Proceedings 2017; 1901: 187-193.
  18. Mostovoy YA, Berdnikov VA. Statistical modeling of a scale network of nanosatellites. J Phys: Conf Ser 2018; 1096(1): 012184.
  19. Mostovoy YA, Berdnikov VA. Planning of a large network of nanosatellites with coverage of the inter-orbit interval of the orbit route. Proceedings of the conference "VI all-Russian scientific and technical conference with international participation". Actual problems of rocket and space technology ("VI Kozlov readings")" 2019; 2: 157-169.
  20. Mostovoy YA, Berdnikov VA. Analytical and numerical modeling of the process for cluster emergence of objects in a random environment. J Phys: Conf Ser 2018; 1096(1): 012185.
  21. The U.S. military's ultimate weapon is almost here: The 'Swarm'. Source: <https://nationalinterest.org/blog/the-buzz/the-us-militarys-ultimate-weapon-almost-here-the-swarm-18173>.
  22. Babalievski F. Cluster counting: Hoshen-Kopelman algo-rithm versus spanning three approach. Int J Mod Phys C 1998; 9(1): 43-61.
  23. Hoshen J, Kopelman R. Percolation and cluster distribution. I. Cluster multiple labeling technique and critical concentration algorithm. Phys Rev B 1976; 14: 3438-3445.
  24. Wadzinski RN. The reference probability distributions [In Russian]. Saint-Petersburg: "Nauka" Publisher; 2001.
  25. Euler L. De serie Lambertina Plurimisque eius insignibus proprietatibus. Acta Acad Scient Petropol 1783; 2: 29-51. Reprinted In Book: Euler L. Opera Omnia, Series Prima. Vol 6 Commentationes Algebraicae. Leipzig, Germany: Teubner; 1921: 350-369.
  26. Bezruchko BP, Koronovskii AA, Trubetskov DI, Khramov AE. The way to synergetics. Excursion in ten lectures [In Russian]. Moscow: "KomKniga" Publisher; 2005. .

© 2009, IPSI RAS
151, Molodogvardeiskaya str., Samara, 443001, Russia; E-mail: ko@smr.ru ; Tel: +7 (846) 242-41-24 (Executive secretary), +7 (846) 332-56-22 (Issuing editor), Fax: +7 (846) 332-56-20