Abstract
In this paper, we present a novel solution to mobile robot coverage of unstructured environments. We apply boustrophedon-based planning and use a heuristic to make the minimum sum of altitudes (MSA) decomposition, which computes an optimal exact cellular decomposition, applicable to more complex environments. Contrary to previous approaches, our technique explicitly takes into account different entry and exit points for the obtained cells and hence allows for minimizing inter-region distances in the corresponding traveling salesman problem (TSP) formulation. This is a highly important factor for unstructured environments, which heavily influences the quality of the final plan. Furthermore, we show how our method is applicable to coverage with finite resources. We implemented our planner in ROS and performed extensive experiments in a V-REP simulation environment in various scenarios. Comparisons with a state-of-the-art boustrophedon-based method show that our approach has a significantly lower total coverage time. Additionally, we demonstrate that our system is capable of performing online recharging and replanning in dynamic, crowded environments while obtaining a high coverage percentage. The results of this work are relevant for a variety of real-world applications such as autonomous floor cleaning.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In geometry, a polygon P in the plane is called monotone with respect to a straight line L, if every line orthogonal to L intersects P at most twice.
References
On the distance constrained vehicle routing problem. Oper. Res. 40(4) (1992)
Aaron, E., Krizanc, D., Meyerson, E.: Multi-Robot Foremost Coverage of Time-Varying Graphs. Springer, Heidelberg (2015)
Bretl, T., Hutchinson, S.: Robust coverage by a mobile robot of a planar workspace. In: Proceedings of IEEE International Conference on Robotics and Automation (2013)
Choi, M.H.: Optimal underwater coverage of a cellular region by autonomous underwater vehicle using line sweep motion. J. Electr. Eng. Technol. 7(6), 1023–1033 (2012)
Choset, H.: Coverage for robotics - a survey of recent results. Ann. Math. Artif. Intell. 31(1), 113–126 (2001)
Choset, H., Pignon, P.: Coverage path planning: the boustrophedon decomposition. In: International Conference on Field and Service Robotics (1997)
Dezs, B., Jüttner, A., Kovács, P.: LEMON - an open source C++ graph template library. Electron. Notes Theor. Comput. Sci. 264(5), 23–45 (2011)
Rohmer, E., Singh, S.P.N., Freese, M.: V-REP: a versatile and scalable robot simulation framework. In: Proceedings of The International Conference on Intelligent Robots and Systems (IROS) (2013)
Easton, K., Burdick, J.: A coverage algorithm for multi-robot boundary inspection. In: Proceedings of the IEEE International Conference on Robotics and Automation (2005)
Englert, M., Röglin, H., Vöcking, B.: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. Algorithmica 68(1), 190–264 (2014)
Galceran, E., Carreras, M.: A survey on coverage path planning for robotics. Robot. Auton. Syst. 61(12), 1258–1276 (2013). https://doi.org/10.1016/j.robot.2013.09.004
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)
Hofner, C., Schmidt, G.: Path planning and guidance techniques for an autonomous mobile cleaning robot. In: Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (1994)
Huang, W.H.: Optimal line-sweep-based decompositions for coverage algorithms. In: Proceedings of IEEE International Conference on Robotics and Automation (2001)
Jensen, M.A.F.: Algorithms for operational planning of agricultural field operations. Technical Reports Mechanical Engineering, vol. 2, no. 3, p. 19 (2015)
Jimenez, P.A., Shirinzadeh, B., Nicholson, A., Alici, G.: Optimal area covering using genetic algorithms. In: Proceedings of IEEE/ASME International Conference on Advanced Intelligent Mechatronics (2007)
Jin, J., Tang, L.: Optimal coverage path planning for arable farming on 2D surfaces. Trans. Am. Soc. Agr. Biol. Eng. 53(1), 283 (2010)
Mei, Y., Lu, Y.H., Hu, Y.C., Lee, C.S.G.: Deployment of mobile robots with energy and timing constraints. IEEE Trans. Robot. 22(3), 507–522 (2006)
Papadimitriou, C.H.: The Euclidean traveling salesman problem is NP-complete. Theor. Comput. Sci. 4(3), 237–244 (1977)
Pratama, P.S., Kim, J.W., Kim, H.K., Yoon, S.M., Yeu, T.K., Hong, S., Oh, S.H., KIm, S.B.: Path planning algorithm to minimize an overlapped path and turning number for an underwater mining robot. In: International Conference on Control, Automation and Systems (2015)
Quigley, M., Conley, K., Gerkey, B.P., Faust, J., Foote, T., Leibs, J., Wheeler, R., Ng, A.Y.: ROS: an open-source robot operating system. In: ICRA Workshop on Open Source Software (2009)
Shnaps, I., Rimon, E.: Online coverage of planar environments by a battery powered autonomous mobile robot. IEEE Trans. Autom. Sci. Eng. 13, 32–42 (2016)
Strimel, G.P., Veloso, M.M.: Coverage planning with finite resources. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (2014)
Xu, A., Viriyasuthee, C., Rekleitis, I.: Efficient complete coverage of a known arbitrary environment with applications to aerial operations. Autonom. Robots 36, 365–381 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Khsheibun, E., Kohler, N., Bennewitz, M. (2019). Efficient Coverage of Unstructured Environments. In: Strand, M., Dillmann, R., Menegatti, E., Ghidoni, S. (eds) Intelligent Autonomous Systems 15. IAS 2018. Advances in Intelligent Systems and Computing, vol 867. Springer, Cham. https://doi.org/10.1007/978-3-030-01370-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-01370-7_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01369-1
Online ISBN: 978-3-030-01370-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)