Abstract
In this work we analyze the behavior of a swarm of autonomous robotic agents, or drones, designed for cooperatively exploring an unknown area (for purposes of cleaning, painting, etc.). We assume that each robot can acquire only the information which is available in its immediate vicinity, and the only way of inter-robot communication is by leaving traces on the common ground and sensing the traces left by other robots. We present a protocol for cleaning a dirty area that guarantees task completion (unless all robots die) and prove an upper bound on the time complexity of this protocol. We also show simulation results of the protocol on several types of regions. These simulations indicate that the precise cleaning time depends on the number of robots, their initial locations, and the shape of the dirty region.
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 subscriptionsNotes
- 1.
It should be stated that although the memory size of the agents is completely independent w.r.t to size of the problem, it is still \(O(\log k)\) bits w.r.t to the number of agents (used for counting purposes).
- 2.
This is a simple consequence of the “rotation index” Theorem (see e.g. [20] p. 396): If \(\alpha : [0,1] \rightarrow R^{2}\) is a plane, regular, simple, closed curve, then \(\int _{0}^{1}k(s)ds = 2 \pi \), where k(s) is the curvature of \(\alpha (s)\) and the curve is traversed in the positive direction.
- 3.
The existence of a non-critical point is guaranteed since \(\partial F_{t}\) is a connected graph and thus has a spanning tree, in which at least two tiles has a degree of 1, which makes them non-critical tiles.
References
E.U. Acar, Y. Zhang, H. Choset, M. Schervish, A.G. Costa, R. Melamud, D.C. Lean, A. Gravelin, Path planning for robotic demining and development of a test platform, in International Conference on Field and Service Robotics (2001) pp. 161–168
M. Ahmadi, P. Stone, A multi-robot system for continuous area sweeping tasks, in IEEE International Conference on Robotics and Automation, 2006 (ICRA 2006) (2006)
Y. Altshuler, Multi Agents Robotics in Dynamic Environments. Ph.D. thesis, Israeli Institute of Technology, May 2010
Y. Altshuler, A.M. Bruckstein, The complexity of grid coverage by swarm robotics, in ANTS 2010 (LNCS, 2010), pp. 536–543
Y. Altshuler, A.M. Bruckstein, Static and expanding grid coverage with ant robots: complexity results. Theoret. Comput. Sci. 412(35), 4661–4674 (2011)
Y. Altshuler, A.M. Bruckstein, I.A. Wagner, Swarm robotics for a dynamic cleaning problem, in IEEE Swarm Intelligence Symposium (2005), pp. 209–216
Y. Altshuler, V. Yanovski, I.A. Wagner, A.M. Bruckstein, The cooperative hunters - efficient cooperative search for smart targets using uav swarms, in Second International Conference on Informatics in Control, Automation and Robotics (ICINCO), the First International Workshop on Multi-Agent Robotic Systems (MARS) (2005), pp. 165–170
Y. Altshuler, I.A. Wagner, A.M. Bruckstein, Shape factor‘s effect on a dynamic cleaners swarm, in Third International Conference on Informatics in Control, Automation and Robotics (ICINCO), the Second International Workshop on Multi-Agent Robotic Systems (MARS) (2006), pp. 13–21
Y. Altshuler, V. Yanovsky, I. Wagner, A. Bruckstein, Swarm intelligencesearchers, cleaners and hunters. Swarm Intelligent Systems (2006), pp. 93–132
Y. Altshuler, V. Yanovsky, A.M. Bruckstein, I.A. Wagner, Efficient cooperative search of smart targets using uav swarms. ROBOTICA 26, 551–557 (2008)
Y. Altshuler, I.A. Wagner, A.M. Bruckstein, On swarm optimality in dynamic and symmetric environments. Economics 7, 11 (2008)
Y. Altshuler, I.A. Wagner, A.M. Bruckstein, Collaborative exploration in grid domains, in Sixth International Conference on Informatics in Control, Automation and Robotics (ICINCO) (2009)
Y. Altshuler, I.A. Wagner, V. Yanovski, A.M. Bruckstein, Multi-agent cooperative cleaning of expanding domains. Int. J. Robot. Res. 30, 1037–1071 (2010)
Y. Altshuler, A. Pentland, S. Bekhor, Y. Shiftan, A. Bruckstein, Optimal dynamic coverage infrastructure for large-scale fleets of reconnaissance uavs (2016), arXiv:1611.05735
R. Baeza-Yates, R. Schott, Parallel searching in the plane. Comput. Geom. 5, 143–154 (1995)
M.A. Batalin, G.S. Sukhatme, Spreading out: a local approach to multi-robot coverage, in 6th International Symposium on Distributed Autonomous Robotics Systems (2002)
V. Braitenberg, Vehicles (MIT Press, Cambridge, 1984)
Z. Butler, A. Rizzi, R. Hollis, Distributed coverage of rectilinear environments, in Proceedings of the Workshop on the Algorithmic Foundations of Robotics (2001)
D.C. Conner, A. Greenfield, P.N. Atkar, A.A. Rizzi, H. Choset, Paint deposition modeling for trajectory planning on automotive surfaces. IEEE Trans. Autom. Sci. Eng. 2(4), 381–392 (2005)
M.P. Do-Carmo, Differential Geometry of Curves and Surfaces (Prentice-Hall, New-Jersey, 1976)
Y. Gabriely, E. Rimon, Competitive on-line coverage of grid environments by a mobile robot. Comput. Geom. 24, 197–224 (2003)
S. Hedberg, Robots cleaning up hazardous waste, in AI Expert (1995), pp. 20–24
M. Held, On the computational geometry of pocket machining. Lecture Notes in Computer Science (1991)
D. Henrich, Space efficient region filling in raster graphics. Vis. Comput. 10, 205–215 (1994)
A. Itai, C.H. Papadimitriou, J.L. Szwarefiter, Hamilton paths in grid graphs. SIAM J. Comput. 11, 676–686 (1982)
S. Koenig, Y. Liu, Terrain coverage with ant robots: a simulation study, in AGENTS’01 (2001)
S. Koenig, B. Szymanski, Y. Liu, Efficient and inefficient ant coverage methods. Ann. Math. Artif. Intell. 31, 41–76 (2001)
D. Latimer, S. Srinivasa, V. Lee-Shue, S. Sonne, H. Choset, A. Hurst, Toward sensor based coverage with robot teams, in Proceedings of the 2002 IEEE International Conference on Robotics and Automation (2002)
T.W. Min, H.K. Yin, A decentralized approach for cooperative sweeping by multiple mobile robots, in IEEE/RSJ International Conference on Intelligent Robots and Systems (1998), pp. 380–385
W. Neubauer, Locomotion with articulated legs in pipes or ducts. Robot. Auton. Syst. 11, 163–169 (1993)
M. Polycarpou, Y. Yang, K. Passino, A cooperative search framework for distributed agents, in IEEE International Symposium on Intelligent Control (2001), pp. 1–6
E. Regev, Y. Altshuler, A.M. Bruckstein, The cooperative cleaners problem in stochastic dynamic environments (2012), arXiv:1201.6322
I. Rekleitis, V. Lee-Shuey, A. Peng Newz, H. Choset, Limited communication, multi-robot team based coverage, in IEEE International Conference on Robotics and Automation (2004)
Y. Shoham, M. Tennenholtz, On social laws for artificial agent societies: off line design. AI J. 73(1–2), 231–252 (1995)
J. Svennebring, S. Koenig, Building terrain-covering ant robots: a feasibility study. Auton. Robots 16(3), 313–332 (2004)
I.A. Wagner, Y. Altshuler, V. Yanovski, A.M. Bruckstein, Cooperative cleaners: a study in ant robotics. Int. J. Robot. Res. (IJRR) 27(1), 127–151 (2008)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Altshuler, Y., Pentland, A., Bruckstein, A.M. (2018). Cooperative “Swarm Cleaning” of Stationary Domains. In: Swarms and Network Intelligence in Search. Studies in Computational Intelligence, vol 729. Springer, Cham. https://doi.org/10.1007/978-3-319-63604-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-63604-7_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63602-3
Online ISBN: 978-3-319-63604-7
eBook Packages: EngineeringEngineering (R0)