Minimizing Movement: Fixed-Parameter Tractability release_rg6t6xzwvfhujhfcvxqeek5hbm

by Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx

Released as a article .

2012  

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.
In text/plain format

Archived Files and Locations

application/pdf  532.4 kB
file_u2bnxjz73zc5xdkunheporubhe
arxiv.org (repository)
web.archive.org (webarchive)
application/pdf  532.4 kB
file_wdxdsz4uz5d25grfahpw4tymsi
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2012-11-23
Version   v2
Language   en ?
arXiv  1205.6960v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 14f15133-dea7-4aa4-8f3c-997e578ac4cd
API URL: JSON