Abstract
We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these problems involve planning the coordinated motion of a collection of agents (representing robots, people, map labels, network messages, etc.) to achieve a global property in the network while minimizing the maximum or average movement (expended energy). The only previous theoretical results about this class of problems are about approximation, and mainly negative: many movement problems of interest have polynomial inapproximability. Given that the number of mobile agents is typically much smaller than the complexity of the environment, we turn to fixed-parameter tractability. We characterize the boundary between tractable and intractable movement problems in a very general set up: it turns out the complexity of the problem fundamentally depends on the treewidth of the minimal configurations. Thus the complexity of a particular problem can be determined by answering a purely combinatorial question. Using our general tools, we determine the complexity of several concrete problems and fortunately show that many movement problems of interest can be solved efficiently.
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
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: STOC 2007, pp. 67–74 (2007)
Bredin, J.L., Demaine, E.D., Hajiaghayi, M., Rus, D.: Deploying sensor networks with guaranteed capacity and fault tolerance. In: MOBIHOC 2005, pp. 309–319 (2005)
Canny, J.F.: The Complexity of Robot Motion Planning. MIT Press, Cambridge (1987)
Corke, P., Hrabar, S., Peterson, R., Rus, D., Saripalli, S., Sukhatme, G.: Autonomous deployment of a sensor network using an unmanned aerial vehicle. In: ICRA 2004, New Orleans, USA (2004)
Corke, P., Hrabar, S., Peterson, R., Rus, D., Saripalli, S., Sukhatme, G.: Deployment and connectivity repair of a sensor net with a flying robot. In: ISER 2004, Singapore (2004)
Demaine, E.D., Hajiaghayi, M., Kawarabayashi, K.: Algorithmic graph minor theory: Decomposition, approximation, and coloring. In: FOCS 2005, pp. 637–646 (2005)
Demaine, E.D., Hajiaghayi, M., Mahini, H., Sayedi-Roshkhar, A.S., Oveisgharan, S., Zadimoghaddam, M.: Minimizing movement. ACM Trans. Algorithms
Friggstad, Z., Salavatipour, M.R.: Minimizing movement in mobile facility location problems. In: FOCS 2008, pp. 357–366 (2008)
Hsiang, T.-R., Arkin, E.M., Bender, M.A., Fekete, S.P., Mitchell, J.S.B.: Algorithms for rapidly dispersing robot swarms in unknown environments. In: WAFR 2003, pp. 77–94 (2003)
Hüffner, F., Niedermeier, R., Wernicke, S.: Techniques for practical fixed-parameter algorithms. Comput. J. 51(1), 7–25 (2008)
Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theoret. Comput. Sci. 289(2), 997–1008 (2002)
LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)
Reif, J.H., Wang, H.: Social potential fields: a distributed behavioral control for autonomous robots. In: WAFR 2005, pp. 331–345 (2005)
Schultz, A.C., Parker, L.E., Schneider, F.E. (eds.): Multi-Robot Systems: From Swarms to Intelligent Automata. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demaine, E.D., Hajiaghayi, M., Marx, D. (2009). Minimizing Movement: Fixed-Parameter Tractability. In: Fiat, A., Sanders, P. (eds) Algorithms - ESA 2009. ESA 2009. Lecture Notes in Computer Science, vol 5757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04128-0_64
Download citation
DOI: https://doi.org/10.1007/978-3-642-04128-0_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04127-3
Online ISBN: 978-3-642-04128-0
eBook Packages: Computer ScienceComputer Science (R0)