Abstract
We consider the problem of coverage path planning in an initially unknown or partially known planar environment using multiple robots. Previously, Voronoi partitioning has been proposed as a suitable technique for coverage path planning where the free space in the environment is partitioned into non-overlapping regions called Voronoi cells based on the initial positions of the robots, and one robot is allocated to perform coverage in each region. However, a crucial problem arises if such a partitioning scheme is used in an environment where the location of obstacles is not known a priori—while performing coverage, a robot might perceive an obstacle that occludes its access to portions of its Voronoi cell and this obstacle might prevent the robot from completely covering its allocated region. This would either result in portions of the environment remaining uncovered or requires additional path planning by robots to cover the disconnected regions. To address this problem, we propose a novel algorithm that allows robots to coordinate the coverage of inaccessible portions of their Voronoi cell with robots in neighboring Voronoi cells so that they can repartition the initial Voronoi cells and cover a set of contiguous, connected regions. We have proved analytically that our proposed algorithm guarantees complete, non-overlapping coverage. We have also quantified the performance of our algorithm on e-puck robots within the Webots simulator in different environments with different obstacle geometries and shown that it successfully performs complete, non-overlapping coverage.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
As U and W belong to free space, \(U\cap W\) is either \(\emptyset \) or a permeable line segment.
- 3.
Remark 1 is also applicable here.
- 4.
A similar result can be proved for \(A_{ij}^b \subset A_{ji}^b\) by interchanging indices i and j.
References
Choset, H.: Coverage of known spaces: the boustrophedon cellular decomposition. Auton. Robots 9, 247–253 (2000)
Hert, S., Lumelsky, V.: Polygon area decomposition for multiplerobot workspace division. Int. J. Comput. Geom. Appl. 8, 437–466 (1998)
Rekleitis, I., New, A.P., Rankin, E.S., Choset, H.: Efficient boustrophedon multi-robot coverage: an algorithmic approach. Ann. Math Artif. Intell. 52, 109–142 (2008)
Cortes, J., Martinez, S., Karata, T., Bullo, F.: Coverage control for mobile sensing networks. IEEE Trans. Rob. Auton. 20(2), 243–255 (2004)
Bash, B.A., Desnoyers, P.J.: Exact distributed voronoi cell computation in sensornetworks. In: Proceedings of the Sixth IEEE/ACM Conference On Information Processing in Sensor Networks, pp. 236–243 (2007)
Choset, H.: Coverage for robotics—a survey of recent results. Ann. Math. Artif. Intell. 31, 113–126 (2001)
Altshuler, Y., Yanovski, V., Wagner, I.A., Bruckstein, A.M.: Multi-agent cooperative cleaning of expanding domains. I. J. Robot. Res. 30(8), 1037–1071 (2011)
Agmon, N., Hazon, N., Kaminka, G.: The giving tree: constructing trees for efficient offline and online multi-robot coverage. Ann. Math Artif. Intell. 52(2–4), 143–168 (2009)
Jäger, M., Nebel, B.: Dynamic decentralized area partitioning for cooperating cleaning robots. In: Proceedings of IEEE International Conference on Robotics and Automation, pp. 3577–3582 (2002)
Schwager, M., Rus, D., Slotine, J.-J.E.: Decentralized, adaptive coverage control for networked robots. I. J. Robot. Res. 28(3), 357–375 (2009)
Breitenmoser, A., Schwager, M., Metzger, J.-C., Siegwart, R., Rus, D.: Voronoi coverage of non-convex environments with a group of networked robots. In: ICRA, pp. 4982–4989 (2010)
Durham, J.W., Carli, R., Frasca, P., Bullo, F.: Discrete partitioning and coverage control for gossiping robots. IEEE Trans. Robot. 28(2), 364–378 (2012)
Guruprasad, K.R., Dasgupta, P.: Egress: an online path planning algorithm for boundary exploration. In: IEEE International Conference on Robotics and Automation, May 2012, pp. 3991–3996
Gabriely, Y., Rimon, E.: Spanning-tree based coverage of continuous areas by a mobile robot. Ann. Math Artif. Intell. 31, 77–98 (2001)
Batalin, M., Sukhatme, G.S.: Spreading out: a local approach to multi-robot coverage. In: Proceedings of the International Symposium on Distributed Autonomous Robotic Systems, Fukuoka, Japan, Jun 2002, pp. 373–382. [Online]. http://robotics.usc.edu/publications/56/
Acknowledgments
This work was partially supported by the U.S. Office of Naval Research as part of the COMRADES project.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Japan
About this paper
Cite this paper
Hungerford, K., Dasgupta, P., Guruprasad, K.R. (2016). A Repartitioning Algorithm to Guarantee Complete, Non-overlapping Planar Coverage with Multiple Robots. In: Chong, NY., Cho, YJ. (eds) Distributed Autonomous Robotic Systems. Springer Tracts in Advanced Robotics, vol 112 . Springer, Tokyo. https://doi.org/10.1007/978-4-431-55879-8_3
Download citation
DOI: https://doi.org/10.1007/978-4-431-55879-8_3
Published:
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-55877-4
Online ISBN: 978-4-431-55879-8
eBook Packages: EngineeringEngineering (R0)