License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2017.10
URN: urn:nbn:de:0030-drops-70233
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7023/
Go to the corresponding LIPIcs Volume Portal


Bärtschi, Andreas ; Chalopin, Jérémie ; Das, Shantanu ; Disser, Yann ; Graf, Daniel ; Hackfeld, Jan ; Penna, Paolo

Energy-Efficient Delivery by Heterogeneous Mobile Agents

pdf-format:
LIPIcs-STACS-2017-10.pdf (0.7 MB)


Abstract

We consider the problem of delivering m messages between specified source-target pairs in an undirected graph, by k mobile agents initially located at distinct nodes of the graph. Each edge has a designated length and each agent consumes energy proportional to the distance it travels in the graph. We are interested in optimizing the total energy consumption for the team of agents. Unlike previous related work, we consider heterogeneous agents with different rates of energy consumption (weights w_i). To solve the delivery problem, agents face three major challenges: Collaboration (how to work together on each message), Planning (which route to take) and Coordination (how to assign agents to messages). We first show that the delivery problem can be 2-approximated without collaborating and that this is best possible, i.e., we show that the benefit of collaboration is 2 in general. We also show that the benefit of collaboration for a single message is 1 / log 2 which is approximately 1.44. Planning turns out to be NP-hard to approximate even for a single agent, but can be 2-approximated in polynomial time if agents have unit capacities and do not collaborate. We further show that coordination is NP-hard even for agents with unit capacity, but can be efficiently solved exactly if they additionally have uniform weights. Finally, we give a polynomial-time c-approximation for message delivery with unit capacities.

BibTeX - Entry

@InProceedings{brtschi_et_al:LIPIcs:2017:7023,
  author =	{Andreas B{\"a}rtschi and J{\'e}r{\'e}mie Chalopin and Shantanu Das and Yann Disser and Daniel Graf and Jan Hackfeld and Paolo Penna},
  title =	{{Energy-Efficient Delivery by Heterogeneous Mobile Agents}},
  booktitle =	{34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
  pages =	{10:1--10:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-028-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{66},
  editor =	{Heribert Vollmer and Brigitte Vallée},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7023},
  URN =		{urn:nbn:de:0030-drops-70233},
  doi =		{10.4230/LIPIcs.STACS.2017.10},
  annote =	{Keywords: message delivery, mobile agents, energy optimization, approximation algorithms}
}

Keywords: message delivery, mobile agents, energy optimization, approximation algorithms
Seminar: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Issue Date: 2017
Date of publication: 24.02.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI