Abstract
We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in the SBP is to compute a short tour for the snowblower to follow to remove all the snow from a domain (driveway, sidewalk, etc.). When a snowblower passes over each region along the tour, it displaces snow into a nearby region. The constraint is that if the snow is piled too high, then the snowblower cannot clear the pile.
We give an algorithmic study of the SBP. We show that in general, the problem is NP-complete, and we present polynomial-time approximation algorithms for removing snow under various assumptions about the operation of the snowblower. Most commercially available snowblowers allow the user to control the direction in which the snow is thrown. We differentiate between the cases in which the snow can be thrown in any direction, in any direction except backwards, and only to the right. For all cases, we give constant-factor approximation algorithms; the constants increase as the throw direction becomes more restricted.
Our results are also applicable to robotic vacuuming (or lawnmowing) with bounded capacity dust bin and to some versions of material-handling problems, in which the goal is to rearrange cartons on the floor of a warehouse.
Full version is available from http://arxiv.org/abs/cs/0603026.
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
Preview
Unable to display preview. Download preview PDF.
References
Arkin, E., Bender, M., Demaine, E., Fekete, S., Mitchell, J., Sethia, S.: Optimal covering tours with turn costs. SIAM J. on Computing 35(3), 531–566 (2005)
Arkin, E.M., Fekete, S.P., Mitchell, J.S.B.: Approximation algorithms for lawn mowing and milling. Comput. Geom. Theory Appl. 17, 25–50 (2000)
Arkin, E.M., Held, M., Smith, C.L.: Optimization problems related to zigzag pocket machining. Algorithmica 26(2), 197–236 (2000)
Chin, F., Snoeyink, J., Wang, C.A.: Finding the medial axis of a simple polygon in linear time. Discrete Comput. Geom. 21(3), 405–420 (1999)
Cohen, S., Guibas, L.: The earth mover’s distance: Lower bounds and invariance under translation. Technical Report CS-TR-97-1597, Stanford Univ. Dept Of Computer Science (1997)
Culberson, J.: Sokoban is PSPACE-complete. In: Proc. Int. Conf. Fun with Algorithms, Elba, Italy, pp. 65–76 (June 1998)
Demaine, E.D., Demaine, M.L., Hoffmann, M., O’Rourke, J.: Pushing blocks is hard. Comput. Geom. Theory Appl. 26(1), 21–36 (2003); Special issue of selected papers from the 13th Canadian Conference on Computational Geometry (2001)
Eliazar, I.: The snowblower problem. Queueing Systems Theory and Applications 45(4), 357–380 (2003)
Held, M.: On the Computational Geometry of Pocket Machining. LNCS, vol. 500. Springer, Heidelberg (1991)
Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11, 676–686 (1982)
Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the traveling salesman problem. J. Algorithms 5, 231–246 (1984)
Polishchuk, V.: The box mover problem. In: Proceedings of 16th Canadian Conference on Computational Geometry, pp. 36–39 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Arkin, E.M., Bender, M.A., Mitchell, J.S.B., Polishchuk, V. (2008). The Snowblower Problem. In: Akella, S., Amato, N.M., Huang, W.H., Mishra, B. (eds) Algorithmic Foundation of Robotics VII. Springer Tracts in Advanced Robotics, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68405-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-68405-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68404-6
Online ISBN: 978-3-540-68405-3
eBook Packages: EngineeringEngineering (R0)