Abstract
The line coverage problem is the task of servicing a given set of one-dimensional features in an environment. Its applications include the inspection of road networks, power lines, and oil and gas lines. The line coverage problem is a generalization of the standard arc routing problems, and is NP-hard in general. We address the single robot line coverage problem where the service and deadhead costs are distinct and asymmetric. We model the problem as an optimization problem that minimizes the total cost of travel on a given graph. We present approximation algorithms to obtain bounded solutions efficiently, using the minimum cost flow problem. We build the main algorithm in stages by considering three simpler subproblems. The subproblems are based on the structure of the required graph, i.e., the graph induced by the features that require servicing. We first present an optimal algorithm for the case of Eulerian graphs with only required edges. Next we consider general graphs, not necessarily Eulerian, with only required edges and present a 2-approximation algorithm. Finally, we consider the general case with both required and non-required edges. The approximation algorithm is dependent on the Asymmetric Traveling Salesperson Problem (ATSP), and is bounded by \(\alpha (C) + 2\), where \(\alpha (C)\) is the approximation factor of the ATSP algorithm with C connected components. Our upper bound is also an improvement over the existing results for the asymmetric rural postman problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agarwal, S., Akella, S.: Line coverage with multiple robots. In: IEEE International Conference on Robotics and Automation, Paris, France (2020)
van Bevern, R., Komusiewicz, C., Sorge, M.: A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: theory and experiments. Networks 70(3), 262–278 (2017)
Choset, H.: Coverage for robotics - a survey of recent results. Ann. Math. Artif. Intell. 31(1), 113–126 (2001)
Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA (1976)
Corberan, A., Laporte, G. (eds.): Arc Routing: Problems, Methods, and Applications. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2014)
Dille, M., Singh, S.: Efficient aerial coverage search in road networks. In: AIAA Guidance, Navigation, and Control Conference, Boston, MA, USA, pp. 5048–5067 (2013)
Easton, K., Burdick, J.: A coverage algorithm for multi-robot boundary inspection. In: IEEE International Conference on Robotics and Automation, Barcelona, Spain, pp. 727–734 (2005)
Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Math. Program. 5(1), 88–124 (1973)
Frederickson, G.N.: Approximation algorithms for some postman problems. J. ACM 26(3), 538–554 (1979)
Galceran, E., Carreras, M.: A survey on coverage path planning for robotics. Robot. Auton. Syst. 61(12), 1258–1276 (2013)
Macharet, D.G., Campos, M.F.M.: A survey on routing problems and robotic systems. Robotica 36(12), 1781–1803 (2018)
Oh, H., Kim, S., Tsourdos, A., White, B.: Coordinated road-network search route planning by a team of UAVs. Int. J. Syst. Sci. 45(5), 825–840 (2014)
Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41(2), 338–350 (1993)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall Inc., Upper Saddle River (1982)
Raghavachari, B., Veerasamy, J.: Approximation algorithms for the asymmetric postman problem. In: Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, USA, pp. 734–741 (1999)
Svensson, O., Tarnawski, J., Végh, L.A.: A constant-factor approximation algorithm for the asymmetric traveling salesman problem. In: 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pp. 204–213 (2018)
Traub, V., Vygen, J.: An improved approximation algorithm for ATSP. In: 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, pp. 1–13 (2020)
Win, Z.: On the windy postman problem on Eulerian graphs. Math. Program. 44(1), 97–112 (1989)
Xu, L., Stentz, A.: An efficient algorithm for environmental coverage with multiple robots. In: IEEE International Conference on Robotics and Automation, Shanghai, China, pp. 4950–4955 (2011)
Acknowledgments
This work was supported in part by NSF awards IIS-1547175, IIP-1439695 and IIP-1919233, a UNC IPG award, and DARPA HR00111820055.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Agarwal, S., Akella, S. (2021). Approximation Algorithms for the Single Robot Line Coverage Problem. In: LaValle, S.M., Lin, M., Ojala, T., Shell, D., Yu, J. (eds) Algorithmic Foundations of Robotics XIV. WAFR 2020. Springer Proceedings in Advanced Robotics, vol 17. Springer, Cham. https://doi.org/10.1007/978-3-030-66723-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-030-66723-8_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-66722-1
Online ISBN: 978-3-030-66723-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)