scientific article; zbMATH DE number 6862102
From MaRDI portal
Publication:4636607
DOI10.4230/LIPIcs.STACS.2017.10zbMath1402.68178arXiv1610.02361MaRDI QIDQ4636607
Shantanu Das, Andreas Bärtschi, Daniel Graf, Yann Disser, Jan Hackfeld, Paolo Penna, Jérémie Chalopin
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1610.02361
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)
Related Items (12)
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots ⋮ Energy-Optimal Broadcast in a Tree with Mobile Agents ⋮ Unnamed Item ⋮ On the fast delivery problem with one or two packages ⋮ Collaborative delivery on a fixed path with homogeneous energy-constrained agents ⋮ Gossiping by energy-constrained mobile agents in tree networks ⋮ Collaborative exploration of trees by energy-constrained mobile robots ⋮ Collaborative delivery with energy-constrained mobile robots ⋮ New approximation algorithms for the heterogeneous weighted delivery problem ⋮ New approximation algorithms for the heterogeneous weighted delivery problem ⋮ Searching by heterogeneous agents ⋮ Energy-optimal broadcast and exploration in a tree using mobile agents
This page was built for publication:
