Data Delivery by Energy-Constrained Mobile Agents on a Line
We consider n mobile agents of limited energy that are placed on a straight line and that need to collectively deliver a single piece of data from a given source point s to a given target point t on the line. Agents can move only as far as their batteries allow. They can hand over the data when they meet. In this paper we show that deciding whether the agents can deliver the data is (weakly) NP-complete, and for instances where all input values are integers, we present a quasi-, pseudo-polynomial time algorithm that runs in time O(Δ2 ·n1 + 4logΔ), where Δ is the distance between s and t. This answers an open problem stated by Anaya et al.(DISC 2012).
KeywordsMobile agents and robots data aggregation and delivery power-awareness algorithms complexity
Unable to display preview. Download preview PDF.
- 2.Alpern, S., Gal, S.: The theory of search games and rendezvous, vol. 55. Kluwer Academic Pub. (2002)Google Scholar
- 5.Chalopin, J., Das, S., Mihalák, M., Penna, P., Widmayer, P.: Data delivery by energy-constrained mobile agents. In: Proc. 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), pp. 111–122 (2013)Google Scholar
- 6.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)Google Scholar