Advertisement

Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation

  • Sándor P. Fekete
  • Dominik KrupkeEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11485)

Abstract

We investigate a variety of geometric problems of finding tours and cycle covers with minimum turn cost, which have been studied in the past, with complexity and approximation results, and open problems dating back to work by Arkin et al. in 2001. Many new practical applications have spawned variants: For full coverage, every point has to be covered, for subset coverage, specific points have to be covered, and for penalty coverage, points may be left uncovered by incurring a penalty. We make a number of contributions. We first show that finding a minimum-turn (full) cycle cover is NP-hard even in 2-dimensional grid graphs, solving the long-standing open Problem 53 in The Open Problems Project edited by Demaine, Mitchell and O’Rourke. We also prove NP-hardness of finding a subset cycle cover of minimum turn cost in thin grid graphs, for which Arkin et al. gave a polynomial-time algorithm for full coverage; this shows that their boundary techniques cannot be applied to compute exact solutions for subset and penalty variants.

On the positive side, we establish the first constant-factor approximation algorithms for all considered subset and penalty problem variants for very general classes of instances, making use of LP/IP techniques. For these problems with many possible edge directions (and thus, turn angles, such as in hexagonal grids or higher-dimensional variants), our approximation factors also improve the combinatorial ones of Arkin et al. Our approach can also be extended to other geometric variants, such as scenarios with obstacles and linear combinations of turn and distance costs.

References

  1. 1.
    Agarwal, P.K., Biedl, T.C., Lazard, S., Robbins, S., Suri, S., Whitesides, S.: Curvature-constrained shortest paths in a convex polygon. SIAM J. Comp. 31(6), 1814–1851 (2002)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Agarwal, P.K., Wang, H.: Approximation algorithms for curvature-constrained shortest paths. SIAM J. Comp. 30(6), 1739–1772 (2000)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Aggarwal, A., Coppersmith, D., Khanna, S., Motwani, R., Schieber, B.: The angular-metric traveling salesman problem. SIAM J. Comp. 29(3), 697–711 (1999)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Aichholzer, O., Fischer, A., Fischer, F., Meier, J.F., Pferschy, U., Pilz, A., Staněk, R.: Minimization and maximization versions of the quadratic travelling salesman problem. Optimization 66(4), 521–546 (2017)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Arkin, E.M., Bender, M.A., Demaine, E.D., Fekete, S.P., Mitchell, J.S.B., Sethia, S.: Optimal covering tours with turn costs. In: Proceedings of 12th ACM-SIAM Symposium Discrete Algorithms (SODA), pp. 138–147 (2001)Google Scholar
  6. 6.
    Arkin, E.M., Bender, M.A., Demaine, E.D., Fekete, S.P., Mitchell, J.S.B., Sethia, S.: Optimal covering tours with turn costs. SIAM J. Comp. 35(3), 531–566 (2005)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Arkin, E.M., Fekete, S.P., Mitchell, J.S.B.: Approximation algorithms for lawn mowing and milling. Comp. Geom. 17(1–2), 25–50 (2000)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Astroza, S., Patil, P.N., Smith, K.I., Bhat, C.R.: Transportation planning to accommodate needs of wind energy projects. In: Transportation Research Board-Annual Meeting (2017). Article 17–05309Google Scholar
  9. 9.
    Ausiello, G., Bonifaci, V., Leonardi, S., Marchetti-Spaccamela, A.: Prize-collecting traveling salesman and related problems. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall/CRC, Boca Raton (2007)Google Scholar
  10. 10.
    Becker, A.T., Debboun, M., Fekete, S.P., Krupke, D., Nguyen, A.: Zapping Zika with a mosquito-managing drone: Computing optimal flight patterns with minimum turn cost. In: Proceedings of 33rd Symposium on Computational Geometry (SoCG), pp. 62:1–62:5 (2017). Video at https://www.youtube.com/watch?v=SFyOMDgdNao
  11. 11.
    Benbernou, N.M.: Geometric algorithms for reconfigurable structures. Ph.D. thesis, Massachusetts Institute of Technology (2011)Google Scholar
  12. 12.
    Boissonnat, J., Lazard, S.: A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles. In: Proceedings of 12th Symposium on Computational Geometry (SoCG), pp. 242–251 (1996)Google Scholar
  13. 13.
    Cook, W., Cunningham, W., Pulleyblank, W., Schrijver, A.: Combinatorial Optimization. Wiley-Interscience, Hoboken (1997)CrossRefGoogle Scholar
  14. 14.
    de Assis, I.R., de Souza, C.C.: Experimental evaluation of algorithms for the orthogonal milling problem with turn costs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 304–314. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-20662-7_26CrossRefGoogle Scholar
  15. 15.
    Demaine, E.D., Mitchell, J. S. B., O’Rourke, J.: The Open Problems Project. http://cs.smith.edu/~orourke/TOPP/
  16. 16.
    Dubins, L.E.: On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. Am. J. Math. 79(3), 497–516 (1957)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Fekete, S.P., Krupke, D.: Covering tours and cycle covers with turn costs: hardness and approximation. arXiv (2018). http://arxiv.org/abs/1808.04417
  18. 18.
    Fekete, S.P., Krupke, D.: Practical methods for computing large covering tours and cycle covers with turn cost. In: Proceedings of 21st SIAM Workshop on Algorithm Engineering and Experiments (ALENEX) (2019)Google Scholar
  19. 19.
    Fekete, S.P., Woeginger, G.J.: Angle-restricted tours in the plane. Comp. Geom. 8, 195–218 (1997)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Fellows, M., Giannopoulos, P., Knauer, C., Paul, C., Rosamond, F.A., Whitesides, S., Yu, N.: Milling a graph with turn costs: a parameterized complexity perspective. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 123–134. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-16926-7_13CrossRefzbMATHGoogle Scholar
  21. 21.
    Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comp. 24(2), 296–317 (1995)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Lazard, S., Reif, J., Wang, H.: The complexity of the two dimensional curvature-constrained shortest-path problem. In: Proceedings of 3rd Workshop on the Algorithmic Foundations of Robotics (WAFR), pp. 49–57 (1998)Google Scholar
  23. 23.
    Maurer, O.: Winkelminimierung bei Überdeckungsproblemen in Graphen. Diplomarbeit, Technische Universität Berlin (2009)Google Scholar
  24. 24.
    Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of 10th ACM symposium on Theory of computing (STOC), pp. 216–226 (1978)Google Scholar
  25. 25.
    Stein, C., Wagner, D.P.: Approximation algorithms for the minimum bends traveling salesman problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 406–421. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-45535-3_32CrossRefGoogle Scholar
  26. 26.
    Takei, R., Tsai, R., Shen, H., Landa, Y.: A practical path-planning algorithm for a simple car: a Hamilton-Jacobi approach. In: Proceedings of 29th American Control Conference (ACC), pp. 6175–6180 (2010)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer ScienceTU BraunschweigBraunschweigGermany

Personalised recommendations