scientific article; zbMATH DE number 6862102

DOI10.4230/LIPICS.STACS.2017.10MaRDI QIDQ4636607zbMATH OpenFDO

Authors Andreas Bärtschi, J. Chalopin, Shantanu Das, Y. Disser, Daniel Graf, Jan Hackfeld, Paolo Penna

Publication date 19 April 2018

Full work available at URL https://arxiv.org/abs/1610.02361

zbMATH Keywords

approximation algorithmsenergy optimizationmessage deliverymobile agents

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Artificial intelligence for robotics (68T40) Approximation algorithms (68W25) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Energy-efficient fast delivery by mobile agents
• Data delivery by energy-constrained mobile agents
• Data delivery by energy-constrained mobile agents on a line
• Collaborative delivery on a fixed path with homogeneous energy-constrained agents
• Collaborative delivery on a fixed path with homogeneous energy-constrained agents
• Collective fast delivery by energy-efficient agents
• Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
• Near-gathering of energy-constrained mobile agents

Cited in

(21)

• Energy-efficient fast delivery by mobile agents
• Data delivery by energy-constrained mobile agents
• Gossiping by energy-constrained mobile agents in tree networks
• On the fast delivery problem with one or two packages
• An efficient algorithm for the fast delivery problem
• Energy-optimal broadcast and exploration in a tree using mobile agents
• Collective fast delivery by energy-efficient agents
• Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
• Energy-Optimal Broadcast in a Tree with Mobile Agents
• Data delivery by energy-constrained mobile agents on a line
• Collaborative delivery on a fixed path with homogeneous energy-constrained agents
• New approximation algorithms for the heterogeneous weighted delivery problem
• New approximation algorithms for the heterogeneous weighted delivery problem
• Near-gathering of energy-constrained mobile agents
• Collaborative delivery on a fixed path with homogeneous energy-constrained agents
• Message Delivery in the Plane by Robots with Different Speeds
• Truthful mechanisms for delivery with agents
• Efficient graph exploration
• On the hardness of the drone delivery problem
• On the min-max heterogeneous weighted delivery problem
• Collaborative exploration of trees by energy-constrained mobile robots

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636607)