Abstract
Consider a given planar circular region, in which there is an unknown number of smart mobile evaders. We wish to detect evaders using a line formation of sweeping agents whose total sensing length is predetermined. We propose procedures for designing spiral sweeping protocols that ensure the successful completion of the task, thus deriving conditions on the sweeping speed of the linear formation and its path. Successful completion of the task implies that evaders with a given limit on their speed cannot escape the sweeping agents. A simpler task for the sweeping formation is the confinement of evaders to a desired region. The feasibility of completing these tasks depends on geometric and dynamic constraints that impose a lower bound on the speed that the agents’ formation must have. This speed is derived to ensure the satisfaction of the confinement task and increasing it above the lower bound enables sweepers to complete the full search task as well. We present two spiral line formation search processes for smart evaders, that address current limitations in search against smart evaders and present a quantitative and qualitative comparison analysis between the total search time of circular line formation sweep processes and spiral line formation processes. We evaluate the different strategies by using two metrics, total search time and the minimal critical speed required for a successful search.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Altshuler, Y., Yanovski, V., Wagner, I.A., Bruckstein, A.M.: Multi-agent cooperative cleaning of expanding domains. Int. J. Robot. Res. 30(8), 1037–1071 (2011)
Altshuler, Y., Yanovsky, V., Wagner, I.A., Bruckstein, A.M.: Efficient cooperative search of smart targets using UAV swarms. Robotica 26(4), 551–557 (2008)
Bressan, A., Wang, T.: On the optimal strategy for an isotropic blocking problem. Calc. Var. Partial. Differ. Equ. 45(1–2), 125–145 (2012)
Chung, T.H., Hollinger, G.A., Isler, V.: Search and pursuit-evasion in mobile robotics. Auton. Robot. 31(4), 299–316 (2011)
Francos, R.M., Bruckstein, A.M.: Search for smart evaders with sweeping agents. Robotica 39(12), 2210–2245 (2021)
Francos, R.M., Bruckstein, A.M.: Spiral sweeping search for smart evaders. arXiv preprint (2023)
Garcia, E., Casbeer, D.W., Pachter, M.: Optimal strategies of the differential game in a circular region. IEEE Control Syst. Lett. 4(2), 492–497 (2019)
Hew, P.C.: Linear and concentric arc patrols against smart evaders. Mil. Oper. Res. 20(3), 39–48 (2015)
Koopman, B.O.: Search and screening: general principles with historical applications. Pergamon Press (1980)
Kumkov, S.S., Le Ménec, S., Patsko, V.S.: Zero-sum pursuit-evasion differential games with many objects: survey of publications. Dyn. Games Appl. 7(4), 609–633 (2017)
Makkapati, V.R., Tsiotras, P.: Optimal evading strategies and task allocation in multi-player pursuit-evasion problems. Dyn. Games Appl. 9(4), 1168–1187 (2019)
McGee, T.G., Hedrick, J.K.: Guaranteed strategies to search for mobile evaders in the plane. In: 2006 American Control Conference, p. 6. IEEE (2006)
Tang, Z., Ozguner, U.: On non-escape search for a moving target by multiple mobile sensor agents. In: 2006 American Control Conference, p. 6. IEEE (2006)
Tisue, S., Wilensky, U.: Netlogo: a simple environment for modeling complexity. In: International Conference on Complex Systems, vol. 21, pp. 16–21. Boston, MA (2004)
Vincent, P., Rubin, I.: A framework and analysis for cooperative search using UAV swarms. In: Proceedings of the 2004 ACM Symposium on Applied Computing, pp. 79–86. ACM (2004)
Weintraub, I.E., Pachter, M., Garcia, E.: An introduction to pursuit-evasion differential games. In: 2020 American Control Conference (ACC), pp. 1049–1066. IEEE (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Francos, R.M., Bruckstein, A.M. (2023). Spiral Sweeping Protocols for Detection of Smart Evaders. In: Iida, F., Maiolino, P., Abdulali, A., Wang, M. (eds) Towards Autonomous Robotic Systems. TAROS 2023. Lecture Notes in Computer Science(), vol 14136. Springer, Cham. https://doi.org/10.1007/978-3-031-43360-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-43360-3_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-43359-7
Online ISBN: 978-3-031-43360-3
eBook Packages: Computer ScienceComputer Science (R0)