Abstract
This paper is a contribution to studying the parallel operation of moving agents on a grid where some targets have to be reached and attended, as a strong generalization and improvement of a previous results. In particular the well-known problems of cops and robber and sparce sensor networks are considered as applicative examples of this new computing scheme. We assume that the set of targets may change in time with new targets arising while previous ones are being taken care of. An evolving scheme is considered where all targets needing attention are finally served, or their number may never end but is constantly kept under a fixed limit. Mathematical expressions for the number of agents and their processing time are given as a function of various parameters of the problems, and their relation is studied under the concepts of work and speed-up inherited from parallel processing.
Partially supported by MIUR of Italy under Grant 20174LF3T8 AHeAD: efficient Algorithms for Harnessing networked Data.
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
References
Bonato, A., Nowakovski, R.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence, RI (2011)
Bonato, A., Pérez-Giménez, X., Prałat, P., Reiniger, B.: The game of overprescribed cops and robbers played on graphs. Graphs Combinatorics 33(4), 801–815 (2017). https://doi.org/10.1007/s00373-017-1815-2
Breen, J., Brimkov, B., Carlson, J., Hogben, L., Perry, K.E., Reinhart, C.: Throttling for the game of cops and robbers on graphs. Discret. Math. 341, 2418–2430 (2018)
Hahn, G., MacGillivray, G.: A note on \(k\)-cop, \(l\)-robber games on graphs. Discret. Math. 306, 2492–2497 (2006)
Karp, R.M., Ramachandran, V.: A survey of parallel algorithms for shared memory machines. In: van Leeuven, J. (ed.) Handbook of Theoretical Computer Science. Elsevier, Amsterdam, pp. 869–941 (1990)
Luccio, F., Pagli, L.: Cops and robber on grids and tori: basic algorithms and their extension to a large number of cops. J. Supercomput. (2021). https://doi.org/10.1007/s11227-021-03655-1
Luccio, F., Pagli, L., Pucci, G.: Three non conventional paradigms of parallel computation. In: Meyer, F., Monien, B., Rosenberg, A.L. (eds.) Nixdorf 1992. LNCS, vol. 678, pp. 166–175. Springer, Heidelberg (1993). https://doi.org/10.1007/3-540-56731-3_16
Luccio, F., Pagli, L.: More agents may decrease global work: a case in butterfly decontamination. Theoret. Comput. Sci. 655, 41–57 (2016)
Mukherjee, A., et al.: A survey of unmanned aerial sensing solutions in precision agriculture. J. Netw. Comput. Appl. 148, 102461 (2019)
Shah, R.C., et al.: Data MULESs: modeling and analysis of a three-tier architecture for sparse sensor networks. Elsevier Ad Hoc Netw. 1, 215–233 (2003)
Tekdas, O., et al.: Using mobile robots to harvest data from sensor fields. IEEE Wirel. Commun. 16–1, 22–28 (2009)
Trotta, A., et al.: BEE-DRONES : ultra low-power monitoring systems based on unmanned aerial vehicles and wake-up radio ground sensors. Comput. Netw. 180, 107425 (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Luccio, F., Pagli, L. (2021). Mobile Agents Operating on a Grid: Some Non-conventional Issues in Parallel Computing. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2021. Lecture Notes in Computer Science(), vol 12942. Springer, Cham. https://doi.org/10.1007/978-3-030-86359-3_30
Download citation
DOI: https://doi.org/10.1007/978-3-030-86359-3_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-86358-6
Online ISBN: 978-3-030-86359-3
eBook Packages: Computer ScienceComputer Science (R0)