Abstract
In this paper we address the problem of area coverage using multiple cooperating robots. One of the main concerns of using multiple robots is of avoiding repetitive coverage apart from complete coverage of the given area. Partitioning the area to be covered into cells and allotting one each cell to each of the robots for coverage is a simple and elegant solution for this problem. However, the spacial partitioning may lead to additional problems leading to either incomplete coverage or coverage overlap near the partition boundary. We propose a manhattan distance based Voronoi partitioning scheme of \(2D\times 2D\) gridded region, where D is the size of the robot footprint. We show that the proposed partitioning scheme completely eliminates coverage gaps and coverage overlap using illustrative results.
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
Dasgupta P, Muoz-Melndez A, Guruprasad KR (2012) Multi-robot terrain coverage and task allocation for autonomous detection of landmines. Proc SPIE 8359
Choset H (2001) Coverage for robotics—a survey of recent results. Ann Math Artif Intell 31(1–4):113–126
Galceran E, Carreras Marc (2013) A survey on coverage path planning for robotics. Robot Auton Syst 61:1258–1276
Agmon N, Hazon N, Kaminka (2009) The giving tree: constructing trees for efficient offline and online multi-robot coverage. In: Annals of math and artificial intelligence
Michel D, McIsaac K (2012) New path planning scheme for complete coverage of mapped areas by single and multiple robots. In: IEEE international conference on mechatronics and automation, pp 1233–1240
Hazon N, Kaminka G (2011) On redundancy, efficiency, and robustness in coverage for multiple robots. Robot Auton Syst 56:1102–1114
Zheng X, Koenig S, Kempe D, Jain S (2010) Multirobot forest coverage for weighted and unweighted terrain. IEEE Trans Robot 26:1018–1010
Guruprasad KR, Wilson Z, Dasgupta P (2012) Complete coverage of an initially unknown environment by multiple robots using voronoi partition. In: Proceedings of 2nd international conference on advances in control and optimization of dynamical systems
Wilson Z, Whipple T, Dasgupta P (2011) Multi-robot coverage with dynamic coverage information compression. In: 8th international conference on informatics in control, automation and robotics, pp 236–241
Jager M, Nebel B (2002) Dynamic decentralized area partitioning for cooperating cleaning robots. In: Proceedings 2002 IEEE international conference on robotics and automation, pp 3577–3582
Min T, Yin H (1998) A decentralized approach for cooperative sweeping by multiple mobile robots. In: Proceedings of international conference on intelligent robots and systems
Hert S, Lumelsky V (1998) Polygon area decomposition for multiple robot workspace division. Int J Comput Geom Appl 8:437–466
Gabriely Y, Rimon E (2001) Spanning tree based coverage of continuous areas by a mobile robot. Ann Math Artif Intell 31:77–98
Ranjitha TD, Guruprasad KR (2015) CCSTC: a truly complete competitive spanning tree coverage algorithm for mobile robots. In: Proceedings of advances in robotics, 2nd international conference of robotics society of India. BITS Goa, India, July 2015
Ranjitha TD, Guruprasad KR (2016) Truly complete competitive robot coverage path planning using approximate cellular decomposition. In: Proceedings of 4th IFAC conference on advances in control and optimization of dynamical systems ACODS, IFAC-PapersOnLine, vol 49, issue 1, Tiruchirappalli, India, pp 195–200
Choset H (2000) Coverage of known spaces: the boustrophedon cellular decomposition. Auton Syst 9:247–253
Okabe A, Boots B, Sugihara K, Chiu S (2000) Spatial tessellations. Concepts and applications of Voronoi diagrams. Wiley
Guruprasad KR, Dasgupta P (2012) Distributed spatial partitioning of an initially unknown region for a multi-robot coverage application. In: Autonomous robots and multrobot systems (ARMS) workshop (co-located with AAMAS 2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Nair, V.G., Guruprasad, K.R. (2020). Manhattan Distance Based Voronoi Partitioning for Efficient Multi-robot Coverage. In: Shreesha, C., Gudi, R. (eds) Control Instrumentation Systems. Lecture Notes in Electrical Engineering, vol 581. Springer, Singapore. https://doi.org/10.1007/978-981-13-9419-5_7
Download citation
DOI: https://doi.org/10.1007/978-981-13-9419-5_7
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-9418-8
Online ISBN: 978-981-13-9419-5
eBook Packages: EngineeringEngineering (R0)